Algorithms for GPS operation indoors and downtown
Sahai, Anant
Algorithms for GPS operation indoors and downtown Nainesh Agarwal Æ Julien Basch Æ Paul Beckmann Æ Piyush Bharti Æ Scott Bloebaum Stefano Casadei Æ Andrew Chou Æ Per Enge Æ Wungkum Fong Æ Neesha Hathi. Casadei Æ A. Chou Æ P. Enge Æ W. Fong N. Hathi Æ W. Mann Æ J. Stone Æ J. Tsitsiklis Æ B. Van Roy
Algorithm-Architecture Codesign for Structured Matrix Operations on
Pitsianis, Nikos P.
Algorithm-Architecture Codesign for Structured Matrix Operations on Reconfigurable Systems J. Kim;#12;Algorithm-Architecture Codesign for Structured Matrix Operations on Reconfigurable Systems J. Kim, P 14, 2006 Abstract This article introduces the new ideas and techniques of algorithm-architecture
Detailed balance as a quantum-group symmetry of Kraus operators
Andreas Andersson
2015-07-20
A unital completely positive map governing the time evolution of a quantum system is usually called a quantum channel, and it can be represented by a tuple of operators which are then referred to as the Kraus operators of the channel. We look at states of the system whose correlations with respect to the channel have a certain symmetry. Then we show that detailed balance holds if the Kraus operators satisfy a very interesting algebraic relation which plays an important role in the representation theory of any compact quantum group.
AN OPERATIONAL WATER AND ENERGY BALANCE ALGORITHM FOR PUERTO RICO Eric Harmsen
Gilbes, Fernando
AN OPERATIONAL WATER AND ENERGY BALANCE ALGORITHM FOR PUERTO RICO Eric Harmsen Department.com In this study an operational water and energy balance algorithm for Puerto Rico (GOES- PRWEB) was developed. In the algorithm, an energy balance approach is used to estimate actual evapotranspiration, which
Best Estimate Radiation Flux Value-Added Procedure: Algorithm Operational Details and Explanations
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 OutreachProductswsicloudwsiclouddenDVA N C E D B L O OLaura| National2.11DESERT *BerkeleyBerkeley8 Best Estimate
Operator Objective Function Guidance for a Real-time Unmanned Vehicle Scheduling Algorithm
Clare, A.S.
Advances in autonomy have made it possible to invert the typical operator-to-unmanned-vehicle ratio so that asingle operator can now control multiple heterogeneous unmanned vehicles. Algorithms used in unmanned-vehicle ...
1995-09-01
The Solid Waste Retrieval Facility--Phase 1 (Project W113) will provide the infrastructure and the facility required to retrieve from Trench 04, Burial ground 4C, contact handled (CH) drums and boxes at a rate that supports all retrieved TRU waste batching, treatment, storage, and disposal plans. This includes (1) operations related equipment and facilities, viz., a weather enclosure for the trench, retrieval equipment, weighing, venting, obtaining gas samples, overpacking, NDE, NDA, shipment of waste and (2) operations support related facilities, viz., a general office building, a retrieval staff change facility, and infrastructure upgrades such as supply and routing of water, sewer, electrical power, fire protection, roads, and telecommunication. Title I design for the operations related equipment and facilities was performed by Raytheon/BNFL, and that for the operations support related facilities including infrastructure upgrade was performed by KEH. These two scopes were combined into an integrated W113 Title II scope that was performed by Raytheon/BNFL. This volume represents the total estimated costs for the W113 facility. Operating Contractor Management costs have been incorporated as received from WHC. The W113 Facility TEC is $19.7 million. This includes an overall project contingency of 14.4% and escalation of 17.4%. A January 2001 construction contract procurement start date is assumed.
Solid Waste Operations Complex W-113, Detail Design Report (Title II). Volume 3: Specifications
1995-09-01
The Solid Waste Retrieval Facility--Phase 1 (Project W113) will provide the infrastructure and the facility required to retrieve from Trench 04, Burial ground 4C, contact handled (CH) drums and boxes at a rate that supports all retrieved TRU waste batching, treatment, storage, and disposal plans. This includes (1) operations related equipment and facilities, viz., a weather enclosure for the trench, retrieval equipment, weighing, venting, obtaining gas samples, overpacking, NDE, NDA, shipment of waste and (2) operations support related facilities, viz., a general office building, a retrieval staff change facility, and infrastructure upgrades such as supply and routing of water, sewer, electrical power, fire protection, roads, and telecommunication. Title I design for the operations related equipment and facilities was performed by Raytheon/BNFL, and that for the operations support related facilities including infrastructure upgrade was performed by KEH. These two scopes were combined into an integrated W113 Title II scope that was performed by Raytheon/BNFL. Volume 3 is a compilation of the construction specifications that will constitute the Title II materials and performance specifications. This volume contains CSI specifications for non-equipment related construction material type items, performance type items, and facility mechanical equipment items. Data sheets are provided, as necessary, which specify the equipment overall design parameters.
A. Vaudrey; P. Baucour; F. Lanzetta; R. Glises
2010-08-30
Producing useful electrical work in consuming chemical energy, the fuel cell have to reject heat to its surrounding. However, as it occurs for any other type of engine, this thermal energy cannot be exchanged in an isothermal way in finite time through finite areas. As it was already done for various types of systems, we study the fuel cell within the finite time thermodynamics framework and define an endoreversible fuel cell. Considering different types of heat transfer laws, we obtain an optimal value of the operating temperature, corresponding to a maximum produced power. This analysis is a first step of a thermodynamical approach of design of thermal management devices, taking into account performances of the whole system.
Vaudrey, A; Lanzetta, F; Glises, R
2009-01-01
Producing useful electrical work in consuming chemical energy, the fuel cell have to reject heat to its surrounding. However, as it occurs for any other type of engine, this thermal energy cannot be exchanged in an isothermal way in finite time through finite areas. As it was already done for various types of systems, we study the fuel cell within the finite time thermodynamics framework and define an endoreversible fuel cell. Considering different types of heat transfer laws, we obtain an optimal value of the operating temperature, corresponding to a maximum produced power. This analysis is a first step of a thermodynamical approach of design of thermal management devices, taking into account performances of the whole system.
SEXUAL SELECTION WITH COMPETITIVE/COOPERATIVE OPERATORS FOR GENETIC ALGORITHMS
Bullinaria, John
of Evolutionary Computation. Although GAs were conceived by modelling key elements of natural evolution, one, both in number of generations required and in the quality of solutions. KEY WORDS Genetic Algorithms]. Through gender came the developing of sexual selec tion, a component of natural selection where
NUMERICAL SOLUTION OF RESERVOIR FLOW MODELS BASED ON LARGE TIME STEP OPERATOR SPLITTING ALGORITHMS
NUMERICAL SOLUTION OF RESERVOIR FLOW MODELS BASED ON LARGE TIME STEP OPERATOR SPLITTING ALGORITHMS. Special focus is posed on the numerical solution algorithms for the saturation equation, which. The general background for the reservoir ow model is reviewed, and the main features of the numerical
NUMERICAL SOLUTION OF RESERVOIR FLOW MODELS BASED ON LARGE TIME STEP OPERATOR SPLITTING ALGORITHMS
NUMERICAL SOLUTION OF RESERVOIR FLOW MODELS BASED ON LARGE TIME STEP OPERATOR SPLITTING ALGORITHMS focus is posed on the numerical solution algorithms for the saturation equation, which is a convectionÂ eral background for the reservoir flow model is reviewed, and the main features of the numerical
Powell, B. P.; Azmy, Y. Y.
2013-07-01
The Integral Transport Matrix Method (ITMM) has been shown to be an effective method for solving the neutron transport equation in large domains on massively parallel architectures. In the limit of very large number of processors, the speed of the algorithm, and its suitability for unstructured meshes, i.e. other than an ordered Cartesian grid, is limited by the construction of four matrix operators required for obtaining the solution in each sub-domain. The existing algorithm used for construction of these matrix operators, termed the differential mesh sweep, is computationally expensive and was developed for a structured grid. This work proposes the use of a new algorithm for construction of these operators based on the construction of a single, fundamental matrix representing the transport of a particle along every possible path throughout the sub-domain mesh. Each of the operators is constructed by multiplying an element of this fundamental matrix by two factors dependent only upon the operator being constructed and on properties of the emitting and incident cells. The ITMM matrix operator construction time for the new algorithm is demonstrated to be shorter than the existing algorithm in all tested cases with both isotropic and anisotropic scattering considered. While also being a more efficient algorithm on a structured Cartesian grid, the new algorithm is promising in its geometric robustness and potential for being applied to an unstructured mesh, with the ultimate goal of application to an unstructured tetrahedral mesh on a massively parallel architecture. (authors)
Quantum chaos in the spectrum of operators used in Shor's algorithm
Krishnendu Maity; Arul Lakshminarayan
2006-08-28
We provide compelling evidence for the presence of quantum chaos in the unitary part of Shor's factoring algorithm. In particular we analyze the spectrum of this part after proper desymmetrization and show that the fluctuations of the eigenangles as well as the distribution of the eigenvector components follow the CUE ensemble of random matrices, of relevance to quantized chaotic systems that violate time-reversal symmetry. However, as the algorithm tracks the evolution of a single state, it is possible to employ other operators, in particular it is possible that the generic quantum chaos found above becomes of a nongeneric kind such as is found in the quantum cat maps, and in toy models of the quantum bakers map.
1995-09-01
The Solid Waste Retrieval Facility--Phase 1 (Project W113) will provide the infrastructure and the facility required to retrieve from Trench 04, Burial ground 4C, contact handled (CH) drums and boxes at a rate that supports all retrieved TRU waste batching, treatment, storage, and disposal plans. This includes (1) operations related equipment and facilities, viz., a weather enclosure for the trench, retrieval equipment, weighing, venting, obtaining gas samples, overpacking, NDE, NDA, shipment of waste and (2) operations support related facilities, viz., a general office building, a retrieval staff change facility, and infrastructure upgrades such as supply and routing of water, sewer, electrical power, fire protection, roads, and telecommunication. Title I design for the operations related equipment and facilities was performed by Raytheon/BNFL, and that for the operations support related facilities including infrastructure upgrade was performed by KEH. These two scopes were combined into an integrated W113 Title II scope that was performed by Raytheon/BNFL. Volume 1 provides a comprehensive narrative description of the proposed facility and systems, the basis for each of the systems design, and the engineering assessments that were performed to support the technical basis of the Title II design. The intent of the system description presented is to provide WHC an understanding of the facilities and equipment provided and the A/E`s perspective on how these systems will operate.
Real-Time Combined Heat and Power Operational Strategy Using a Hierarchical Optimization Algorithm
Yun, Kyung Tae; Cho, Heejin; Luck, Rogelio; Mago, Pedro J.
2011-06-01
Existing attempts to optimize the operation of Combined Heat and Power (CHP) systems for building applications have two major limitations: the electrical and thermal loads are obtained from historical weather profiles; and the CHP system models ignore transient responses by using constant equipment efficiencies. This paper considers the transient response of a building combined with a hierarchical CHP optimal control algorithm to obtain a real-time integrated system that uses the most recent weather and electric load information. This is accomplished by running concurrent simulations of two transient building models. The first transient building model uses current as well as forecast input information to obtain short term predictions of the thermal and electric building loads. The predictions are then used by an optimization algorithm, i.e., a hierarchical controller, that decides the amount of fuel and of electrical energy to be allocated at the current time step. In a simulation, the actual physical building is not available and, hence, to simulate a real-time environment, a second, building model with similar but not identical input loads are used to represent the actual building. A state-variable feedback loop is completed at the beginning of each time step by copying, i.e., measuring, the state variable from the actual building and restarting the predictive model using these ?measured? values as initial conditions. The simulation environment presented in this paper features nonlinear effects such as the dependence of the heat exchanger effectiveness on their operating conditions. The results indicate that the CHP engine operation dictated by the proposed hierarchical controller with uncertain weather conditions have the potential to yield significant savings when compared to conventional systems using current values of electricity and fuel prices.
CNMS Operational Organization Chart: Details
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefieldSulfateSciTechtail.Theory of raregovAboutRecovery ActToolsForNorth CarolinaCCI -OutreachScanning Probe
Michele Mosca
2008-08-04
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
Position Summary Employee Details
Ullrich, Paul
Position Summary Employee Details Employee First Name: Employee Last Name: Open Position Employee Eligible: (FLSA) Non-Exempt Employee Relations Unit: (Bargaining Unit) 99 Representation: Uncovered Salary on existing operations. Maintain all records related to user accounts, directory structures, disaster recovery
An algorithm for improving Non-Local Means operators via low-rank approximation
Victor May; Yosi Keller; Nir Sharon; Yoel Shkolnisky
2014-11-20
We present a method for improving a Non Local Means operator by computing its low-rank approximation. The low-rank operator is constructed by applying a filter to the spectrum of the original Non Local Means operator. This results in an operator which is less sensitive to noise while preserving important properties of the original operator. The method is efficiently implemented based on Chebyshev polynomials and is demonstrated on the application of natural images denoising. For this application, we provide a comprehensive comparison of our method with leading denoising methods.
Indoor Localization Algorithms for an Ambulatory Human Operated 3D Mobile Mapping System
Corso, N; Zakhor, A
2013-12-03
Indoor localization and mapping is an important problem with many applications such as emergency response, architectural modeling, and historical preservation. In this paper, we develop an automatic, off-line pipeline for metrically accurate, GPS-denied, indoor 3D mobile mapping using a human-mounted backpack system consisting of a variety of sensors. There are three novel contributions in our proposed mapping approach. First, we present an algorithm which automatically detects loop closure constraints from an occupancy grid map. In doing so, we ensure that constraints are detected only in locations that are well conditioned for scan matching. Secondly, we address the problem of scan matching with poor initial condition by presenting an outlier-resistant, genetic scan matching algorithm that accurately matches scans despite a poor initial condition. Third, we present two metrics based on the amount and complexity of overlapping geometry in order to vet the estimated loop closure constraints. By doing so, we automatically prevent erroneous loop closures from degrading the accuracy of the reconstructed trajectory. The proposed algorithms are experimentally verified using both controlled and real-world data. The end-to-end system performance is evaluated using 100 surveyed control points in an office environment and obtains a mean accuracy of 10 cm. Experimental results are also shown on three additional datasets from real world environments including a 1500 meter trajectory in a warehouse sized retail shopping center.
Shi, Cong, Ph.D. Massachusetts Institute of Technology
2012-01-01
Many if not most of the core problems studied in operations management fall into the category of multi-stage stochastic optimization models, whereby one considers multiple, often correlated decisions to optimize a particular ...
A Feedback-Based Dynamic Tolling Algorithm for High Occupancy Toll (HOT) Lane Operations
Washington at Seattle, University of
, including lost time, wasted energy, excess air pollution, and lost productivity. The 2005 Urban Mobility operations can realize the optimal traffic allocation and enhance overall infrastructure efficiency. However from congestion in the 85 surveyed-urban areas in 2003 (1). It is of practical importance to manage
Operator-splitting finite element algorithms for computations of high-dimensional parabolic problems
Ganesan, Sashikumaar
problems Sashikumaar Ganesan a, , Lutz Tobiska b a Numerical Mathematics and Scientific Computing of Analysis and Numerical Mathematics, Otto-von-Guericke University, PF 4120, D-39016 Magdeburg, Germany a r. The numerical results obtained with the full 3D computations and the operator-split 2D + 1D computations
on the complexity of some hierarchical structured matrix algorithms
2012-05-17
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
Mittal, Shashi, Ph. D. Massachusetts Institute of Technology
2011-01-01
This thesis presents efficient algorithms that give optimal or near-optimal solutions for problems with non-linear objective functions that arise in discrete, continuous and robust optimization. First, we present a general ...
Detailed balance and entanglement
Rocco Duvenhage; Machiel Snyman
2015-03-27
We study a connection between quantum detailed balance, which is a concept of importance in statistical mechanics, and entanglement. We also explore how this connection fits into thermofield dynamics.
Markov Chain Monte Carlo Method without Detailed Balance
Hidemaro Suwa; Synge Todo
2010-10-13
We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in many relevant cases. The absence of the detailed balance also introduces a net stochastic flow in a configuration space, which further boosts up the convergence. We demonstrate that the autocorrelation time of the Potts model becomes more than 6 times shorter than that by the conventional Metropolis algorithm. Based on the same concept, a bounce-free worm algorithm for generic quantum spin models is formulated as well.
Detailed Income Statement Descriptions
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would like submit theCovalent BondingMeeting |Design CompetitionsFuelof 12 Detailed Income
ARM - Detailed Experiment Description
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Comments? WeDatastreamstps Documentation DataDatastreamsxsacrcwrhiDatastreamsxsaprrhiAlaskaDefensiveDetailed
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)Decade Year-0ProvedDecade Year-0Cubic Monthly Actual Data10) Model1991Detailed
Solving radiative transfer with line overlaps using Gauss Seidel algorithms
F. Daniel; J. Cernicharo
2008-07-11
The improvement in observational facilities requires refining the modelling of the geometrical structures of astrophysical objects. Nevertheless, for complex problems such as line overlap in molecules showing hyperfine structure, a detailed analysis still requires a large amount of computing time and thus, misinterpretation cannot be dismissed due to an undersampling of the whole space of parameters. We extend the discussion of the implementation of the Gauss--Seidel algorithm in spherical geometry and include the case of hyperfine line overlap. We first review the basics of the short characteristics method that is used to solve the radiative transfer equations. Details are given on the determination of the Lambda operator in spherical geometry. The Gauss--Seidel algorithm is then described and, by analogy to the plan--parallel case, we see how to introduce it in spherical geometry. Doing so requires some approximations in order to keep the algorithm competitive. Finally, line overlap effects are included. The convergence speed of the algorithm is compared to the usual Jacobi iterative schemes. The gain in the number of iterations is typically factors of 2 and 4 for the two implementations made of the Gauss--Seidel algorithm. This is obtained despite the introduction of approximations in the algorithm. A comparison of results obtained with and without line overlaps for N2H+, HCN, and HNC shows that the J=3-2 line intensities are significantly underestimated in models where line overlap is neglected.
2003 CBECS Detailed Tables: Summary
U.S. Energy Information Administration (EIA) Indexed Site
Tables 2003 CBECS Detailed Tables most recent available Released: September 2008 Building Characteristics | Consumption & Expenditures | End-Use Consumption In the 2003 CBECS,...
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
An Efficient Algorithm for Mapping Imaging Data to 3D Unstructured...
Office of Scientific and Technical Information (OSTI)
Algorithm for Mapping Imaging Data to 3D Unstructured Grids in Computational Biomechanics Citation Details In-Document Search Title: An Efficient Algorithm for Mapping...
Maria Principe; Innocenzo M Pinto
2008-06-27
An analytic model a la Middleton of the impulsive noise component in the data of interferometric gravitational wave detectors is proposed, based on an atomic representation of glitches. A fully analytic characterization of the coherent network data analysis algorithm proposed by Rakhmanov and Klimenko is obtained, for the simplest relevant case of triggered detection of unmodeled gravitational wave bursts, using the above noise model. The detector's performance is evaluated under a suitable central-limit hypothesis, and the effects of both the noisiness of the pseudo-templates, and the presence of the impulsive noise component are highlighted.
Architecture BA (Hons) Key details
Painter, Kevin
Architecture BA (Hons) Key details Duration: 4 years (honours degree) Delivery type: Day Intake in the subject of Architecture, including a portfolio of Design, Technical and Theoretical courses covering all aspects of Architectural Theory and Practice. The course has been designed with reference to the RIBA
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm
International Association for Cryptologic Research (IACR)
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm Shaohua Zhang School of Mathematics, Shandong University, Jinan, Shandong, 250100, PRC Abstract: It is known that Euclid's algorithm, Guass' elimination and Buchberger's algorithm play important roles in algorithmic number the- ory
Canada: Automobile Innovation Fund - Program Detail & Criteria...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Canada: Automobile Innovation Fund - Program Detail & Criteria Canada: Automobile Innovation Fund - Program Detail & Criteria Information from the Canadian Embassy Canada:...
Comparison of Pulsed Sinusoid Radio Frequency Interference Detection Algorithms Using Time and
Ruf, Christopher
Comparison of Pulsed Sinusoid Radio Frequency Interference Detection Algorithms Using Time of two major Radio Frequency Interference (RFI) detection algorithms is compared. The peak detection algorithm and the kurtosis detection algorithm are characterized using the receiver operating characteristic
Topics in Approximation Algorithms
Khare, Monik
2012-01-01
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
Development of an Outdoor Temperature-Based Control Algorithm...
Office of Scientific and Technical Information (OSTI)
Development of an Outdoor Temperature-Based Control Algorithm for Residential Mechanical Ventilation Control Citation Details In-Document Search Title: Development of an Outdoor...
Evaluation of Monte Carlo Electron-Transport Algorithms in the...
Office of Scientific and Technical Information (OSTI)
Evaluation of Monte Carlo Electron-Transport Algorithms in the Integrated Tiger Series Codes for Stochastic-Media Simulations. Citation Details In-Document Search Title: Evaluation...
Nikolova, Evdokia Velinova
2009-01-01
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components ...
A generalized detailed balance relation
David Ruelle
2015-10-28
Given a system $M$ in a thermal bath we obtain a generalized detailed balance relation for the ratio $r=\\pi_\\tau(K\\to J)/\\pi_\\tau(J\\to K)$ of the transition probabilities $M:J\\to K$ and $M:K\\to J$ in time $\\tau$. We assume an active bath, containing solute molecules in metastable states. These molecules may react with $M$ and the transition $J\\to K$ occurs through different channels $\\alpha$ involving different reactions with the bath. We find that $r=\\sum p^\\alpha r^\\alpha$, where $p^\\alpha$ is the probability that channel $\\alpha$ occurs, and $r^\\alpha$ depends on the amount of heat (more precisely enthalpy) released to the bath in channel $\\alpha$.
Detailed Course Module Description | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Detailed Course Module Description Detailed Course Module Description This document lists the course modules for building science courses offered at Cornell's Collaborator...
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09
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.
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15
We report on several improvements of the local bosonic algorithm proposed by M. Luescher. We find that preconditioning and over-relaxation works very well. A detailed comparison between the bosonic and the Kramers-algorithms shows comparable performance for the physical situation examined.
Driving Operational Changes through an Energy Monitoring System
2012-08-01
Institutional change case study details IBM's corporate efficiency program focused on basic operation improvements in its diverse real estate operations.
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS
van de Geijn, Robert A.
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS PAOLO BIENTINESI AND ROBERT A. VAN DE GEIJN Abstract. We present a notation that allows a dense linear algebra algorithm subvectors and submatrices allowing the details of the algorithm to be the focus while hiding the intricate
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
Accelerating Majorization Algorithms
Leeuw, Jan de
2008-01-01
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
KIRKPATRICK, BONNIE
2011-01-01
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Beyond bolts : architectural details, construction, meaning
Weber, Peter Dominic
1991-01-01
An architectural Detail is a small piece of the whole, yet it has the power to characterize and define the entire building. Details tell us what a building is; they are fundamental to the life and personality of a space. ...
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05
It was recently shown (quant-ph/9909074) that parasitic random interactions between the qubits in a quantum computer can induce quantum chaos and put into question the operability of a quantum computer. In this work I investigate whether already the interactions between the qubits introduced with the intention to operate the quantum computer may lead to quantum chaos. The analysis focuses on two well--known quantum algorithms, namely Grover's search algorithm and the quantum Fourier transform. I show that in both cases the same very unusual combination of signatures from chaotic and from integrable dynamics arises.
Synchronization Algorithms for Co-Simulation of Power Grid and Communication Networks
Ciraci, Selim; Daily, Jeffrey A.; Agarwal, Khushbu; Fuller, Jason C.; Marinovici, Laurentiu D.; Fisher, Andrew R.
2014-09-11
The ongoing modernization of power grids consists of integrating them with communication networks in order to achieve robust and resilient control of grid operations. To understand the operation of the new smart grid, one approach is to use simulation software. Unfortunately, current power grid simulators at best utilize inadequate approximations to simulate communication networks, if at all. Cooperative simulation of specialized power grid and communication network simulators promises to more accurately reproduce the interactions of real smart grid deployments. However, co-simulation is a challenging problem. A co-simulation must manage the exchange of informa- tion, including the synchronization of simulator clocks, between all simulators while maintaining adequate computational perfor- mance. This paper describes two new conservative algorithms for reducing the overhead of time synchronization, namely Active Set Conservative and Reactive Conservative. We provide a detailed analysis of their performance characteristics with respect to the current state of the art including both conservative and optimistic synchronization algorithms. In addition, we provide guidelines for selecting the appropriate synchronization algorithm based on the requirements of the co-simulation. The newly proposed algorithms are shown to achieve as much as 14% and 63% im- provement, respectively, over the existing conservative algorithm.
Resource analysis of the quantum linear system algorithm
Artur Scherer; Benoît Valiron; Siun-Chuon Mau; Scott Alexander; Eric van den Berg; Thomas E. Chapuran
2015-05-25
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described generalization [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order $10^{25}$ if oracle costs are excluded, and a circuit width and depth of order $10^8$ and $10^{29}$, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.
Data-flow algorithms for parallel matrix computations
O'Leary, D.P.; Stewart, G.W.
1985-08-01
This document develops some algorithms and tools for solving matrix problems on parallel-processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, the authors present algorithms that form the main modules for solving Liapounov matrix equations. They compare this approach to wave-front array processors and systolic arrays, and note its advantages in handling mis-sized problems, in evaluating variations of algorithms or architectures, in moving algorithms from system to system, and in debugging parallel algorithms on sequential machines.
Business & Finance BA / MA (Hons) Key details
Painter, Kevin
Operations Manager, Production Manager, Quality Control, Logistics Manager, Business Interpreter, Marketing, Operations Management, Commercial Law and Human Resource Management. Finance subjects include Finance Theory or public administration. Operating in international markets requires an understanding of international
Supplement: The & and | Operators For Introduction to Programming with C++
Liang, Y. Daniel
Supplement: The & and | Operators For Introduction to Programming with C++ By Y. Daniel Liang C operations. See Supplement III.K, "Bit Operations," for details. #12;
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these trajectories can then be made to obtain the best computational complexity and control over errors. As an explicit example, Grover's quantum search algorithm is described as a Hamiltonian evolution problem. It is shown that the computational complexity has a power-law dependence on error when a straightforward Lie-Trotter discretisation formula is used, and it becomes logarithmic in error when reflection operators are used. The exponential change in error control is striking, and can be used to improve many importance sampling methods. The key concept is to make the evolution steps as large as possible while obeying the constraints of the problem. In particular, we can understand why overrelaxation algorithms are superior to small step size algorithms.
Digitales Video Scanline Algorithms -1 -
that exploits simplifications in digital filtering and memory access. The geometric transformations a special class of geometric transformation techniques that operate only along rows and columns. The purpose be resampled independently of the other. Separable algorithms spatially transform 2-D images by decomposing
Contact details: School of Architecture, BCU
Birmingham, University of
Contact details: School of Architecture, BCU Dr. Richard Coles, Co investigator Richard Economic Fabric This work package investigated opportunities and barriers to achieving sustainable is to be sustainable in the widest sense. Contact details: Centre for Urban and Regional Studies, U0B Dr. Austin Barber
Detailed Building Reconstruction With Shape Templates
Schindler, Konrad
Detailed Building Reconstruction With Shape Templates Konrad Schindler 1 and Joachim Bauer 2 1, Austria bauer@vrvis.at Abstract: We present a model-based method for detailed automatic building reconstruction from images. The method starts with recovering a coarse building model consisting of the main
Horava-Lifshitz gravity with detailed balance
Daniele Vernieri; Thomas P. Sotiriou
2012-12-18
Horava-Lifshitz gravity with "detailed balance" but without the projectability assumption is discussed. It is shown that detailed balance is quite efficient in limiting the proliferation of couplings in Horava-Lifshitz gravity, and that its implementation without the projectability assumption leads to a theory with sensible dynamics. However, the (bare) cosmological constant is restricted to be large and negative.
Honours APPLICATION UG 2. CONTACT DETAILS
Du, Jie
of Sydney student number: Citizenship: Australian citizen New Zealand citizen Australian permanent resident.e. not an Australian citizen, permanent resident or New Zealand citizen) Title: Gender: Family Name: Given names school/unit/discipline for further details. #12;4. HONOURS DETAILS Majors in science subject area(s) (if
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
Civil Engineering BEng (Hons) Key details
Painter, Kevin
Civil Engineering BEng (Hons) Key details Duration: Full-time: 4 years (BEng Hons) Delivery type engineering disciplines of Structures, Geotechnics, Water Engineering and Transportation Engineering civil or structural engineers. After graduation, students are equipped to work for consultants
Residential Composting Intern Position Position Details
Royer, Dana
Residential Composting Intern Position Position Details The dining composting intern positions during Orientation week to set up the composting programs and stay through Senior Week to finish composting program. The interns will report to Sustainability Coordinator Jen Kleindienst. Requirements
Matrix product operator representations
V. Murg; J. I. Cirac; B. Pirvu; F. Verstraete
2008-04-24
We show how to construct relevant families of matrix product operators in one and higher dimensions. Those form the building blocks for the numerical simulation methods based on matrix product states and projected entangled pair states. In particular, we construct translational invariant matrix product operators suitable for time evolution, and show how such descriptions are possible for Hamiltonians with long-range interactions. We illustrate how those tools can be exploited for constructing new algorithms for simulating quantum spin systems.
Cooling algorithms based on the 3-bit majority
Phillip Kaye
2007-05-15
Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be practicable are those based on simple reversible polarization compression (RPC) operations acting locally on small numbers of bits. Several different algorithms using 2- and 3-bit RPC operations have appeared in the literature, and these are the algorithms I consider in this note. Specifically, I show that the RPC operation used in all these algorithms is essentially a majority vote of 3 bits, and prove the optimality of the best such algorithm. I go on to derive some theoretical bounds on the performance of these algorithms under some specific assumptions about errors.
Pázsit, Imre
NUCLEAR PLANT OPERATIONS AND CONTROL KEYWORDS: neutron flux, cur- rent noise, vibration diagnostics, localization algorithm LOCALIZATION OF A VIBRATING CONTROL ROD PIN IN PRESSURIZED WATER REACTORS USING. The possibility of the localization of a vibrating control rod pin in a pressurized water reactor control assembly
ISE 172: Algorithms in Systems Engineering Dr. Ted Ralphs
Ralphs, Ted
, analyzing, and imple- menting basic algorithms common in systems engineering applications. The courseISE 172: Algorithms in Systems Engineering Syllabus Dr. Ted Ralphs Spring 2015 1 Miscellaneous will be divided into five units by topic area (see detailed syllabus below). Course meetings will consist of three
1999 Commercial Building Characteristics--Detailed Tables--Principal...
U.S. Energy Information Administration (EIA) Indexed Site
Principal Building Activities > Detailed Tables-Principal Building Activities Complete Set of 1999 CBECS Detailed Tables Detailed Tables-Principal Building Activities Table B1....
1999 Commercial Building Characteristics--Detailed Tables--Year...
U.S. Energy Information Administration (EIA) Indexed Site
Year Constructed > Detailed Tables-Year Constructed Complete Set of 1999 CBECS Detailed Tables Detailed Tables-Year Constructed Table B8. Year Constructed, Number of Buildings...
Detailed Programme, Next Generation Energy and Resources
Twente, Universiteit
Detailed Programme, Next Generation Energy and Resources The duration of the full graduate program Next Generation Energy and Resources is in principle 6 years. Depending on prior courses, trainings representation of the graduate program Next Generation Energy and Resources Year 1 - 2 Compulsory courses (30 EC
Fashion Marketing & Retailing BA (Hons) Key details
Painter, Kevin
Fashion Marketing & Retailing BA (Hons) Key details Duration: Full-time: 3 years (BA) / 4 years (BA Hons) Delivery type: Day Intake date: September Fees: 54000 AED per year Overview Our Fashion Marketing and Retailing programme confidently prepares students for a career within the marketing and retailing industry
Chemical Engineering BEng (Hons) Key details
Painter, Kevin
Chemical Engineering BEng (Hons) Key details Duration: Full-time: 3 years (BEng) / 4 years (BEng Hons) Delivery type: Day Intake date: September Fees: 58000 AED per year Overview Chemical engineering successful and thriving types of business in the world. Chemical engineers play a vital role in achieving
Property Loss / Damage Report Damage Loss Details
Ponce, V. Miguel
Property Loss / Damage Report Damage Loss Details Date & Time of Damage / Loss: Type of damage / loss: Location - specific address / room: Project / Grant associated with damage / loss - grant Police: When was damage / loss first discovered - BY WHOM: Pictures available or attached? Was personal
Psychology with Management BSc (Hons) Key details
Painter, Kevin
Psychology with Management BSc (Hons) Key details Duration: Full-time: 4 years Delivery type: Day% Psychology with 25% Business and Management modules. Psychology modules cover a range of core approaches to psychology as well as research design and analysis and applied specialist topics. The curriculum is based
Detailed balance analysis of nanophotonic solar cells
Fan, Shanhui
Detailed balance analysis of nanophotonic solar cells Sunil Sandhu, Zongfu Yu, and Shanhui Fan-voltage characteristic modeling of nanophotonic solar cells. This approach takes into account the intrinsic material non-idealities, and is useful for determining the theoretical limit of solar cell efficiency for a given structure. Our approach
Contact Details Journeying Beyond Breast Cancer
Espinosa, Horacio D.
Home About Contact Details Facebook Search Journeying Beyond Breast Cancer making sense of the cancer experience Feeds: Posts Comments Cancer-fighting fountain pen May 20, 2009 by JBBC A research team be used both as a research tool in the development of next-generation cancer treatments
Business Management BA / MA (Hons) Key details
Painter, Kevin
Business Management BA / MA (Hons) Key details Duration: Full-time: 3 years (BA) / 4 years (MSc Management degree programme follows a number of guiding principles that mirror the values of managers of leading organisations and reflect current business management thinking. In the first two years of all
Automotive Engineering BEng (Hons) Key details
Painter, Kevin
Automotive Engineering BEng (Hons) Key details Duration: Full-time: 3 years (BEng) / 4 years (BEng programme, but allows students in the later years to specialise in subjects relating to automotive technology. Automotive engineering continues to be a major employer of professional engineers, owing
Detailed balance in Horava-Lifshitz gravity
Gianluca Calcagni
2010-02-04
We study Horava-Lifshitz gravity in the presence of a scalar field. When the detailed balance condition is implemented, a new term in the gravitational sector is added in order to maintain ultraviolet stability. The four-dimensional theory is of a scalar-tensor type with a positive cosmological constant and gravity is nonminimally coupled with the scalar and its gradient terms. The scalar field has a double-well potential and, if required to play the role of the inflation, can produce a scale-invariant spectrum. The total action is rather complicated and there is no analog of the Einstein frame where Lorentz invariance is recovered in the infrared. For these reasons it may be necessary to abandon detailed balance. We comment on open problems and future directions in anisotropic critical models of gravity.
Matrix multiplication operations with data pre-conditioning in...
Office of Scientific and Technical Information (OSTI)
operations with data pre-conditioning in a high performance computing architecture Citation Details In-Document Search Title: Matrix multiplication operations with...
Supplement: The & and | Operators For Introduction to Java Programming
Liang, Y. Daniel
8 Supplement: The & and | Operators For Introduction to Java Programming By Y. Daniel Liang Java operations. See Supplement III.D, "Bit Manipulations," for details. #12;
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
Algorithms and Problem Solving Introduction
Razak, Saquib
Unit 16 1 Algorithms and Problem Solving · Introduction · What is an Algorithm? · Algorithm Properties · Example · Exercises #12;Unit 16 2 What is an Algorithm? What is an Algorithm? · An algorithm. · The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
Final Report: Sublinear Algorithms for In-situ and In-transit Data Analysis at Exascale.
Bennett, Janine Camille; Pinar, Ali; Seshadhri, C.; Thompson, David; Salloum, Maher; Bhagatwala, Ankit; Chen, Jacqueline H.
2015-09-01
Post-Moore's law scaling is creating a disruptive shift in simulation workflows, as saving the entirety of raw data to persistent storage becomes expensive. We are moving away from a post-process centric data analysis paradigm towards a concurrent analysis framework, in which raw simulation data is processed as it is computed. Algorithms must adapt to machines with extreme concurrency, low communication bandwidth, and high memory latency, while operating within the time constraints prescribed by the simulation. Furthermore, in- put parameters are often data dependent and cannot always be prescribed. The study of sublinear algorithms is a recent development in theoretical computer science and discrete mathematics that has significant potential to provide solutions for these challenges. The approaches of sublinear algorithms address the fundamental mathematical problem of understanding global features of a data set using limited resources. These theoretical ideas align with practical challenges of in-situ and in-transit computation where vast amounts of data must be processed under severe communication and memory constraints. This report details key advancements made in applying sublinear algorithms in-situ to identify features of interest and to enable adaptive workflows over the course of a three year LDRD. Prior to this LDRD, there was no precedent in applying sublinear techniques to large-scale, physics based simulations. This project has definitively demonstrated their efficacy at mitigating high performance computing challenges and highlighted the rich potential for follow-on re- search opportunities in this space.
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Occurrence Reporting and Processing of Operations Information
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1995-09-25
This Manual provides detailed requirements to supplement DOE O 232.1, Occurrence Reporting and Processing of Operations Information. Chg 1 dated 8-12-96.
Zaki, Mohammed Javeed
a reduction at the end of each pass to construct the global patterns, thus incurring high synchronization cost. In this paper we describe a new parallel association min ing algorithm. Our algorithm is a result of detailed is local to each processor. After the initial setup phase, the algorithm eliminates the need for further
Zaki, Mohammed Javeed
a reduction at the end of each pass to construct the global patterns, thus incurring high synchronization cost. In this paper we describe a new parallel association min- ing algorithm. Our algorithm is a result of detailed is local to each processor. After the initial set-up phase, the algorithm eliminates the need for further
Rubinfeld, Ronitt
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can ...
Algorithms for strategic agents
Weinberg, S. Matthew (Seth Matthew)
2014-01-01
In traditional algorithm design, no incentives come into play: the input is given, and your algorithm must produce a correct output. How much harder is it to solve the same problem when the input is not given directly, but ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01
Indigenous Optimizing Algorithm. Mathematical Anthropologythe use of maximizing algorithms in behavior is a crucialthe knowledge, rules, and algorithms that they apply. If we
Variational Algorithms for Marginal MAP
Liu, Q; Ihler, A
2013-01-01
2004. A. L. Yuille. CCCP algorithms to minimize the BetheA tutorial on MM algorithms. The American Statistician, 1(time approximation algorithms for the ising model. SIAM
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Tripol condensate polishing - operational experience
Swainsbury, D. [Mission Energy Management Australia, Victoria (Australia)
1995-01-01
This paper gives a brief outline of the Mission Energy Management Australia Company who operate and maintain the Loy Yang B Power Station in the Latrobe Valley, Victoria, Australia. Details of the plant configuration, the water/steam circuit and cycle chemistry are discussed. The arrangement of the TRIPOL Condensate Polishing Plant and it`s operational modes are examined. Results of the first twelve months operation of the TRIPOL plant are detailed. Levels of crud removal during early commissioning phases employing the pre-filter are presented. Typical parameters achieved during a simulated condenser leak and an operational run beyond the ammonia break point are also documented.
Simulation levels of detail for plant motion
Beaudoin, Jacob Michael
2013-02-22
that motion interactive [PCOI, DCFOI, EMF03]. A comparison of our method with some of these other methods is provided in section 7. 1. SLODs have come into prominence only in the last few years [Ber97, CF97]. They have sometimes taken other names ? Endo et... al. refer to them as levels of motion detail, or LOmDs [EMF03]. There have been a wide variety of applications for SLODs. These include rigid body dynamics and motion [CIF99, DO01, CAF01], simple collision detection and response [CH97, ODG*03...
Property:Project Details | Open Energy Information
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QAsource HistoryPotentialRuralUtilityScalePVGeneration Jump to: navigation,Power Transfer MethodCity Jump to:Details
CBECS 1992 - Consumption & Expenditures, Detailed Tables
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)Decade Year-0ProvedDecade2,948 2,724per ThousandLease0 0and164 167Detailed Tables
First Detailed Look at RNA Dicer
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home Room NewsInformation Current HABFES OctoberEvanServices Â» IncentivesStocksFirst Detailed Look
First Detailed Look at RNA Dicer
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration would likeUniverse (Journal Article) |Final Reportthe Growing American66-2012,First DayDetailed
Physical Algorithms Roger Wattenhofer
Physical Algorithms Roger Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information
Algorithmic proof of Barnette's Conjecture
I. Cahit
2009-04-22
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the operation of opening disjoint chambers, bu using spiral-chain like movement of the outer-cycle elastic-sticky edges of the cubic planar graph. In fact we have shown that in hamiltonicity of Barnette graph a single-chamber or double-chamber with a bridge face is enough to transform the problem into finding specific hamiltonian path in the cubic bipartite graph reduced. In the last part of the paper we have demonstrated that, if the given cubic planar graph is non-hamiltonian then the algorithm which constructs spiral-chain (or double-spiral chain) like chamber shows that except one vertex there exists (n-1)-vertex cycle.
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
Relation between XL algorithm and Grobner Bases Algorithms
International Association for Cryptologic Research (IACR)
Relation between XL algorithm and Gr¨obner Bases Algorithms Makoto Sugita1 , Mitsuru Kawazoe2 the XL algorithm and Gr¨obner bases algorithms. The XL algorithm was proposed to be a more efficient algorithm to solve a system of equations with a special assumption with- out trying to calculate a whole Gr
New details on nuclear weapons program bared
Hileman, B.
1994-07-11
In a continuing effort to be more candid about Department of Energy nuclear weapons programs, Energy Secretary Hazel R. O'Leary recently declassified a substantial amount of information. On June 27, she revealed details about total US weapons-grade uranium production, testing of a bomb made of reactor-grade plutonium, radiation experiments conducted on humans since the 1920s, and underground and atmospheric nuclear weapons tests. O'Leary explains the new revelations by saying thousands of people in meetings across the country this year have told her that openness in government is very important. DOE is responding today in a manner that both satisfies the strong public interest and respects critical national security requirements.
A meaningful expansion around detailed balance
Matteo Colangeli; Christian Maes; Bram Wynants
2011-01-18
We consider Markovian dynamics modeling open mesoscopic systems which are driven away from detailed balance by a nonconservative force. A systematic expansion is obtained of the stationary distribution around an equilibrium reference, in orders of the nonequilibrium forcing. The first order around equilibrium has been known since the work of McLennan (1959), and involves the transient irreversible entropy flux. The expansion generalizes the McLennan formula to higher orders, complementing the entropy flux with the dynamical activity. The latter is more kinetic than thermodynamic and is a possible realization of Landauer's insight (1975) that, for nonequilibrium, the relative occupation of states also depends on the noise along possible escape routes. In that way nonlinear response around equilibrium can be meaningfully discussed in terms of two main quantities only, the entropy flux and the dynamical activity. The expansion makes mathematical sense as shown in the simplest cases from exponential ergodicity.
Sec$on Summary ! Properties of Algorithms
#12;Sec$on Summary ! Properties of Algorithms ! Algorithms for Searching and Sorting ! Greedy Algorithms ! Halting Problem #12;Problems and Algorithms ! In many. This procedure is called an algorithm. #12;Algorithms Definition: An algorithm
1999 Commercial Building Characteristics--Detailed Tables--Census...
U.S. Energy Information Administration (EIA) Indexed Site
Census Region > Detailed Tables-Census Region Complete Set of 1999 CBECS Detailed Tables Detailed Tables-Census Region Table B3. Census Region, Number of Buildings and Floorspace...
San Joaquin-Tulare Conjunctive Use Model: Detailed model description
Quinn, N.W.T.
1992-03-01
The San Joaquin - Tulare Conjunctive Use Model (SANTUCM) was originally developed for the San Joaquin Valley Drainage Program to evaluate possible scenarios for long-term management of drainage and drainage - related problems in the western San Joaquin Valley of California. A unique aspect of this model is its coupling of a surface water delivery and reservoir operations model with a regional groundwater model. The model also performs salinity balances along the tributaries and along the main stem of the San Joaquin River to allow assessment of compliance with State Water Resources Control Board water quality objectives for the San Joaquin River. This document is a detailed description of the various subroutines, variables and parameters used in the model.
Overview of Detailed Chemical Speciation and Particle Sizing...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Detailed Chemical Speciation and Particle Sizing for Diesel Exhaust, Both Real Time and Filter Based Measurements Overview of Detailed Chemical Speciation and Particle Sizing for...
Improving Combustion Software to Solve Detailed Chemical Kinetics...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Combustion Software to Solve Detailed Chemical Kinetics for HECC Improving Combustion Software to Solve Detailed Chemical Kinetics for HECC 2012 DOE Hydrogen and Fuel Cells Program...
Shivakumar, R
2010-01-01
The Application of Bio Inspired Algorithms to complicated Power System Stability Problems has recently attracted the researchers in the field of Artificial Intelligence. Low frequency oscillations after a disturbance in a Power system, if not sufficiently damped, can drive the system unstable. This paper provides a systematic procedure to damp the low frequency oscillations based on Bio Inspired Genetic (GA) and Particle Swarm Optimization (PSO) algorithms. The proposed controller design is based on formulating a System Damping ratio enhancement based Optimization criterion to compute the optimal controller parameters for better stability. The Novel and contrasting feature of this work is the mathematical modeling and simulation of the Synchronous generator model including the Steam Governor Turbine (GT) dynamics. To show the robustness of the proposed controller, Non linear Time domain simulations have been carried out under various system operating conditions. Also, a detailed Comparative study has been don...
Brambley, Michael R.; Katipamula, Srinivas
2006-10-06
Pacific Northwest National Laboratory (PNNL) is assisting the U.S. Department of Energy (DOE) Distributed Energy (DE) Program by developing advanced control algorithms that would lead to development of tools to enhance performance and reliability, and reduce emissions of distributed energy technologies, including combined heat and power technologies. This report documents phase 2 of the program, providing a detailed functional specification for algorithms for performance monitoring and commissioning verification, scheduled for development in FY 2006. The report identifies the systems for which algorithms will be developed, the specific functions of each algorithm, metrics which the algorithms will output, and inputs required by each algorithm.
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21
We consider deterministic and {\\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\\in\\{H_1,...,H_m\\}$, $H=\\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\\e$ at least have $\\Omega(t^{3/2}\\e^{-1/2})$ exponentials.
An Adaptive Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-11-03
In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.
Detailed Chemical Kinetic Modeling of Cyclohexane Oxidation
Silke, E J; Pitz, W J; Westbrook, C K; Ribaucour, M
2006-11-10
A detailed chemical kinetic mechanism has been developed and used to study the oxidation of cyclohexane at both low and high temperatures. Reaction rate constant rules are developed for the low temperature combustion of cyclohexane. These rules can be used for in chemical kinetic mechanisms for other cycloalkanes. Since cyclohexane produces only one type of cyclohexyl radical, much of the low temperature chemistry of cyclohexane is described in terms of one potential energy diagram showing the reaction of cyclohexyl radical + O{sub 2} through five, six and seven membered ring transition states. The direct elimination of cyclohexene and HO{sub 2} from RO{sub 2} is included in the treatment using a modified rate constant of Cavallotti et al. Published and unpublished data from the Lille rapid compression machine, as well as jet-stirred reactor data are used to validate the mechanism. The effect of heat loss is included in the simulations, an improvement on previous studies on cyclohexane. Calculations indicated that the production of 1,2-epoxycyclohexane observed in the experiments can not be simulated based on the current understanding of low temperature chemistry. Possible 'alternative' H-atom isomerizations leading to different products from the parent O{sub 2}QOOH radical were included in the low temperature chemical kinetic mechanism and were found to play a significant role.
An Estimation of Distribution Particle Swarm Optimization Algorithm
Kent, University of
evaluations. 1 Introduction The first Particle Swarm Optimization (PSO) algorithm was introduced by Kennedy other population-based optimization algorithms, PSO is initialized with a population of complete multiplication operator. Clerc and Kennedy [2] introduced the concept of constriction in PSO. Since it is based
A thermoacoustic-Stirling heat engine: Detailed study
Backhaus, S.; Swift, G. W.
2000-06-01
A new type of thermoacoustic engine based on traveling waves and ideally reversible heat transfer is described. Measurements and analysis of its performance are presented. This new engine outperforms previous thermoacoustic engines, which are based on standing waves and intrinsically irreversible heat transfer, by more than 50%. At its most efficient operating point, it delivers 710 W of acoustic power to its resonator with a thermal efficiency of 0.30, corresponding to 41% of the Carnot efficiency. At its most powerful operating point, it delivers 890 W to its resonator with a thermal efficiency of 0.22. The efficiency of this engine can be degraded by two types of acoustic streaming. These are suppressed by appropriate tapering of crucial surfaces in the engine and by using additional nonlinearity to induce an opposing time-averaged pressure difference. Data are presented which show the nearly complete elimination of the streaming convective heat loads. Analysis of these and other irreversibilities show which components of the engine require further research to achieve higher efficiency. Additionally, these data show that the dynamics and acoustic power flows are well understood, but the details of the streaming suppression and associated heat convection are only qualitatively understood. (c) 2000 Acoustical Society of America.
Detailed model for practical pulverized coal furnaces and gasifiers
Philips, S.D.; Smoot, L.D.
1989-08-01
The need to improve efficiency and reduce pollutant emissions commercial furnaces has prompted energy companies to search for optimized operating conditions and improved designs in their fossil-fuel burning facilities. Historically, companies have relied on the use of empirical correlations and pilot-plant data to make decisions about operating conditions and design changes. The high cost of collecting data makes obtaining large amounts of data infeasible. The main objective of the data book is to provide a single source of detailed three-dimensional combustion and combustion-related data suitable for comprehensive combustion model evaluation. Five tasks were identified as requirements to achieve the main objective. First, identify the types of data needed to evaluate comprehensive combustion models, and establish criteria for selecting the data. Second, identify and document available three-dimensional combustion data related to pulverized coal combustion. Third, collect and evaluate three-dimensional data cases, and select suitable cases based on selection criteria. Fourth, organize the data sets into an easy-to-use format. Fifth, evaluate and interpret the nature and quality of the data base. 39 refs., 15 figs., 14 tabs.
External-Memory Algorithms with Applications in GIS -(L. Arge)
de Figueiredo, Luiz Henrique
Algorithms · GIS Thematic Maps stored as layers · geometric: roads, cities, etc. · abstract: population density, land utilization, pollution level Fundamental Operation: Map overlaying · Agricultural land: land utilization X pollution levels · Many important problems from computational geometry
A resource allocation algorithm for wide area search ammunitions
Rathinam, Sivakumar
2001-01-01
The objective of this research is to design a decision algorithm to assign weapons (or vehicles) with the appropriate mode of operation to search, classify and attack as many targets as possible. This work also presents the benefits of cooperation...
Trajectory-switching algorithm for a MEMS gyroscope
Park, Sungsu; Horowitz, Roberto; Hong, Sung Kyung; Nam, Yoonsu
2007-01-01
mode of operation of MEMS gyroscope,” J. Microelectromech.SWITCHING ALGORITHM FOR A MEMS GYROSCOPE [5] S. Chang, M.design data of the MIT-SOI MEMS gyroscope was conducted to
Planning and scheduling proximity operations for autonomous orbital rendezvous
Guerra, Christopher J., 1978-
2003-01-01
This thesis develops a mixed integer programming formulation to solve the proximity operations scheduling problem for autonomous orbital rendezvous. The algorithm of this thesis allows the operator to specify planned modes, ...
Realization of a scalable Shor algorithm
Thomas Monz; Daniel Nigg; Esteban A. Martinez; Matthias F. Brandl; Philipp Schindler; Richard Rines; Shannon X. Wang; Isaac L. Chuang; Rainer Blatt
2015-07-31
Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in 1994 that Peter Shor came up with an algorithm that is able to calculate the prime factors of a large number vastly more efficiently than known possible with a classical computer. This paradigmatic algorithm stimulated the flourishing research in quantum information processing and the quest for an actual implementation of a quantum computer. Over the last fifteen years, using skillful optimizations, several instances of a Shor algorithm have been implemented on various platforms and clearly proved the feasibility of quantum factoring. For general scalability, though, a different approach has to be pursued. Here, we report the realization of a fully scalable Shor algorithm as proposed by Kitaev. For this, we demonstrate factoring the number fifteen by effectively employing and controlling seven qubits and four "cache-qubits", together with the implementation of generalized arithmetic operations, known as modular multipliers. The scalable algorithm has been realized with an ion-trap quantum computer exhibiting success probabilities in excess of 90%.
Nonlinear Transformations and Filtering Theory for Space Operations
Weisman, Ryan Michael 1984-
2012-11-19
the state domain probability density function yielding a form which does not necessarily resemble the form assumed in the filtering algorithm. The distortion effect must be understood in greater detail and appropriately accounted for so that even if sensors...
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01
and A. Spillner. Consistency of the Neighbor-Net algorithm.Algorithms for Molecular Biology, 2:8, 2007. [10] P.D. Gusfield. Efficient algorithms for inferring evolutionary
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Gradient symplectic algorithms for solving the radial Schrdinger equation Siu A. China
Chin, Siu A.
Gradient symplectic algorithms for solving the radial Schrödinger equation Siu A. China and Petr for their excellent conservation properties. The class of gradient symplectic algorithms is particularly suited. 69, 161 1993 for decomposing time-ordered operators, these algorithms can be easily applied
Two Studies Reveal Details of Lithium-Battery Function
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Two Studies Reveal Details of Lithium-Battery Function Two Studies Reveal Details of Lithium-Battery Function Print Wednesday, 27 February 2013 00:00 Our way of life is deeply...
1999 Commercial Building Characteristics--Detailed Tables--Size...
U.S. Energy Information Administration (EIA) Indexed Site
Complete Set of 1999 CBECS Detailed Tables Detailed Tables- of Buildings Table B6. Building Size, Number of Buildings b6.pdf (PDF file), b6.xls (Excel spreadsheet file), b6.txt...
Alternate States of Proteins Revealed by Detailed Energy Landscape Mapping
Baker, David
Alternate States of Proteins Revealed by Detailed Energy Landscape Mapping Michael D. Tyka1 Keywords: Rosetta; alternative conformations; protein mobility; structure prediction; validation What through analysis of detailed protein energy landscapes generated by large-scale, native- enhanced sampling
Aceves, S; Dibble, R; Flowers, D; Smith, J R; Westbrook, C K
1999-07-19
This paper uses the HCT (Hydrodynamics, Chemistry and Transport) chemical kinetics code to analyze natural gas HCCI combustion in an engine. The HCT code has been modified to better represent the conditions existing inside an engine, including a wall heat transfer correlation. Combustion control and low power output per displacement remain as two of the biggest challenges to obtaining satisfactory performance out of an HCCI engine, and these are addressed in this paper. The paper considers the effect of natural gas composition on HCCI combustion, and then explores three control strategies for HCCI engines: DME (dimethyl ether) addition, intake heating and hot EGR addition. The results show that HCCI combustion is sensitive to natural gas composition, and an active control may be required to compensate for possible changes in composition. The three control strategies being considered have a significant effect in changing the combustion parameters for the engine, and should be able to control HCCI combustion.
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
Optimized Algorithms Boost Combustion Research
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Optimized Algorithms Boost Combustion Research Optimized Algorithms Boost Combustion Research Methane Flame Simulations Run 6x Faster on NERSC's Hopper Supercomputer November 25,...
Stirling machine operating experience
Ross, B.; Dudenhoefer, J.E.
1994-09-01
Numerous Stirling machines have been built and operated, but the operating experience of these machines is not well known. It is important to examine this operating experience in detail, because it largely substantiates the claim that stirling machines are capable of reliable and lengthy operating lives. The amount of data that exists is impressive, considering that many of the machines that have been built are developmental machines intended to show proof of concept, and are not expected to operate for lengthy periods of time. Some Stirling machines (typically free-piston machines) achieve long life through non-contact bearings, while other Stirling machines (typically kinematic) have achieved long operating lives through regular seal and bearing replacements. In addition to engine and system testing, life testing of critical components is also considered. The record in this paper is not complete, due to the reluctance of some organizations to release operational data and because several organizations were not contacted. The authors intend to repeat this assessment in three years, hoping for even greater participation.
Results of Detailed Hydrologic Characterization Tests - Fiscal Year 2003
Spane, Frank A.; Newcomer, Darrell R.
2004-09-13
This report presents results obtained from detailed hydrologic characterization of the unconfined aquifer system conducted at the Hanford Site.
Nagurney, Anna
Transformation, Appears in Transportation Research D 11, 171-190. Dmytro Matsypura Electric Power Supply Chain Markets Transmission Service Providers Power SupplIntroduction The Model The Algorithm Modeling of Electric Power Supply Chain Networks with Fuel
Grant, C W; Lenderman, J S; Gansemer, J D
2011-02-24
This document is an update to the 'ADIS Algorithm Evaluation Project Plan' specified in the Statement of Work for the US-VISIT Identity Matching Algorithm Evaluation Program, as deliverable II.D.1. The original plan was delivered in August 2010. This document modifies the plan to reflect modified deliverables reflecting delays in obtaining a database refresh. This document describes the revised schedule of the program deliverables. The detailed description of the processes used, the statistical analysis processes and the results of the statistical analysis will be described fully in the program deliverables. The US-VISIT Identity Matching Algorithm Evaluation Program is work performed by Lawrence Livermore National Laboratory (LLNL) under IAA HSHQVT-07-X-00002 P00004 from the Department of Homeland Security (DHS).
header for SPIE use Evolving forest fire burn severity classification algorithms
Fernandez, Thomas
header for SPIE use Evolving forest fire burn severity classification algorithms for multi, to the classification of forest fire burn severity using Landsat 7 ETM+ multispectral imagery. The details. Keywords: Multispectral imagery, Genetic programming, Supervised classification, Forest fire, Wildfire. 1
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
Angelini, B.M.; Apicella, M.L.; Buceti, G.; Centioli, C.; Crisanti, F.; Iannone, F.; Mazza, G.; Mazzitelli, G.; Panella, M.; Vitale, V.
2004-05-15
Some specific points of the Frascati Tokamak Upgrade (FTU) operation are presented for plasma performance as well as for the machine availability and the development of new tools needed to operate in a complex scenario needed for tokamak research. The different techniques adopted for wall conditioning of the FTU are reviewed. Plasmas with low Z{sub eff} have been achieved including those at low density and high additional heating power. The obtained experimental results are discussed in terms of better operation and plasma performance achieved. As with any other large - and thus long-lasting - experiments, a mixture of old and new technological solutions inserted in an open source framework characterizes the FTU data control and acquisition systems. We give some information on the original architecture and try to detail its current state. The high level of reliability presently achieved is discussed.
A quick course in operating systems Raphael Finkel
Finkel, Raphael
A quick course in operating systems Raphael Finkel Computer Science Department University of Kentucky Lexington, KY raphael@ms.uky.edu raphael@ukma.bitnet Operating Systems 1 #12; What is an operating #################################### An operating system is a set of algorithms that allocate resources to processes
National Nuclear Security Administration (NNSA)
servers and other critical Operations Center equipment
IE170/171: Algorithms in Systems Engineering Dr. Ted Ralphs
Ralphs, Ted
in designing, analyzing, and imple- menting basic algorithms common in systems engineering applicationsIE170/171: Algorithms in Systems Engineering Syllabus Dr. Ted Ralphs Spring 2006 1 Miscellaneous. The course will be divided into five units by topic area (see detailed syllabus below). Course meetings
New Effective Multithreaded Matching Algorithms
Manne, Fredrik; Halappanavar, Mahantesh
2014-05-19
Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.
U.S. Installation, Operation, and Performance Standards for Microturbine Generator Sets, August 2000
Office of Energy Efficiency and Renewable Energy (EERE)
Report detailing the various codes and standards that are applicable for the installation, operation, and performance of microturbines.
Ricci, Laura
Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms EpidemicD in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \\lim_{+\\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \\lambda q, with \\lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.
Summary of the Optics, IR, Injection, Operations, Reliability...
Office of Scientific and Technical Information (OSTI)
Technical Report: Summary of the Optics, IR, Injection, Operations, Reliability and Instrumentation Working Group Citation Details In-Document Search Title: Summary of the Optics,...
Conformal field theories at nonzero temperature: Operator product...
Office of Scientific and Technical Information (OSTI)
Details In-Document Search This content will become publicly available on December 1, 2015 Title: Conformal field theories at nonzero temperature: Operator product expansions,...
6.828 Operating System Engineering, Fall 2003
Kaashoek, Frans, 1965-
Teaches the fundamentals of engineering operating systems. The following topics are studied in detail: virtual memory, kernel and user mode, system calls, threads, context switches, interrupts, interprocess communication, ...
Perceptual learning of context-sensitive phonetic detail
Barden, Katharine
2011-07-12
detail relating to grammatical function and meaning …………… 7 1.3.5 Phonetic detail conditioned by interactional context ……………………… 8 1.3.5.1 Turn-taking cues ……………………………………………………. 8 1.3.5.2 Phonetic detail reflecting pragmatic... …………………………………………………………………… 72 3.7.2 Materials ………………………………………………………………….. 73 3.7.2.1 Training materials: Story ….………………………………………. 73 3.7.2.2 Test materials: Sentence completion … …………………………... 73 3.7.3 Procedure …………………………………………………………………. 74 3.8...
Enabling Detailed Energy Analyses via the Technology Performance Exchange: Preprint
Studer, D.; Fleming, K.; Lee, E.; Livingood, W.
2014-08-01
One of the key tenets to increasing adoption of energy efficiency solutions in the built environment is improving confidence in energy performance. Current industry practices make extensive use of predictive modeling, often via the use of sophisticated hourly or sub-hourly energy simulation programs, to account for site-specific parameters (e.g., climate zone, hours of operation, and space type) and arrive at a performance estimate. While such methods are highly precise, they invariably provide less than ideal accuracy due to a lack of high-quality, foundational energy performance input data. The Technology Performance Exchange was constructed to allow the transparent sharing of foundational, product-specific energy performance data, and leverages significant, external engineering efforts and a modular architecture to efficiently identify and codify the minimum information necessary to accurately predict product energy performance. This strongly-typed database resource represents a novel solution to a difficult and established problem. One of the most exciting benefits is the way in which the Technology Performance Exchange's application programming interface has been leveraged to integrate contributed foundational data into the Building Component Library. Via a series of scripts, data is automatically translated and parsed into the Building Component Library in a format that is immediately usable to the energy modeling community. This paper (1) presents a high-level overview of the project drivers and the structure of the Technology Performance Exchange; (2) offers a detailed examination of how technologies are incorporated and translated into powerful energy modeling code snippets; and (3) examines several benefits of this robust workflow.
Human Factors Considerations in New Nuclear Power Plants: Detailed Analysis.
OHara,J.; Higgins, J.; Brown, W.; Fink, R.
2008-02-14
This Nuclear Regulatory Commission (NRC) sponsored study has identified human-performance issues in new and advanced nuclear power plants. To identify the issues, current industry developments and trends were evaluated in the areas of reactor technology, instrumentation and control technology, human-system integration technology, and human factors engineering (HFE) methods and tools. The issues were organized into seven high-level HFE topic areas: Role of Personnel and Automation, Staffing and Training, Normal Operations Management, Disturbance and Emergency Management, Maintenance and Change Management, Plant Design and Construction, and HFE Methods and Tools. The issues where then prioritized into four categories using a 'Phenomena Identification and Ranking Table' methodology based on evaluations provided by 14 independent subject matter experts. The subject matter experts were knowledgeable in a variety of disciplines. Vendors, utilities, research organizations and regulators all participated. Twenty issues were categorized into the top priority category. This Brookhaven National Laboratory (BNL) technical report provides the detailed methodology, issue analysis, and results. A summary of the results of this study can be found in NUREG/CR-6947. The research performed for this project has identified a large number of human-performance issues for new control stations and new nuclear power plant designs. The information gathered in this project can serve as input to the development of a long-term strategy and plan for addressing human performance in these areas through regulatory research. Addressing human-performance issues will provide the technical basis from which regulatory review guidance can be developed to meet these challenges. The availability of this review guidance will help set clear expectations for how the NRC staff will evaluate new designs, reduce regulatory uncertainty, and provide a well-defined path to new nuclear power plant licensing.
Detailed Assessment of Particulate Characteristics from Low-Temperatur...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Assessment of Particulate Characteristics from Low-Temperature Combustion Engines Detailed Assessment of Particulate Characteristics from Low-Temperature Combustion Engines 2012...
Two Studies Reveal Details of Lithium-Battery Function
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Two Studies Reveal Details of Lithium-Battery Function Print Our way of life is deeply intertwined with battery technologies that have enabled a mobile revolution powering cell...
Trends in Commercial Buildings--Total Primary Energy Detail
U.S. Energy Information Administration (EIA) Indexed Site
Energy Consumption and Graph Total Primary Energy Consumption Graph Detail and Data Table 1979 to 1992 primary consumption trend with 95% confidence ranges 1979 to 1992 primary...
Trends in Commercial Buildings--Total Site Energy Detail
U.S. Energy Information Administration (EIA) Indexed Site
Energy Consumption and Graph Total Site Energy Consumption Graph Detail and Data Table 1979 to 1992 site consumption trend with 95% confidence ranges 1979 to 1992 site...
Sandia Energy - CNST and Sandia Researchers Publish a Detailed...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
CNST and Sandia Researchers Publish a Detailed Review of Electrical Contacts in One- and Two-Dimensional Nanomaterials Home News News & Events CNST and Sandia Researchers Publish a...
Premiere issue of "Quest" magazine details PPPL's strides toward...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Premiere issue of "Quest" magazine details PPPL's strides toward fusion energy and advances in plasma science September 5, 2013 Tweet Widget Google Plus One Share on Facebook Quest...
Detailed Characterization of Lubricant-Derived Ash-Related Species...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Characterization of Lubricant-Derived Ash-Related Species in Diesel Exhaust and Aftertreatment Systems Detailed Characterization of Lubricant-Derived Ash-Related Species in Diesel...
A Stochastic Reactor Based Virtual Engine Model Employing Detailed...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
A Stochastic Reactor Based Virtual Engine Model Employing Detailed Chemistry for Kinetic Studies of In-Cylinder Combustion and Exhaust Aftertreatment A Stochastic Reactor Based...
INFILTRATION - PRESSURIZATION CORRELATIONS: DETAILED MEASUREMENT ON A CALIFORNIA HOUSE
Grimsrud, D.T.
2011-01-01
Systems. Abstract Infiltration studies have been carried outThis paper describes infiltration studies in a single-familyreported a detailed study of infiltration rates measured
Equipment Operational Requirements
Greenwalt, B; Henderer, B; Hibbard, W; Mercer, M
2009-06-11
The Iraq Department of Border Enforcement is rich in personnel, but poor in equipment. An effective border control system must include detection, discrimination, decision, tracking and interdiction, capture, identification, and disposition. An equipment solution that addresses only a part of this will not succeed, likewise equipment by itself is not the answer without considering the personnel and how they would employ the equipment. The solution should take advantage of the existing in-place system and address all of the critical functions. The solutions are envisioned as being implemented in a phased manner, where Solution 1 is followed by Solution 2 and eventually by Solution 3. This allows adequate time for training and gaining operational experience for successively more complex equipment. Detailed descriptions of the components follow the solution descriptions. Solution 1 - This solution is based on changes to CONOPs, and does not have a technology component. It consists of observers at the forts and annexes, forward patrols along the swamp edge, in depth patrols approximately 10 kilometers inland from the swamp, and checkpoints on major roads. Solution 2 - This solution adds a ground sensor array to the Solution 1 system. Solution 3 - This solution is based around installing a radar/video camera system on each fort. It employs the CONOPS from Solution 1, but uses minimal ground sensors deployed only in areas with poor radar/video camera coverage (such as canals and streams shielded by vegetation), or by roads covered by radar but outside the range of the radar associated cameras. This document provides broad operational requirements for major equipment components along with sufficient operational details to allow the technical community to identify potential hardware candidates. Continuing analysis will develop quantities required and more detailed tactics, techniques, and procedures.
New algorithms and new results for strong coupling LQCD
Wolfgang Unger; Philippe de Forcrand
2012-11-30
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use of the exact Hamiltonian, with the inverse temperature beta as the only input parameter. This formulation turns out to be analogous to that of a quantum spin system. The sign problem is completely absent, at zero and non-zero baryon density. We compare the performance of a continuous-time worm algorithm and of a Stochastic Series Expansion algorithm (SSE), which operates on equivalence classes of time-ordered interactions. Finally, we apply the SSE algorithm to a first exploratory study of two-flavor strong coupling lattice QCD, which is manageable in the Hamiltonian formulation because the sign problem can be controlled.
Incentives and Internet Algorithms
Feigenbaum, Joan
Game Theory Internet Design #12;9 Game Theory and the Internet Â· Long history of work: Â NetworkingIncentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf Scott with selfishness? Â· Internet Architecture: robust scalability Â How to build large and robust systems? #12
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1997-03-28
This chapter is focused on capital costs for conventional construction and environmental restoration and waste management projects and examines operating cost estimates to verify that all elements of the project have been considered and properly estimated.
Radiation Therapy Program Technical Standards Self-Assessment and Details
MacMillan, Andrew
Radiation Therapy Program Technical Standards Self-Assessment and Details Original Approval Date Therapy Program (referred to as the "Program") Technical Standards Policy and Procedure, available of the Radiation Therapy Program. #12;Radiation Therapy Program Technical Standards Self-Assessment and Details 3
A detailed systematic review of the recent literature on environmental
Paris-Sud XI, Université de
EA 4272 A detailed systematic review of the recent literature on environmental Kuznets curve detailed systematic review of the recent literature on environmental Kuznets curve dealing with CO2 Marie the early 90', many articles have been published on Environmental Kuznets Curve (EKC), especially empirical
Note: Instructions for Completing in [Italics] SCHEDULE OF PROJECT DETAILS
Kamat, Vineet R.
] ___________________________________________________________________________________ Design Professional - Schedule of Project Details Page 1 of 6 Form Date: CM January 2015 #12;The Basic-consultants that are included in the Basic Services are as follows: Firm Name Type of Architect/Engineer 5. ReimbursableNote: Instructions for Completing in [Italics] SCHEDULE OF PROJECT DETAILS for the Agreement
Painting Detail Nathan A. Carr John C. Hart
Painting Detail Nathan A. Carr John C. Hart University of Illinois, Urbana-Champaign Static painting, whereas a multiresolution meshed atlas (right) dynamically resizes its charts during the painting process to better sample the texture signal, especially in areas of fine detail. Abstract Surface painting
Gas characterization system operation, maintenance, and calibration plan
Tate, D.D.
1996-03-04
This document details the responsibilities and requirements for operation, maintenance, and calibration of the Gas Characterization Systems (GCS) analytical instrumentation. It further, defines the division of responsibility between the Characterization Monitoring Development organization and Tank Farms Operations.
The Automatic Generation of Mutation Operators for Genetic Algorithms
Woodward, John
of Computing Science and Mathematics School of Natural Sciences, University of Stirling, Stirling FK9 4LA class. Engineering design is an intrinsically multi-dimensional activity, where the dimensions might
Scalability of Algorithms for Arithmetic Operations in Radix Notation
Kearfott, R. Baker
Department of Computational Mathematics and Informatics, South Ural State University, Chelyabinsk, Russia-purpose program "Scientific and scientific-pedagogical personnel of innovation Russia", project 14.B37
An algorithm for dynamic order-picking in warehouse operations
Lu, Wenrong; McFarlane, Duncan; Giannikas, Vaggelis; Zhang, Quan
2015-07-09
depends on the number of possible combinations for each resulting equivalence class guided by the associated table (i.e. the density of the table). Although the total number of possible routes increases in a non-linear way as the num- ber of pick...
The Role of Comprehensive Detailed Chemical Kinetic Reaction Mechanisms in Combustion Research
Westbrook, C K; Pitz, W J; Curran, H J; Mehl, M
2008-07-16
Recent developments by the authors in the field of comprehensive detailed chemical kinetic reaction mechanisms for hydrocarbon fuels are reviewed. Examples are given of how these mechanisms provide fundamental chemical insights into a range of combustion applications. Practical combustion consists primarily of chemical heat release from reactions between a fuel and an oxidizer, and computer simulations of practical combustion systems have become an essential tool of combustion research (Westbrook et al., 2005). At the heart of most combustion simulations, the chemical kinetic submodel frequently is the most detailed, complex and computationally costly part of a system model. Historically, the chemical submodel equations are solved using time-implicit numerical algorithms, due to the extreme stiffness of the coupled rate equations, with a computational cost that varies roughly with the cube of the number of chemical species in the model. While early mechanisms (c. 1980) for apparently simple fuels such as methane (Warnatz, 1980) or methanol (Westbrook and Dryer, 1979) included perhaps 25 species, current detailed mechanisms for much larger, more complex fuels such as hexadecane (Fournet et al., 2001; Ristori et al., 2001; Westbrook et al., 2008) or methyl ester methyl decanoate (Herbinet et al., 2008) have as many as 2000 or even 3000 species. Rapid growth in capabilities of modern computers has been an essential feature in this rapid growth in the size and complexity of chemical kinetic reaction mechanisms.
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
Lin, J.; Bartal, Y.; Uhrig, R.E.
1995-03-01
Nuclear power plant status is monitored by a human operator. To enhance the operator`s capability to diagnose the nuclear power plant status in case of a transient, several systems were developed to identify the type of the transient. Few of them addressed the further question: how severe is the transient? In this paper, we explore the possibility of predicting the severity of a transient using genetic algorithms and nearest neighbor algorithms after its type has been identified.
The optimization problem Genetic Algorithm
Giménez, Domingo
The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Axioms, algorithms and Hilbert's Entscheidungsproblem
Axioms, algorithms and Hilbert's Entscheidungsproblem Jan Stovicek Department of Mathematical Sciences September 9th, 2008 www.ntnu.no Jan Stovicek, Axioms & algorithms #12;2 Outline The Decision & algorithms #12;3 Outline The Decision Problem Formal Languages and Theories Incompleteness Undecidability www
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMass mapSpeeding access toOctober 1996Technologies /JuneOperating Oak Ridge'sOPERATING
Algorithms for builder guidelines
Balcomb, J.D.; Lekov, A.B.
1989-06-01
The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Fuel Cell Technologies Office: Past Events EventsDetail
Broader source: Energy.gov (indexed) [DOE]
Events Printable Version Share this resource Send a link to Fuel Cell Technologies Office: Past Events EventsDetail to someone by E-mail Share Fuel Cell Technologies Office: Past...
Perspective+Detail a visualization technique for vertically curved displays
on the vertical display segment and (3) a head-up display (HUD) in the connecting curved segment (see Figure 1 display connection. The detail view and the HUD are seamlessly integrated with this extended overview
1999 Commercial Buildings Characteristics--Detailed Tables--Conservati...
U.S. Energy Information Administration (EIA) Indexed Site
as rowstubs in most detailed tables. Total buildings, total floorspace, and average building size for these categories are shown in Table B1. The PDF and spreadsheet data tables...
Detailed Information on Proposal for US-Monbusho Collaoration
California at Los Angeles, University of
Detailed Information on Proposal for UNICEX-Hi US-Monbusho Collaoration Thermal smaller void fraction ??) 3. Provide fundamental scientific and engineering input to the design of irradiation experiments - material temperature range material form - basic material property changes without
Atomic Scale Details of Defect-Boundary Interactions
Chen, Di
2014-12-18
The study is aimed to understand atomic scale details of defect-boundary interactions, which are critical to develop radiation tolerant fuel cladding materials for harsher neutron environments. By means of molecular dynamics simulations, we...
Results of Detailed Hydrologic Characterization Tests - Fiscal Year 2000
Spane, Frank A.; Thorne, Paul D.; Newcomer, Darrell R.
2001-05-15
This report provides the resluts of detailed hydrologic characterization tests conducted within eleven Hanford Site wells during fiscal year 2000. Detailed characterization tests performed included groundwater-flow characterization; barometric response evaluation; slug tests; single-well tracer tests; constant-rate pumping tests; and in-well, vertical flow tests. Hydraulic property estimates obtained from the detailed hydrologic tests include transmissivity; hydraulic conductivity; specific yield; effective porosity; in-well, lateral flow velocity; aquifer-flow velocity; vertical distribution of hydraulic conductivity (within the well-screen section); and in-well, verticla flow velocity. In addition, local groundwater-flow characteristics (i.e., hydraulic gradient and flow direction) were determined for four sites where detailed well testing was performed.
Results of Detailed Hydrologic Characterization Tests - Fiscal Year 1999
Spane, Frank A.; Thorne, Paul D.; Newcomer, Darrell R.
2001-01-19
This report provides the results of detailed hydrologic characterization tests conducted within newly constructed Hanford Site wells during FY 1999. Detailed characterization tests performed during FY 1999 included: groundwater flow characterization, barometric response evaluation, slug tests, single-well tracer tests, constant-rate pumping tests, and in-well vertical flow tests. Hydraulic property estimates obtained from the detailed hydrologic tests include: transmissivity, hydraulic conductivity, specific yield, effective porosity, in-well lateral flow velocity, aquifer flow velocity, vertical distribution of hydraulic conductivity (within the well-screen section) and in-well vertical flow velocity. In addition, local groundwater flow characteristics (i.e., hydraulic gradient and flow direction) were determined for four sites where detailed well testing was performed.
Random Search Algorithms Zelda B. Zabinsky
Del Moral , Pierre
Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross
Pruvost, N.; Tsitouras, J.
1981-03-18
The objectives of Operation Poorman were to design and build a portable seismic system and to set up and use this system in a cold-weather environment. The equipment design uses current technology to achieve a low-power, lightweight system that is configured into three modules. The system was deployed in Alaska during wintertime, and the results provide a basis for specifying a mission-ready seismic verification system.
5. Greedy and other efficient optimization algorithms
Keil, David M.
5. Greedy and other efficient optimization algorithms David Keil Analysis of Algorithms 7/14 1David Keil Analysis of Algorithms 5. Greedy algorithms 8/14 CSCI 347 Analysis of Algorithms David M. Keil, Framingham State University 5. Greedy and other fast optimization algorithms 1. When the next step is easy
Hyperparameter Tuning in Bandit-Based Adaptive Operator Selection
Pacula, Maciej
We are using bandit-based adaptive operator selection while autotuning parallel computer programs. The autotuning, which uses evolutionary algorithm-based stochastic sampling, takes place over an extended duration and ...
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Knepley, Matthew G.; Karpeev, Dmitry A.
2009-01-01
We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode notmore »only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.« less
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMass mapSpeeding access toOctober 1996Technologies /JuneOperating Oakoak ridge
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantityBonneville Power Administration wouldMass mapSpeeding access toOctober 1996Technologies /JuneOperating Oakoak
Deduction, Ordering, and Operations in Quantum Logic
Norman D. Megill; Mladen Pavicic
2001-08-16
We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a substitution and arrive at operation algebras that are not lattices what proves the claim. We devise algorithms and programs which write down any two-variable expression in an orthomodular lattice by means of classical and quantum operations in an identical form. Our results show that lattice structure and classical operations uniquely determine quantum logic underlying Hilbert space. As a consequence of our result, recent proposals for a deduction theorem with quantum operations in an orthomodular lattice as well as a substitution of quantum operations for the usual standard Hilbert space ones in quantum logic prove to be misleading. Quantum computer quantum logic is also discussed.
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
A Simple Algorithm for Detecting Circular Permutations in Proteins
Amir, Amihood
A Simple Algorithm for Detecting Circular Permutations in Proteins S. Uliel 1 , A. Fliess 1 , A CCR9610170 and BSF grant 96000509. #12; Abstract Motivation: Circular permutation of a protein is a genetic operation in which part of the Cterminal of the protein is moved to its Nterminal. Recently
Simulation of Quantum Algorithms with a Symbolic Programming Language
Peter Nyman
2007-05-24
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. The computational language will include formulations such as quantum state, superposition and quantum operator.
ROUTINE CLOUD-BOUNDARY ALGORITHM DEVELOPMENT FOR ARM MICROPULSE LIDAR
of Energy Office of Science ABSTRACT An operational cloud boundary algorithm (Wang and Sassen 2001) has been Associates, LLC under Contract No. DE-AC02- 98CH10886 with the U.S. Department of Energy. The publisher-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript
Using evolutionary algorithms to extract field theory mass spectra
Georg M. von Hippel; Randy Lewis; Robert G. Petry
2007-09-28
The spectrum of masses from a lattice QCD simulation may be found by fitting exponential functions to correlators of operators possessing the quantum numbers of the particles of interest. The ability of evolutionary algorithms to find globally optimized solutions containing a variable number of states across multiple data sets is exploited to provide a promising solution to the problem of finding these fits.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08
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.
Operation of thoriated tungsten cathodes
Polk, J.E. )
1993-01-20
The operating temperature of thoriated tungsten cathodes used in electric thrusters depends on the surface coverage of thorium, which is determined by a balance of rate processes which supply and deplete the surface layer. The fundamental processes and rates are first reviewed in detail, then a phenomenological model based on these rate processes is described. The model indicates that the thermionic emission capabilities of thoriated tungsten cathodes decay rapidly because of thorium depletion at temperatures encountered in electric thrusters.
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
Algorithms for dynamical overlap fermions
Stefan Schaefer
2006-09-28
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.
Bulk Operations for Space-Partitioning Trees
Ghanem, Thanaa M.; Shah, Rahul; Mokbel, Mohamed F.; Aref, Walid; Vitter, Jeffrey Scott
2004-01-01
The emergence of extensible index structures, e.g., GiST (Generalized Search Tree) [25] and SP-GiST (Space-Partitioning Generalized Search Tree) [3], calls for a set of extensible algorithms to support different operations (e.g., insertion, deletion...
Languages, Algorithms, Procedures, Calculi, and Metalogic
Mark Burgin
2007-01-04
Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized mathematical theories, metalogic studies theories in logic, or logics. The discipline of logic has been developed with the aim to model and study human thinking and reasoning. A more realistic understanding relates logic only to reasoning. Reasoning is a mental and verbal activity. Any activity is based on actions and operations organized by procedures and algorithms. That is why procedures and algorithms are basic for the development of different logics, their study and application. In this work, we study structures used in logic with the aim to reflect goals of logic as a discipline. The main structure is a logical calculus, which pivotal for the contemporary logic. Logical calculus is considered here as a two-tier construction with a logical language on the first level and the calculus itself on the second level. A system of interdependencies that exists between properties of deductive calculi and utilized by these calculi algorithms are explicated and studied. Here only syntactic parts of logics, namely, deductive logical calculi and corresponding languages are considered. Semantic and pragmatic parts are studied elsewhere.
Anselma, Luca
An algorithm to compute fingering for string instruments Daniele P. Radicioni*, Luca Anselma) modelling the constraints posed by body-instrument interaction (operational), iv) manipulating sound the interaction between the performer and the instrument, and manipulating sound parameters accordingly
Man-portable power generation devices : product design and supporting algorithms
Mitsos, Alexander
2006-01-01
A methodology for the optimal design and operation of microfabricated fuel cell systems is proposed and algorithms for relevant optimization problems are developed. The methodology relies on modeling, simulation and ...
Fourth-order diffusion Monte Carlo algorithms for solving quantum many-body problems
Forbert, HA; Chin, Siu A.
2001-01-01
By decomposing the important sampled imaginary time Schrodinger evolution operator to fourth order with positive coefficients, we derived a number of distinct fourth-order diffusion Monte Carlo algorithms. These sophisticated ...
Laser Authorisation Form University of Cambridge Personal Details
Cambridge, University of
Laser Authorisation Form University of Cambridge Personal Details Name Research supervisor or research group Department DEPARTMENT OF EARTH SCIENCES Other Departments where work with lasers will be carried out if applicable Information about the laser(s) you will be using Type of Laser Wavelength Laser
Detailed Execution Planning for Large Oil and Gas Construction Projects
Calgary, University of
Detailed Execution Planning for Large Oil and Gas Construction Projects Presented by James Lozon, University of Calgary There is currently 55.8 billion dollars worth of large oil and gas construction projects scheduled or underway in the province of Alberta. Recently, large capital oil and gas projects
MULTIGRID METHOD FOR MODELING MULTIDIMENSIONAL COMBUSTION WITH DETAILED CHEMISTRY
equations can be solved by using the existing CFD code, therefore most efforts towards modeling combustion, the development of very efficient CFD methods and reaction modeling method is equally important in combustionMULTIGRID METHOD FOR MODELING MULTIDIMENSIONAL COMBUSTION WITH DETAILED CHEMISTRY Xiaoqing Zheng
Unit and student details Unit code Unit title
Sekercioglu, Y. Ahmet
Unit and student details Unit code Unit title If this is a group assignment, each student must submitted Has any part of this assessment been previously submitted as part of another unit/course? Yes not be copied. No part of this assignment has been previously submitted as part of another unit/course. I
Innovative Methodology Efficient Estimation of Detailed Single-Neuron Models
Columbia University
) and propose a simple statistical method for automatically building large, detailed compartmental models of single neurons, circumvent- ing some of the traditional complexities in building these models "by hand, the knowledge that passive properties of neurons are accurately described by the cable equation (Baldi et al
Post-Receptor Adaptation: Lighting Up the Details
Smith, Robert G.
Post-Receptor Adaptation: Lighting Up the Details The very first rays of the rising sun enrich our ambient light conditions. A number of previous studies have documented light-dependent functional changes evidence that light-dependent changes may originate in excitatory bipolar cells and offers clear
Baca geothermal demonstration project. Power plant detail design document
Not Available
1981-02-01
This Baca Geothermal Demonstration Power Plant document presents the design criteria and detail design for power plant equipment and systems, as well as discussing the rationale used to arrive at the design. Where applicable, results of in-house evaluations of alternatives are presented.
PHYSICS 333 Electricity and Magnetism I CLASS DETAILS
Cassak, Paul
in this course are germane to essentially every field in modern physics! · The topics to be covered areFall 2009 PHYSICS 333 Electricity and Magnetism I CLASS DETAILS: · Meeting Times: Tuesday + by appointment + whenever the door is open · Please come by for help with concepts, homework, or other advice
EMIS Quick User Guide Search page (details on page 2)
Shoubridge, Eric
search terms in foreign languages You can enter search terms in foreign languages by: - Using your: Please note that we have a Cyrillic and Arabic keyboards available through the Search page. EnteringEMIS Quick User Guide Search page (details on page 2) The News page: Access the latest news
Fast algorithms for computing defects and their derivatives in the Regge calculus
Leo Brewin
2010-11-08
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essential that efficient algorithms be used when computing the defect angles and their derivatives with respect to the leg-lengths. The purpose of this paper is to present details of such an algorithm.
Algorithms for Supporting Compiled Communication
Yuan, Xin
Algorithms for Supporting Compiled Communication Xin Yuan Rami Melhem Rajiv Gupta Dept. We present an experimental compiler, ESUIF, that supports compiled communication for High algorithms used in ESUIF. We further demonstrate the effectiveness of compiled communication on all optical
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.
An efficient algorithm for the Riemannian 10j symbols
J. Daniel Christensen; Greg Egan
2002-01-24
The 10j symbol is a spin network that appears in the partition function for the Barrett-Crane model of Riemannian quantum gravity. Elementary methods of calculating the 10j symbol require order(j^9) or more operations and order(j^2) or more space, where j is the average spin. We present an algorithm that computes the 10j symbol using order(j^5) operations and order(j^2) space, and a variant that uses order(j^6) operations and a constant amount of space. An implementation has been made available on the web.
Spatial compression algorithm for the analysis of very large multivariate images
Keenan, Michael R. (Albuquerque, NM)
2008-07-15
A method for spatially compressing data sets enables the efficient analysis of very large multivariate images. The spatial compression algorithms use a wavelet transformation to map an image into a compressed image containing a smaller number of pixels that retain the original image's information content. Image analysis can then be performed on a compressed data matrix consisting of a reduced number of significant wavelet coefficients. Furthermore, a block algorithm can be used for performing common operations more efficiently. The spatial compression algorithms can be combined with spectral compression algorithms to provide further computational efficiencies.
Spectral compression algorithms for the analysis of very large multivariate images
Keenan, Michael R. (Albuquerque, NM)
2007-10-16
A method for spectrally compressing data sets enables the efficient analysis of very large multivariate images. The spectral compression algorithm uses a factored representation of the data that can be obtained from Principal Components Analysis or other factorization technique. Furthermore, a block algorithm can be used for performing common operations more efficiently. An image analysis can be performed on the factored representation of the data, using only the most significant factors. The spectral compression algorithm can be combined with a spatial compression algorithm to provide further computational efficiencies.
A Coupled Oscillator Model for Grover's Quantum Database Search Algorithm
Aavishkar A. Patel
2007-11-29
Grover's database search algorithm is the optimal algorithm for finding a desired object from an unsorted collection of items. Although it was discovered in the context of quantum computation, it is simple and versatile enough to be implemented using any physical system that allows superposition of states, and several proposals have been made in the literature. I study a mechanical realisation of the algorithm using coupled simple harmonic oscillators, and construct its physical model for the simplest case of four identical oscillators. The identification oracle is implemented as an elastic reflection of the desired oscillator, and the overrelaxation operation is realised as evolution of the system by half an oscillation period. I derive the equations of motion, and solve them both analytically and by computer simulation. I extend the ideal case analysis and explore the sensitivity of the algorithm to changes in the initial conditions, masses of springs and damping. The amplitude amplification provided by the algorithm enhances the energy of the desired oscillator, while running the algorithm backwards spreads out the energy of the perturbed oscillator among its partners. The former (efficient focusing of energy into a specific oscillator) can have interesting applications in processes that need crossing of an energy threshold for completion, and can be useful in nanotechnological devices and catalysis. The latter (efficient redistribution of energy) can be useful in processes requiring rapid dissipation of energy, such as shock-absorbers and vibrational shielding. I present some tentative proposals.
Detailed chemical kinetic oxidation mechanism for a biodiesel surrogate
Herbinet, O; Pitz, W J; Westbrook, C K
2007-09-17
A detailed chemical kinetic mechanism has been developed and used to study the oxidation of methyl decanoate, a surrogate for biodiesel fuels. This model has been built by following the rules established by Curran et al. for the oxidation of n-heptane and it includes all the reactions known to be pertinent to both low and high temperatures. Computed results have been compared with methyl decanoate experiments in an engine and oxidation of rapeseed oil methyl esters in a jet stirred reactor. An important feature of this mechanism is its ability to reproduce the early formation of carbon dioxide that is unique to biofuels and due to the presence of the ester group in the reactant. The model also predicts ignition delay times and OH profiles very close to observed values in shock tube experiments fueled by n-decane. These model capabilities indicate that large n-alkanes can be good surrogates for large methyl esters and biodiesel fuels to predict overall reactivity, but some kinetic details, including early CO2 production from biodiesel fuels, can be predicted only by a detailed kinetic mechanism for a true methyl ester fuel. The present methyl decanoate mechanism provides a realistic kinetic tool for simulation of biodiesel fuels.
Detailed chemical kinetic oxidation mechanism for a biodiesel surrogate
Herbinet, O; Pitz, W J; Westbrook, C K
2007-09-20
A detailed chemical kinetic mechanism has been developed and used to study the oxidation of methyl decanoate, a surrogate for biodiesel fuels. This model has been built by following the rules established by Curran et al. for the oxidation of n-heptane and it includes all the reactions known to be pertinent to both low and high temperatures. Computed results have been compared with methyl decanoate experiments in an engine and oxidation of rapeseed oil methyl esters in a jet stirred reactor. An important feature of this mechanism is its ability to reproduce the early formation of carbon dioxide that is unique to biofuels and due to the presence of the ester group in the reactant. The model also predicts ignition delay times and OH profiles very close to observed values in shock tube experiments fueled by n-decane. These model capabilities indicate that large n-alkanes can be good surrogates for large methyl esters and biodiesel fuels to predict overall reactivity, but some kinetic details, including early CO{sub 2} production from biodiesel fuels, can be predicted only by a detailed kinetic mechanism for a true methyl ester fuel. The present methyl decanoate mechanism provides a realistic kinetic tool for simulation of biodiesel fuels.
Detailed chemical kinetic oxidation mechanism for a biodiesel surrogate
Herbinet, Olivier; Pitz, William J.; Westbrook, Charles K.
2008-08-15
A detailed chemical kinetic mechanism has been developed and used to study the oxidation of methyl decanoate, a surrogate for biodiesel fuels. This model has been built by following the rules established by Curran and co-workers for the oxidation of n-heptane and it includes all the reactions known to be pertinent to both low and high temperatures. Computed results have been compared with methyl decanoate experiments in an engine and oxidation of rapeseed oil methyl esters in a jet-stirred reactor. An important feature of this mechanism is its ability to reproduce the early formation of carbon dioxide that is unique to biofuels and due to the presence of the ester group in the reactant. The model also predicts ignition delay times and OH profiles very close to observed values in shock tube experiments fueled by n-decane. These model capabilities indicate that large n-alkanes can be good surrogates for large methyl esters and biodiesel fuels to predict overall reactivity, but some kinetic details, including early CO{sub 2} production from biodiesel fuels, can be predicted only by a detailed kinetic mechanism for a true methyl ester fuel. The present methyl decanoate mechanism provides a realistic kinetic tool for simulation of biodiesel fuels. (author)
Cosmological perturbations in Horava-Lifshitz theory without detailed balance
Anzhong Wang; Roy Maartens
2010-01-14
In the Horava-Lifshitz theory of quantum gravity, two conditions -- detailed balance and projectability -- are usually assumed. The breaking of projectability simplifies the theory, but it leads to serious problems with the theory. The breaking of detailed balance leads to a more complicated form of the theory, but it appears to resolve some of the problems. Sotiriou, Visser and Weinfurtner formulated the most general theory of Horava-Lifshitz type without detailed balance. We compute the linear scalar perturbations of the FRW model in this form of HL theory. We show that the higher-order curvature terms in the action lead to a gravitational effective anisotropic stress on small scales. Specializing to a Minkowski background, we study the spin-0 scalar mode of the graviton, using a gauge-invariant analysis, and find that it is stable in both the infrared and ultraviolet regimes for $0 \\le \\xi \\le 2/3$. However, in this parameter range the scalar mode is a ghost.
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.
Anmer Daskin
2015-05-20
Quantum phase estimation algorithm finds the ground state energy, the lowest eigenvalue, of a quantum Hamiltonian more efficiently than its classical counterparts. Furthermore, with different settings, the algorithm has been successfully adapted as a sub frame of many other algorithms applied to a wide variety of applications in different fields. However, the requirement of a good approximate eigenvector given as an input to the algorithm hinders the application of the algorithm to the problems where we do not have any prior knowledge about the eigenvector. This paper presents a modification to the phase estimation algorithm for the positive operators to determine the eigenvalue corresponding to the positive eigenvector without the necessity of the existence of an initial approximate eigenvector. Moreover, by this modification, we show that the success probability of the algorithm becomes to depend on the normalized absolute sum of the matrix elements of the unitary operator whose eigenvalue is being estimated. This provides a priori information to know the success probability of the algorithm beforehand and makes the algorithm output the right solution with high probability in many cases.
Sensor Networks: Distributed Algorithms Reloaded or Revolutions?
Sensor Networks: Distributed Algorithms Reloaded or Revolutions? Roger Wattenhofer Computer. This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why community, a sensor network essentially is a database. The distributed algorithms community should join
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01
Resolution QRS Detection Algorithm for Sparsely Sampled ECGShamlo. 2011. A disk-aware algorithm for time series motifJ. M. Kleinberg, 1997. Two algorithms for nearest-neighbor
End of semester project Global Optimization algorithms
Dreyfuss, Pierre
End of semester project Global Optimization algorithms Ecole Polytechnique de l'UniversitÃ© de Nice.......................................................................................................................................3 II. Simulated annealing algorithm (SA.........................................................................................................................................7 2.Principle,algorithm and choice of parameters
Minimally entangled typical thermal state algorithms
Stoudenmire, E. M.; White, Steven R.
2010-01-01
s 2 t 2 ? 1 )? 2 and the algorithm continued by defining R 3order indicated, this algorithm for multiplying MPOs scalestypical thermal state algorithms E M Stoudenmire 1 and
National Security Technology Incubator Operations Plan
2008-04-30
This report documents the operations plan for developing the National Security Technology Incubator (NSTI) program for southern New Mexico. The NSTI program will focus on serving businesses with national security technology applications by nurturing them through critical stages of early development. The NSTI program is being developed as part of the National Security Preparedness Project (NSPP), funded by Department of Energy (DOE)/National Nuclear Security Administration (NNSA). The operation plan includes detailed descriptions of the structure and organization, policies and procedures, scope, tactics, and logistics involved in sustainable functioning of the NSTI program. Additionally, the operations plan will provide detailed descriptions of continuous quality assurance measures based on recommended best practices in incubator development by the National Business Incubation Association (NBIA). Forms that assist in operations of NSTI have been drafted and can be found as an attachment to the document.
A Direct Manipulation Language for Explaining Algorithms
Scott, Jeremy
Instructors typically explain algorithms in computer science by tracing their behavior, often on blackboards, sometimes with algorithm visualizations. Using blackboards can be tedious because they do not facilitate ...
Structure of Partially Premixed Flames Using Detailed Chemistry Simulations
Kluzek, Celine D.
2010-10-12
in the carburetor engines. The partially premixed ame set up, case b, is achieved by premixing fuel and oxidizer before ignition and adding oxidizer/air by entrainment or with a co- ow. It combines some of the advantages of non-premixed and premixed ames... 2009 Major Subject: Aerospace Engineering STRUCTURE OF PARTIALLY PREMIXED FLAMES USING DETAILED CHEMISTRY SIMULATIONS A Dissertation by CELINE DELPHINE KLUZEK Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment...
Bio-butanol: Combustion properties and detailed chemical kinetic model
Black, G.; Curran, H.J.; Pichon, S.; Simmie, J.M.; Zhukov, V.
2010-02-15
Autoignition delay time measurements were performed at equivalence ratios of 0.5, 1 and 2 for butan-1-ol at reflected shock pressures of 1, 2.6 and 8 atm at temperatures from 1100 to 1800 K. High-level ab initio calculations were used to determine enthalpies of formation and consequently bond dissociation energies for each bond in the alcohol. A detailed chemical kinetic model consisting of 1399 reactions involving 234 species was constructed and tested against the delay times and also against recent jet-stirred reactor speciation data with encouraging results. The importance of enol chemistry is highlighted. (author)
A New Detailed Term Accounting Opacity Code: TOPAZ
Iglesias, C A; Chen, M H; Isaacs, W; Sonnad, V; Wilson, B G
2004-04-28
A new opacity code, TOPAZ, which explicitly includes configuration term structure in the bound-bound transitions is being developed. The goal is to extend the current capabilities of detailed term accounting opacity codes such as OPAL that are limited to lighter elements of astrophysical interest. At present, opacity calculations of heavier elements use statistical methods that rely on the presence of myriad spectral lines for accuracy. However, statistical approaches have been shown to be inadequate for astrophysical opacity calculations. An application of the TOPAZ code will be to study the limits of statistical methods. Comparisons of TOPAZ to other opacity codes as well as experiments are presented.
CBECS 1993 - Federal Buildings Supplement Survey - Detailed Tables
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of Natural GasAdjustments (Billion Cubic Feet)Decade Year-0ProvedDecade2,948 2,724per ThousandLease0 0and164 167Detailed
Detailed Planning Kicks Off | OpenEI Community
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on QA:QA J-E-1 SECTION J APPENDIX ECoopButtePower VenturesInformation9) WindGridDeepiSolar andDetailed Planning Kicks
Hall, Dennis E.
2013-01-01
Unix time-sharing operating system. D. Hall, D. Scherrer, J.Prentice~Hall, Hansen, "Operating System Principles", Inc. ,of California. A Virtual Operating System Dennis E. Hall
Transportation System Concept of Operations
N. Slater-Thompson
2006-08-16
The Nuclear Waste Policy Act of 1982 (NWPA), as amended, authorized the DOE to develop and manage a Federal system for the disposal of SNF and HLW. OCRWM was created to manage acceptance and disposal of SNF and HLW in a manner that protects public health, safety, and the environment; enhances national and energy security; and merits public confidence. This responsibility includes managing the transportation of SNF and HLW from origin sites to the Repository for disposal. The Transportation System Concept of Operations is the core high-level OCRWM document written to describe the Transportation System integrated design and present the vision, mission, and goals for Transportation System operations. By defining the functions, processes, and critical interfaces of this system early in the system development phase, programmatic risks are minimized, system costs are contained, and system operations are better managed, safer, and more secure. This document also facilitates discussions and understanding among parties responsible for the design, development, and operation of the Transportation System. Such understanding is important for the timely development of system requirements and identification of system interfaces. Information provided in the Transportation System Concept of Operations includes: the functions and key components of the Transportation System; system component interactions; flows of information within the system; the general operating sequences; and the internal and external factors affecting transportation operations. The Transportation System Concept of Operations reflects OCRWM's overall waste management system policies and mission objectives, and as such provides a description of the preferred state of system operation. The description of general Transportation System operating functions in the Transportation System Concept of Operations is the first step in the OCRWM systems engineering process, establishing the starting point for the lower level descriptions. of subsystems and components, and the Transportation System Requirements Document. Other program and system documents, plans, instructions, and detailed designs will be consistent with and informed by the Transportation System Concept of Operations. The Transportation System Concept of Operations is a living document, enduring throughout the OCRWM systems engineering lifecycle. It will undergo formal approval and controlled revisions as appropriate while the Transportation System matures. Revisions will take into account new policy decisions, new information available through system modeling, engineering investigations, technical analyses and tests, and the introduction of new technologies that can demonstrably improve system performance.
Detailed Description of Key NIF Milestones for NNSA Description
Operationally qualify ignition diagnostics [Neutron Activation Detector (Cooper), Magnetic Recoil Spectrometer ignition. Q4 FY2011 4073 Demonstrating we can light the "match" alpha heating Conduct first DT implosion experimental campaign to demonstrate limited alpha heating Demonstrate cryogenic layered DT experiments
Detailed Physical Trough Model for NREL's Solar Advisor Model: Preprint
Wagner, M. J.; Blair, N.; Dobos, A.
2010-10-01
Solar Advisor Model (SAM) is a free software package made available by the National Renewable Energy Laboratory (NREL), Sandia National Laboratory, and the US Department of Energy. SAM contains hourly system performance and economic models for concentrating solar power (CSP) systems, photovoltaic, solar hot-water, and generic fuel-use technologies. Versions of SAM prior to 2010 included only the parabolic trough model based on Excelergy. This model uses top-level empirical performance curves to characterize plant behavior, and thus is limited in predictive capability for new technologies or component configurations. To address this and other functionality challenges, a new trough model; derived from physical first principles was commissioned to supplement the Excelergy-based empirical model. This new 'physical model' approaches the task of characterizing the performance of the whole parabolic trough plant by replacing empirical curve-fit relationships with more detailed calculations where practical. The resulting model matches the annual performance of the SAM empirical model (which has been previously verified with plant data) while maintaining run-times compatible with parametric analysis, adding additional flexibility in modeled system configurations, and providing more detailed performance calculations in the solar field, power block, piping, and storage subsystems.
Formal Specification of Operating System Operations
Black, Paul E.
Formal Specification of Operating System Operations Dan Zhou Department of Computer Science.black@nist.gov This paper describes the development of a formal specification for a secure operating system architecture operations. We also provide a uniform environment for system commands that change the security state
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08
The paper reviews progress in imaging in radio interferometry for the period 1993-1996. Unlike an optical telescope, the basic measurements of a radio interferometer (correlations between antennas) are indirectly related to a sky brightness image. In a real sense, algorithms and computers are the lenses of a radio interferometer. In the last 20 years, whereas interferometer hardware advances have resulted in improvements of a factor of a few, algorithm and computer advances have resulted in orders of magnitude improvement in image quality. Developing these algorithms has been a fruitful and comparatively inexpensive method of improving the performance of existing telescopes, and has made some newer telescopes possible. In this paper, we review recent developments in the algorithms used in the imaging part of the reduction process. What constitutes an `imaging algorithm'? Whereas once there was a steady `forward' progression in the reduction process of editing, calibrating, transforming and, finally, deconvolving, this is no longer true. The introduction of techniques such as self-calibration, and algorithms that go directly from visibilities to final images, have made the dividing lines less clear. Although we briefly consider self-calibration, for the purposes of this paper calibration issues are generally excluded. Most attention will be directed to the steps which form final images from the calibrated visibilities.
SNAP operating system reference manual
Sabuda, J.D.; Polito, J.; Walker, J.L.; Grant, F.H. III
1982-03-01
The SNAP Operating System (SOS) is a FORTRAN 77 program which provides assistance to the safeguards analyst who uses the Safeguards Automated Facility Evaluation (SAFE) and the Safeguards Network Analysis Procedure (SNAP) techniques. Features offered by SOS are a data base system for storing a library of SNAP applications, computer graphics representation of SNAP models, a computer graphics editor to develop and modify SNAP models, a SAFE-to-SNAP interface, automatic generation of SNAP input data, and a computer graphic post-processor for SNAP. The SOS Reference Manual provides detailed application information concerning SOS as well as a detailed discussion of all SOS components and their associated command input formats. SOS was developed for the US Nuclear Regulatory Commission's Office of Nuclear Regulatory Research and the US Naval Surface Weapons Center by Pritsker and Associates, Inc., under contract to Sandia National Laboratories.
Weather conditions affecting VTOL airbus operations in the Northeast Corridor
Simpson, R. W.
1966-01-01
A detailed study of hourly weather observations in the Northeast Corridor during the periods 0600-2400 for a ten year period 1944-1958 was made to study the implications of weather affecting the operations of a VSTOL Airbus ...
Simultaneous Design, Scheduling and Operation Through Process Integration
Al-Mutairi, Eid M.
2009-05-15
detailed crude oil processing schedule, process unit schedule and blending and shipping schedule. The purpose of the scheduling is to transform the production plan into a schedule useful for all operations within a time horizon of a few days...
6.828 Operating System Engineering, Fall 2006
Kaashoek, Frans
6.828 teaches the fundamentals of engineering operating systems. The following topics are studied in detail: virtual memory, kernel and user mode, system calls, threads, context switches, interrupts, interprocess communication, ...
Dynamic DRX Adaptation Algorithm for Elastic Traffic in UMTS Networks Jongwook LeeO
Bahk, Saewoong
) networks. The proposed algorithm is designed to efficiently tradeoff throughput for energy saving when mode operation to save energy that exploits the bursty characteristic of the traffic. By periodically) is employed. DRX is an energy saving mechanism for mobile stations that operates when they receive packets
Warren B. Powell Department of Operations Research
Powell, Warren B.
15-323 Warren B. Powell Department of Operations Research and Financial Engineering, Princeton . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15-323 15.2 A Basic Load-Matching Model . . . . . . . . . . . . . . . . . 15-325 15.3 Variations on computers of that era). Just as important, the model provided for a surprisingly high level of detail in how
Detailed characteristics of intermittent current pulses due to positive corona
Liu, Yang, E-mail: liuyangwuh520@sina.com; Cui, Xiang; Lu, Tiebing; Wang, Zhenguo; Li, Xuebao; Xiang, Yu; Wang, Xiaobo [State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources, North China Electric Power University, Beijing 102206 (China)
2014-08-15
In order to get detailed characteristics of intermittent current pulses due to positive corona such as the repetition rate of burst-pulse trains, the peak value ratio of the primary pulse to the secondary pulse, the number of pulses per burst, and the interval of the secondary pulses, a systematic study was carried out in a coaxial conductor-cylinder electrode system with the conductor electrode being set with a discharge point. Empirical formulae for the number of pulses per burst and the interval of the secondary pulses are first presented. A theoretical model based on the motion of the space-charge clouds is proposed. Analysis with the model gives explanations to the experimental results and reveals some new insights into the physical mechanism of positive intermittent corona.
Levy targeting and the principle of detailed balance
Piotr Garbaczewski; Vladimir Stephanovich
2011-05-07
We investigate confined L\\'{e}vy flights under premises of the principle of detailed balance. The master equation admits a transformation to L\\'{e}vy - Schr\\"{o}dinger semigroup dynamics (akin to a mapping of the Fokker-Planck equation into the generalized diffusion equation). We solve a stochastic targeting problem for arbitrary stability index $0<\\mu <2$ of L\\'{e}vy drivers: given an invariant probability density function (pdf), specify the jump - type dynamics for which this pdf is a long-time asymptotic target. Our ("$\\mu$-targeting") method is exemplified by Cauchy family and Gaussian target pdfs. We solve the reverse engineering problem for so-called L\\'{e}vy oscillators: given a quadratic semigroup potential, find an asymptotic pdf for the associated master equation for arbitrary $\\mu$.
Flow Effects on Jet quenching with Detailed Balance
Luan Cheng; Enke Wang
2011-02-01
A new model potential in the presence of collective flow describing the interaction of the hard jet with scattering centers is derived based on the static color-screened Yukawa potential. The flow effect on jet quenching with detailed balance is investigated in pQCD. It turns out that the collective flow changes the emission current and the LPM destructive interference comparing to that in the static medium. Considering the collective flow with velocity v_z along the jet direction, the energy loss is (1 - v_z) times that in the static medium to the first order of opacity. The flow dependence of the energy loss will affect the suppression of high p_T hadron spectrum and anisotropy parameter v_2 in high-energy heavy-ion collisions.
Detailed Balance and Spin Content of ? using Statistical Model
M. Batra; A. Upadhyay
2013-07-01
In this study, we assume the hadrons as an ensemble of quark-gluon Fock states and apply statistical effects to explain the spin distribution of quarks for lambda hyperon. We extend the principle of detailed balance given by Zhang et al. [9] to calculate the probability of every Fock state in lambda. Using these probabilities, we have calculated quark distribution of spin, hyperon weak decay constant, SU(3) reduced matrix elements and their ratio and magnetic moment etc. using the statistical model proposed in ref.[17]. The extension of statistical model comes here with inclusion of more sub processes like etc. Finally the matching of our results with other models like chiral quark soliton model has also been analyzed.
Efficient discrete-time simulations of continuous-time quantum query algorithms
R. Cleve; D. Gottesman; M. Mosca; R. D. Somma; D. L. Yonge-Mallo
2008-11-26
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating nand trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for nand trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems. We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of \\Omega[T log(log(T))/log (T)] in the continuous-time query model.
Designing a Computational Geometry Algorithms Library \\Lambda
Waldmann, Uwe
for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM, Udine, Italy, September
9. Genetic Algorithms 9.1 Introduction
Cambridge, University of
66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem
Finite Density Matrix Renormalisation Group Algorithm for Anyonic Systems
Robert N. C. Pfeifer; Sukhwinder Singh
2015-05-01
The numerical study of anyonic systems is known to be highly challenging due to their non-bosonic, non-fermionic particle exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is known about their collective behaviour as a result. Meanwhile, the density matrix renormalisation group (DMRG) algorithm is an exceptionally powerful numerical technique for calculating the ground state of a low-dimensional lattice Hamiltonian, and has been applied to the study of bosonic, fermionic, and group-symmetric systems. The recent development of a tensor network formulation for anyonic systems opened up the possibility of studying these systems using algorithms such as DMRG, though this has proved challenging both in terms of programming complexity and computational cost. This paper presents the implementation of DMRG for finite anyonic systems, including a detailed scheme for the implementation of anyonic tensors with optimal scaling of computational cost. The anyonic DMRG algorithm is demonstrated by calculating the ground state energy of the Golden Chain, which has become the benchmark system for the numerical study of anyons, and is shown to produce results comparable to those of the anyonic TEBD algorithm and superior to the variationally optimised anyonic MERA, at far lesser computational cost.
Vincenzo Tamma
2015-05-18
We report a detailed analysis of the optical realization [1, 3, 2, 4] of the analogue algorithm described in the first paper of this series [5] for the simultaneous factorization of an exponential number of integers. Such an analogue procedure, which scales exponentially in the context of first order interference, opens up the horizon to polynomial scaling by exploiting multi-particle quantum interference.
Detailed End Use Load Modeling for Distribution System Analysis
Schneider, Kevin P.; Fuller, Jason C.
2010-04-09
The field of distribution system analysis has made significant advances in the past ten years. It is now standard practice when performing a power flow simulation to use an algorithm that is capable of unbalanced per-phase analysis. Recent work has also focused on examining the need for time-series simulations instead of examining a single time period, i.e., peak loading. One area that still requires a significant amount of work is the proper modeling of end use loads. Currently it is common practice to use a simple load model consisting of a combination of constant power, constant impedance, and constant current elements. While this simple form of end use load modeling is sufficient for a single point in time, the exact model values are difficult to determine and it is inadequate for some time-series simulations. This paper will examine how to improve simple time invariant load models as well as develop multi-state time variant models.
Review of the International Thermonuclear Experimental Reactor (ITER) detailed design report
1997-04-18
Dr. Martha Krebs, Director, Office of Energy Research at the US Department of Energy (DOE), wrote to the Fusion Energy Sciences Advisory Committee (FESAC), in letters dated September 23 and November 6, 1996, requesting that FESAC review the International Thermonuclear Experimental Reactor (ITER) Detailed Design Report (DDR) and provide its view of the adequacy of the DDR as part of the basis for the United States decision to enter negotiations with the other interested Parties regarding the terms and conditions for an agreement for the construction, operations, exploitation and decommissioning of ITER. The letter from Dr. Krebs, referred to as the Charge Letter, provided context for the review and a set of questions of specific interest.
Dunn, F.E.
1995-12-31
Detailed steady-state and transient coolant temperatures and flow rates from an operating reactor have been used to validate the multiple pin model in the SASSYS-1 liquid metal reactor systems analysis code. This multiple pin capability can be used for explicit calculations of axial and lateral temperature distributions within individual subassemblies. Thermocouples at a number of axial locations and in a number of different coolant sub-channels m the XXO9 instrumented subassembly in the EBR-II reactor provided temperature data from the Shutdown Heat Removal Test (SHRT) series. Flow meter data for XXO9 and for the overall system are also available from these tests. Results of consistent SASSYS-1 multiple pin analyses for both the SHRT-45 loss-of-flow-without-scram-test and the S14RT-17 protected loss-of-flow test agree well with the experimental data, providing validation of the SASSYS-1 code over a wide range of conditions.
The Yang-Mills Spectrum from a 2-level Algorithm
Harvey B. Meyer
2003-12-20
We investigate in detail a 2-level algorithm for the computation of 2-point functions of fuzzy Wilson loops in lattice gauge theory. Its performance and the optimization of its parameters are described in the context of 2+1D SU(2) gluodynamics. In realistic calculations of glueball masses, it is found that the reduction in CPU time for given error bars on the correlator at time-separation ~0.2fm, where a mass-plateau sets in, varies between 1.5 and 7 for the lightest glueballs in the non-trivial symmetry channels; only for the lightest glueball is the 2-level algorithm not helpful. For the heavier states, or for larger time-separations, the gain increases as expected exponentially in (mt). We present further physics applications in 2+1 and 3+1 dimensions and for different gauge groups that confirm these conclusions.
TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION...
Office of Scientific and Technical Information (OSTI)
TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION Citation Details In-Document Search Title: TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION Authors: Xiao,...
TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION...
Office of Scientific and Technical Information (OSTI)
TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION Citation Details In-Document Search Title: TTF3 POWER COUPLER THERMAL ANALYSIS FOR LCLS-II CW OPERATION You are...
100-OL-1 Operable Unit Pilot Study: XRF Evaluation of Select...
Office of Scientific and Technical Information (OSTI)
100-OL-1 Operable Unit Pilot Study: XRF Evaluation of Select Pre-Hanford Orchards Citation Details In-Document Search Title: 100-OL-1 Operable Unit Pilot Study: XRF Evaluation of...
Decay of theX(3872)into?cJand the operator product expansion...
Office of Scientific and Technical Information (OSTI)
Decay of theX(3872)intocJand the operator product expansion in effective field theory Citation Details In-Document Search Title: Decay of theX(3872)intocJand the operator...
Papalaskari, Mary-Angela
CSC 8301 Design and Analysis of Algorithms Lecture 1 CSC 8301CSC 8301-- Design and Analysis of AlgorithmsDesign and Analysis of Algorithms Lecture 1Lecture 1 Algorithms: OverviewAlgorithms: Overview Next time: Principles of the analysis of algorithms (2.1, 2.2) Design and Analysis of Algorithms
Modular multiplication operator and quantized baker's maps
Lakshminarayan, Arul [Max-Planck-Institut fuer Physik komplexer Systeme, Noethnitzer Strasse 38, D-01187 Dresden (Germany)
2007-10-15
The modular multiplication operator, a central subroutine in Shor's factoring algorithm, is shown to be a coherent superposition of two quantum baker's maps when the multiplier is 2. The classical limit of the maps being completely chaotic, it is shown that there exist perturbations that push the modular multiplication operator into regimes of generic quantum chaos with spectral fluctuations that are those of random matrices. For the initial state of relevance to Shor's algorithm we study fidelity decay due to phase and bit-flip errors in a single qubit and show exponential decay with shoulders at multiples or half-multiples of the order. A simple model is used to gain some understanding of this behavior.
CS 105: Grad. Algorithms Winter 2005 MST VERIFICATION
Chakrabarti, Amit
Ancestors (LCA's). COMPUTE LCA'S: for each {u, v} # E - T : compute l = LCA(u, v) and put {u, v@cs.dartmouth.edu 2 LCA and Disjoint Set Union Maintain n elements under two operations. UNION(A, B, C) : C # A # B. LCA Algorithm : Given a rooted tree T , a set P of pairs of {u, v} # V and |P | = m Goal: Find LCA
INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 5.1.1C, 591{592. Theorem 5.1.2A, 26. Theorem{54. Theorem 5.1.4C, 55. Algorithm 5.1.4D, 50. Theorem 5.1.4D, 57. Algorithm 5.1.4G, 69. Algorithm 5.1.4H, 612. Theorem 5.1.4H, 60. Algorithm 5.1.4I, 49{50. Algorithm 5.1.4P, 70. Algorithm 5.1.4Q, 614. Algorithm 5.1.4S
INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4.
Pratt, Vaughan
APPENDIX C INDEX TO ALGORITHMS AND THEOREMS Algorithm 1.1E, 2, 4. Algorithm 1.1F, 466. Algorithm 1.2.1E, 13{14. Algorithm 1.2.1I, 11{12. Algorithm 1.2.2E, 470. Algorithm 1.2.2L, 26. Law 1.2.4A, 40. Law, 81{82. Theorem 1.2.10A, 101. Algorithm 1.2.10M, 96. Theorem 1.2.11.3A, 119. Algorithm 1.3.2E, 160
Hazardous waste operational plan for site 300
Roberts, R.S.
1982-02-12
This plan outlines the procedures and operations used at LLNL's Site 300 for the management of the hazardous waste generated. This waste consists primarily of depleted uranium (a by-product of U-235 enrichment), beryllium, small quantities of analytical chemicals, industrial type waste such as solvents, cleaning acids, photographic chemicals, etc., and explosives. This plan details the operations generating this waste, the proper handling of this material and the procedures used to treat or dispose of the hazardous waste. A considerable amount of information found in this plan was extracted from the Site 300 Safety and Operational Manual written by Site 300 Facility personnel and the Hazards Control Department.
Cheung, H.Y. Iris
2014-01-01
LBNL-XXXXX Detailed Energy Data Collection for Miscellaneous05CH11231. Detailed Energy Data Collection for Miscellaneousgenerate representative MELs energy data for future studies,
Lanzisera, Steven
2014-01-01
Methods for Detailed Energy Data Collection of MiscellaneousMethods for Detailed Energy Data Collection of Miscellaneousmethod of collecting MELs energy data today. In the US, MELs
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01
and California algorithm #8 using Fuzzy Logic to evaluate the new algorithm's effectiveness in detecting incidents on freeways. To test these algorithms, real data from TransGuide were run through the algorithms. Algorithm output were compared with CCTV (closed...
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent on
Santhanam, Balu
Leaky LMS AlgorithmLeaky LMS Algorithm Convergence of tap-weight error modes dependent. Stability and convergence time issues of concern for ill- conditioned inputs. Leaky LMS AlgorithmLeaky LMS cost. Block LMS AlgorithmBlock LMS Algorithm Uses type-I polyphase components of the input u[n]: Block
Shepelyansky, Dima
Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos S. Bettelli in a quantum computer operating an efficient algorithm for quantum chaos. Our results show that in an ideal of quantum chaos with a small number of qubits. Since the entanglement can be efficiently measured experi
Waste receiving and processing facility module 1, detailed design report
Not Available
1993-10-01
WRAP 1 baseline documents which guided the technical development of the Title design included: (a) A/E Statement of Work (SOW) Revision 4C: This DOE-RL contractual document specified the workscope, deliverables, schedule, method of performance and reference criteria for the Title design preparation. (b) Functional Design Criteria (FDC) Revision 1: This DOE-RL technical criteria document specified the overall operational criteria for the facility. The document was a Revision 0 at the beginning of the design and advanced to Revision 1 during the tenure of the Title design. (c) Supplemental Design Requirements Document (SDRD) Revision 3: This baseline criteria document prepared by WHC for DOE-RL augments the FDC by providing further definition of the process, operational safety, and facility requirements to the A/E for guidance in preparing the design. The document was at a very preliminary stage at the onset of Title design and was revised in concert with the results of the engineering studies that were performed to resolve the numerous technical issues that the project faced when Title I was initiated, as well as, by requirements established during the course of the Title II design.
Stream sediment detailed geochemical survey for Date Creek Basin, Arizona
Butz, T.R.; Tieman, D.J.; Grimes, J.G.; Bard, C.S.; Helgerson, R.N.; Pritz, P.M.
1980-06-30
Results of the Date Creek Basin detailed geochemical survey are reported. Field and laboratory data are reported for 239 stream sediment samples. Statistical and areal distributions of uranium and possible uranium-related variables are displayed. A generalized geologic map of the area is provided, and pertinent geologic factors which may be of significance in evaluating the potential for uranium mineralization are briefly discussed. Based on stream sediment geochemical data, significant concentrations of uranium are restricted to the Anderson Mine area. The 84th percentile concentrations of U-FL, U-NT, and U-FL/U-NT combined with low thorium/U-NT values reflect increased mobility and enrichment of uranium in the carbonate host rocks of that area. Elements characteristically associated with the uranium mineralization include lithium and arsenic. No well defined diffusion halos suggesting outliers of similar uranium mineralization were observed from the stream sediment data in other areas of the Date Creek Basin. Significant concentrations of U-FL or U-NT found outside the mine area are generally coincident with low U-FL/U-NT values and high concentrations of zirconium, titanium, and phosphorus. This suggests that the uranium is related to a resistate mineral assemblage derived from surrounding crystalline igneous and metamorphic rocks.
Evolution Effects on Parton Energy Loss with Detailed Balance
Luan cheng; Enke Wang
2010-04-30
The initial conditions in the chemical non-equilibrated medium and Bjorken expanding medium at RHIC are determined. With a set of rate equations describing the chemical equilibration of quarks and gluons based on perturbative QCD, we investigate the consequence for parton evolution at RHIC. With considering parton evolution, it is shown that the Debye screening mass and the inverse mean free-path of gluons reduce with increasing proper time in the QGP medium. The parton evolution affects the parton energy loss with detailed balance, both parton energy loss from stimulated emission in the chemical non-equilibrated expanding medium and in Bjorken expanding medium are linear dependent on the propagating distance rather than square dependent in the static medium. The energy absorption can not be neglected at intermediate jet energies and small propagating distance of the energetic parton in contrast with that it is important only at intermediate jet energy in the static medium. This will increase the energy and propagating distance dependence of the parton energy loss and will affect the shape of suppression of moderately high P_T hadron spectra.
Flow Effects on Jet Energy Loss with Detailed Balance
Luan Cheng; Jia Liu; Enke Wang
2014-06-03
In the presence of collective flow a new model potential describing the interaction of the hard jet with scattering centers is derived based on the static color-screened Yukawa potential. The flow effect on jet quenching with detailed balance is investigated in pQCD. It turns out, considering the collective flow with velocity $v_z$ along the jet direction, the collective flow decreases the LPM destructive interference comparing to that in the static medium. The gluon absorption plays a more important role in the moving medium. The collective flow increases the energy gain from gluon absorption, however, decreases the energy loss from gluon radiation, which is $(1 - v_z )$ times as that in the static medium to the first order of opacity. In the presence of collective flow, the second order in opacity correction is relatively small compared to the first order. So that the total effective energy loss is decreased. The flow dependence of the energy loss will affect the suppression of high $p_T$ hadron spectrum and anisotropy parameter $v_2$ in high-energy heavy-ion collisions.
Lifting -- A Nonreversible Markov Chain Monte Carlo Algorithm
Vucelja, Marija
2015-01-01
Markov Chain Monte Carlo algorithms are invaluable numerical tools for exploring stationary properties of physical systems -- in particular when direct sampling is not feasible. They are widely used in many areas of physics and other sciences. Most common implementations are done with reversible Markov chains -- Markov chains that obey detailed balance. Reversible Markov chains are sufficient in order for the physical system to relax to equilibrium, but it is not necessary. Here we review several works that use "lifted" or nonreversible Markov chains, which violate detailed balance, yet still converge to the correct stationary distribution (they obey the global balance condition). In certain cases, the acceleration is a square root improvement at most, to the conventional reversible Markov chains. We introduce the problem in a way that makes it accessible to non-specialists. We illustrate the method on several representative examples (sampling on a ring, sampling on a torus, an Ising model on a complete graph...
Operational axioms for diagonalizing states
Giulio Chiribella; Carlo Maria Scandolo
2015-11-05
In quantum theory every state can be diagonalized, i.e. decomposed as a convex combination of perfectly distinguishable pure states. This elementary structure plays an ubiquitous role in quantum mechanics, quantum information theory, and quantum statistical mechanics, where it provides the foundation for the notions of majorization and entropy. A natural question then arises: can we reconstruct these notions from purely operational axioms? We address this question in the framework of general probabilistic theories, presenting a set of axioms that guarantee that every state can be diagonalized. The first axiom is Causality, which ensures that the marginal of a bipartite state is well defined. Then, Purity Preservation states that the set of pure transformations is closed under composition. The third axiom is Purification, which allows to assign a pure state to the composition of a system with its environment. Finally, we introduce the axiom of Pure Sharpness, stating that for every system there exists at least one pure effect occurring with unit probability on some state. For theories satisfying our four axioms, we show a constructive algorithm for diagonalizing every given state. The diagonalization result allows us to formulate a majorization criterion that captures the convertibility of states in the operational resource theory of purity, where random reversible transformations are regarded as free operations.
Occurrence reporting and processing of operations information
1997-07-21
DOE O 232.1A, Occurrence Reporting and Processing of Operations Information, and 10 CFR 830.350, Occurrence Reporting and Processing of Operations Information (when it becomes effective), along with this manual, set forth occurrence reporting requirements for Department of Energy (DOE) Departmental Elements and contractors responsible for the management and operation of DOE-owned and -leased facilities. These requirements include categorization of occurrences related to safety, security, environment, health, or operations (``Reportable Occurrences``); DOE notification of these occurrences; and the development and submission of documented follow-up reports. This Manual provides detailed information for categorizing and reporting occurrences at DOE facilities. Information gathered by the Occurrence Reporting and processing System is used for analysis of the Department`s performance in environmental protection, safeguards and security, and safety and health of its workers and the public. This information is also used to develop lessons learned and document events that significantly impact DOE operations.
Zelenyuk, Alla; Reitz, Paul; Stewart, Mark L.; Imre, D.; Loeper, Paul; Adams, Cory; Andrie, Michael; Rothamer, David; Foster, David E.; Narayanaswamy, Kushal; Najt, Paul M.; Solomon, Arun S.
2014-08-01
Gasoline Compression Ignition (GCI) engines have the potential to achieve high fuel efficiency and to significantly reduce both NOx and particulate matter (PM) emissions by operating under dilute partially-premixed conditions. This low temperature combustion strategy is dependent upon direct-injection of gasoline during the compression stroke and potentially near top dead center (TDC). The timing and duration of the in-cylinder injections can be tailored based on speed and load to create optimized conditions that result in a stable combustion. We present the results of advanced aerosol analysis methods that have been used for detailed real-time characterization of PM emitted from a single-cylinder GCI engine operated at different speed, load, timing, and number and duration of near-TDC fuel injections. PM characterization included 28 measurements of size and composition of individual particles sampled directly from the exhaust and after mass and/or mobility classification. We use these data to calculate particle effective density, fractal dimension, dynamic shape factors in free-molecular and transition flow regimes, average diameter of primary spherules, number of spherules, and void fraction of soot agglomerates.
Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
Vestergaard, Christian L
2015-01-01
Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely,...
Detailed balance in micro-and macrokinetics and micro-distinguishability of macro-processes
Detailed balance in micro- and macrokinetics and micro-distinguishability of macro-processes A. N a general framework for the discussion of detailed balance and analyse its microscopic background. We find of detailed balance. Keywords: kinetic equation, random process, microreversibility, detailed balance
DETAILED MOLECULAR OBSERVATIONS TOWARD THE DOUBLE HELIX NEBULA
Torii, K.; Enokiya, R.; Hasegawa, K.; Kudo, N.; Fukui, Y.; Morris, M. R.
2014-07-01
The Double Helix Nebula (DHN), located 100 pc above Sgr A* in the Galactic center (GC), is a unique structure whose morphology suggests it is a magnetic feature. Recent molecular observations toward the DHN revealed two candidate molecular counterparts of the DHN at radial velocities of –35 km s{sup –1} and 0 km s{sup –1} and discussed the model in which the DHN has its origin at the circumnuclear disk in the GC. In this paper, new CO observations toward the DHN using the Caltech Submillimeter Observatory and Mopra telescopes are presented. The higher-resolution observations of ?1 pc scale reveal the detailed distributions and kinematics of the two CO counterparts (the 0 km s{sup –1} and –35 km s{sup –1} features) and provide new information on their physical conditions. As a result, we find that the 0 km s{sup –1} feature with a mass of 3.3 × 10{sup 4} M {sub ?} coincides with the infrared emission of the DHN, indicating clear association with the DHN. The association of the –35 km s{sup –1} feature, with a mass of 0.8 × 10{sup 4} M {sub ?}, is less clear compared with the 0 km s{sup –1} feature, but the complementary distribution between the molecular gas and the DHN and velocity variation along the DHN support its association with the DHN. The two molecular features are highly excited, as shown by the relatively high CO J = 2-1/J = 1-0 intensity ratios of ?1.0, and have kinetic temperatures of ?30 K, consistent with the typical molecular clouds in the GC.
Algorithmic Aspects of Risk Management
Gehani, Ashish
Algorithmic Aspects of Risk Management Ashish Gehani1 , Lee Zaniewski2 , and K. Subramani2 1 SRI International 2 West Virginia University Abstract. Risk analysis has been used to manage the security of sys configuration. This allows risk management to occur in real time and reduces the window of exposure to attack
Algorithmic + Geometric characterization of CAR
Gill, Richard D.
Algorithmic + Geometric characterization of CAR (Coarsening at Random) Richard Gill - Utrecht but independent) CCAR 3 door problem X=door with car behind Y=two doors still closed = {your first choice, other door left closed} 3 door problem X=door with car behind Y=(your first choice, other door left closed
GEET DUGGAL Algorithms for Determining
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
Adaptive protection algorithm and system
Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
R. Guerraoui 1 Distributed algorithms
Guerraoui, Rachid
and then algorithms 7 Best-effort broadcast (beb) Events Request: bebBroadcast, m> Indication: bebDeliver, src, m> Â· Properties: BEB1, BEB2, BEB3 8 Best-effort broadcast (beb) Properties BEB1. Validity: If pi and pj are correct, then every message broadcast by pi is eventually delivered by pj BEB2. No duplication: No message
Algorithmic Thermodynamics John C. Baez
Cortes, Corinna
Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + Âµd
Hierarchical Correctness Proofs Distributed Algorithms
Tuttle, Mark R.
distributed networks. With this model we are able to construct modular, hierarchical correct- ness proofs these messages and process variables can be extremely di cult, and the resulting proofs of correct- ness of the full algorithm's correct- ness. Some time ago, we began to consider this approach of proof by re nement
Data-driven minimization of pump operating and maintenance cost Zijun Zhang a,n
Kusiak, Andrew
Data-driven minimization of pump operating and maintenance cost Zijun Zhang a,n , Xiaofei He b the cost of pump operations and maintenance. A neural network algorithm is applied to model performance research seldom considered the interaction between the operation and maintenance scheduling as well
Heat Transfer Operators Associated with Quantum Operations
Ç. Aksak; S. Turgut
2011-04-14
Any quantum operation applied on a physical system is performed as a unitary transformation on a larger extended system. If the extension used is a heat bath in thermal equilibrium, the concomitant change in the state of the bath necessarily implies a heat exchange with it. The dependence of the average heat transferred to the bath on the initial state of the system can then be found from the expectation value of a hermitian operator, which is named as the heat transfer operator (HTO). The purpose of this article is the investigation of the relation between the HTOs and the associated quantum operations. Since, any given quantum operation on a system can be realized by different baths and unitaries, many different HTOs are possible for each quantum operation. On the other hand, there are also strong restrictions on the HTOs which arise from the unitarity of the transformations. The most important of these is the Landauer erasure principle. This article is concerned with the question of finding a complete set of restrictions on the HTOs that are associated with a given quantum operation. An answer to this question has been found only for a subset of quantum operations. For erasure operations, these characterizations are equivalent to the generalized Landauer erasure principle. For the case of generic quantum operations however, it appears that the HTOs obey further restrictions which cannot be obtained from the entropic restrictions of the generalized Landauer erasure principle.
Evolution Operators for Linearly Polarized Two-Killing Cosmological Models
J. Fernando Barbero G.; Daniel Gómez Vergel; Eduardo J. S. Villaseñor
2006-06-15
We give a general procedure to obtain non perturbative evolution operators in closed form for quantized linearly polarized two Killing vector reductions of general relativity with a cosmological interpretation. We study the representation of these operators in Fock spaces and discuss in detail the conditions leading to unitary evolutions.
Surface moisture measurement system operation and maintenance manual
Vargo, G.F., Westinghouse Hanford
1996-06-11
The purpose of this manual is to provide detailed operating instructions for the Surface Moisture Measurement System (SMMS).In addition, operating instructions for the Liquid Observation Well Moisture Measurement System (LOWMMS) are included. These systems were developed primarily in support of Tank Waste Remediation System (TWRS) Safety Programs for moisture measurement in organic and ferrocyanide watch list tanks.
RHIC Polarized proton operation
Huang, H.; Ahrens, L.; Alekseev, I.G.; Aschenauer, E.; Atoian, G.; Bai, M.; Bazilevsky, A.; Blaskiewicz, M.; Brennan, J.M.; Brown, K.A.; Bruno, D.; Connolly, R.; Dion, A.; D'Ottavio, T.; Drees, K.A.; Fischer, W.; Gardner, C.; Glenn, J.W.; Gu, X.; Harvey, M.; Hayes, T.; Hoff, L.; Hulsart, R.L.; Laster, J.; Liu, C.; Luo, Y.; MacKay, W.W.; Makdisi, Y.; Marr, G.J.; Marusic, A.; Meot, F.; Mernick, K.; Michnoff, R,; Minty, M.; Montag, C.; Morris, J.; Nemesure, S.; Poblaguev, A.; Ptitsyn, V.; Ranjibar, V.; Robert-Demolaize, G.; Roser, T.; J.; Severino, F.; Schmidke, B.; Schoefer, V.; Severino, F.; Smirnov, D.; Smith, K.; Steski, D.; Svirida, D.; Tepikian, S.; Trbojevic, D.; Tsoupas, N.; Tuozzolo, J. Wang, G.; Wilinski, M.; Yip, K.; Zaltsman, A.; Zelenski, A.; Zeno, K.; Zhang, S.Y.
2011-03-28
The Relativistic Heavy Ion Collider (RHIC) operation as the polarized proton collider presents unique challenges since both luminosity(L) and spin polarization(P) are important. With longitudinally polarized beams at the experiments, the figure of merit is LP{sup 4}. A lot of upgrades and modifications have been made since last polarized proton operation. A 9 MHz rf system is installed to improve longitudinal match at injection and to increase luminosity. The beam dump was upgraded to increase bunch intensity. A vertical survey of RHIC was performed before the run to get better magnet alignment. The orbit control is also improved this year. Additional efforts are put in to improve source polarization and AGS polarization transfer efficiency. To preserve polarization on the ramp, a new working point is chosen such that the vertical tune is near a third order resonance. The overview of the changes and the operation results are presented in this paper. Siberian snakes are essential tools to preserve polarization when accelerating polarized beams to higher energy. At the same time, the higher order resonances still can cause polarization loss. As seen in RHIC, the betatron tune has to be carefully set and maintained on the ramp and during the store to avoid polarization loss. In addition, the orbit control is also critical to preserve polarization. The higher polarization during this run comes from several improvements over last run. First we have a much better orbit on the ramp. The orbit feedback brings down the vertical rms orbit error to 0.1mm, much better than the 0.5mm last run. With correct BPM offset and vertical realignment, this rms orbit error is indeed small. Second, the jump quads in the AGS improved input polarization for RHIC. Third, the vertical tune was pushed further away from 7/10 snake resonance. The tune feedback maintained the tune at the desired value through the ramp. To calibrate the analyzing power of RHIC polarimeters at any energy above injection, the polarized hydrogen jet target runs for every fill with both beams. Based on the known analyzing power, there is very little polarization loss between injection and 100 GeV. An alternative way is to measure the asymmetry at 100 GeV followed by ramping up to 250 GeV and back down to 100 GeV and then to measure the asymmetry again at 100 GeV. If the asymmetry after the down ramp is similar to the measurement before the up ramp, polarization was also preserved during the ramp to 250 GeV. The analyzing power at storage energy can then be extracted from the asymmetries measured at 100 GeV and 250 GeV. The tune and orbit feedbacks are essential for the down ramp to be possible. The polarized proton operation is still going on. We will push bunch intensity higher until reaching the beam-beam limit. The even higher intensity will have to wait for the electron lenses to compensate the beam-beam effect. To understand the details of spin dynamics in RHIC with two snakes, spin simulation with the real magnet fields have been developed recently. The study will provide guidance for possible polarization loss schemes. Further polarization gain will requires a polarized source upgrade; more careful setup jump quads in the AGS to get full benefit; and control emittance in the whole accelerator chain.
Fort Irwin Integrated Resource Assessment. Volume 2, Baseline detail
Richman, E.E.; Keller, J.M.; Dittmer, A.L.; Hadley, D.L.
1994-01-01
This report documents the assessment of baseline energy use at Fort Irwin, a US Army Forces Command facility near Barstow, California. It is a companion report to Volume 1, Executive Summary, and Volume 3, Integrated Resource Assessment. The US Army Forces Command (FORSCOM) has tasked the US Department of Energy (DOE) Federal Energy Management Program (FEMP), supported by the Pacific Northwest Laboratory (PNL), to identify, evaluate, and assist in acquiring all cost-effective energy projects at Fort Irwin. This is part of a model program that PNL has designed to support energy-use decisions in the federal sector. This program (1) identifies and evaluates all cost-effective energy projects; (2) develops a schedule at each installation for project acquisition considering project type, size, timing, and capital requirements, as well as energy and dollar savings; and (3) targets 100% of the financing required to implement energy efficiency projects. PNL applied this model program to Fort Irwin. This analysis examines the characteristics of electric, propane gas, and vehicle fuel use for a typical operating year. It records energy-use intensities for the facilities at Fort Irwin by building type and energy end use. It also breaks down building energy consumption by fuel type, energy end use, and building type. A complete energy consumption reconciliation is presented that accounts for all energy use among buildings, utilities, and applicable losses.
On Learning Algorithms for Nash Equilibria
Daskalakis, Constantinos
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising games, and thus results on the convergence or ...
Convergence Conditions for Variational Inequality Algorithms
Magnanti, Thomas L.
Within the extensive variational inequality literature, researchers have developed many algorithms. Depending upon the problem setting, these algorithms ensure the convergence of (i) the entire sequence of iterates, (ii) ...
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...
Bayesian Algorithmic Mechanism Design [Extended Abstract
Hartline, Jason D.
Bayesian Algorithmic Mechanism Design [Extended Abstract] Jason D. Hartline Northwestern, Canada blucier@cs.toronto.edu ABSTRACT The principal problem in algorithmic mechanism design approach for designing incen- tive compatible mechanisms, namely that of Vickrey, Clarke, and Groves
Learning Motor Skills: From Algorithms to Robot
Learning Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu Roboter-Experimenten Zur Erlangung des akademischen Grades Doktor-Ingenieur (Dr Motor Skills: From Algorithms to Robot Experiments Erlernen Motorischer Fähigkeiten: Von Algorithmen zu
An improved interiorpoint approach for use in reservoir operation Abbas Seif i
Tunçel, Levent
(LP) problem is often very large and highly sparse. A constantpotential interiorpoint algorithm control, hydropower generation, water supply, water quality enhance ment, navigation and recreationterm operation. Reznicek and Simonovic (1990) em ploy a similar model in their new algorithm for hydropower
An improved interior-point approach for use in reservoir operation Abbas Seifi
Tunçel, Levent
(LP) problem is often very large and highly sparse. A constant-potential interior-point algorithm, hydropower generation, water supply, water quality enhance- ment, navigation and recreation. The usefulness-term operation. Reznicek and Simonovic (1990) em- ploy a similar model in their new algorithm for hydropower
Oscillation Detection Algorithm Development Summary Report and Test Plan
Zhou, Ning; Huang, Zhenyu; Tuffner, Francis K.; Jin, Shuangshuang
2009-10-03
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.
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01
2.2 Graph Search Algorithms . . . . . . . . . . . . .an Efficient Algorithm . . . . . . 4.6.4 RestrictionAn O(r)-Approximation Algorithm for GTSPP . . . . . . . .
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek; Hurand, Mathilde; Sgall, Ji?í
2009-01-01
5th European symposium on algorithms (ESA) (pp. 296–307).· Real-time systems · Algorithms 1 Introduction Ghosh etfault-tolerance testing algorithm, under the restriction
Algorithms for tandem mass spectrometry-based proteomics
Frank, Ari Michael
2008-01-01
4. MS-Clustering Algorithm . . . . . . . . . . C.De Novo Sequencing Algorithm . . . . . . C. Experimental2. The RankBoost Algorithm (Freund et al. , 2003) B.
Approximation Algorithms for the Fault-Tolerant Facility Placement Problem
Yan, Li
2013-01-01
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
Evaluating Las Vegas Algorithms ---Pitfalls and Remedies
Hoos, Holger H.
cism regarding the empirical testing of algorithms (Hooker, 1994; Hooker, 1996; McGeoch, 1996). It has
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
A Fast Algorithm for Nonstationary Delay Estimation
So, Hing-Cheung
to the explicit time delay estimator (ETDE) algorithm 4] but it is more computationally e cient and provides more
Energy Management in Microgrids: Algorithms and System
Shi, Wenbo
2015-01-01
study the supply-demand balancing problem in microgrids under more realistic conditions and pro- pose algorithms for microgrid
A (P)HMC algorithm for N_f = 2 + 1 + 1 flavours of twisted mass fermions
T. Chiarappa; R. Frezzotti; C. Urbach
2005-09-27
We present a detailed design of a (P)HMC simulation algorithm for N_f = 2 + 1 + 1 maximally twisted Wilson quark flavours. The algorithm retains even/odd and mass-shift preconditionings combined with multiple Molecular Dynamics time scales for both the light mass degenerate, u and d, quarks and the heavy mass non-degenerate, s and c, quarks. Various non-standard aspects of the algorithm are discussed, among which those connected to the use of a polynomial approximation for the inverse (square root of the squared) Dirac matrix in the s and c quark sector.
Mission Operations & Data Systems
Mojzsis, Stephen J.
Mission Operations & Data Systems The LASP Mission Operations & Data Systems (MO&DS) group staffs and instruments. Operational software acts like the health systems in a body, ensuring that temperature, energy. The software monitors the health of on-board systems; anything unusual is flagged and sent to mission operators
Operations Research Giorgio Gallo
Gallo, Giorgio
Operations Research Giorgio Gallo Operations Research (OR) is defined, according to the International Fed- eration of Operational Research Societies, as a scientific approach to the solution are thus crucial to almost all aspects of OR, research and practice. Operations Research, the origins
Tuning bandit algorithms in stochastic environments
Szepesvari, Csaba
Tuning bandit algorithms in stochastic environments Jean-Yves Audibert1 and R´emi Munos2 and Csaba@cs.ualberta.ca Abstract. Algorithms based on upper-confidence bounds for balancing exploration and exploitation a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING
PARALLEL EVOLUTIONARY ALGORITHMS FOR UAV PATH PLANNING Dong Jia Post-Doctoral Research Associate vehicles (UAVs). Premature convergence prevents evolutionary-based algorithms from reaching global optimal. To overcome this problem, this paper presents a framework of parallel evolutionary algorithms for UAV path
Algorithms Demands and Bounds Applications of Flow
Kabanets, Valentine
2/28/2014 1 Algorithms Demands and Bounds Applications of Flow Networks Design and Analysis of Algorithms Andrei Bulatov Algorithms Demands and Bounds 12-2 Lower Bounds The problem can be generalized) capacities (ii) demands (iii) lower bounds A circulation f is feasible if (Capacity condition) For each e E
Generalized URV Subspace Tracking LMS Algorithm 1
Boley, Daniel
Generalized URV Subspace Tracking LMS Algorithm 1 S. Hosur and A. H. Tew k and D. Boley Dept The convergence rate of the Least Mean Squares (LMS) algorithm is poor whenever the adaptive lter input auto-correlation matrix is ill-conditioned. In this paper we propose a new LMS algorithm to alleviate this problem
The Observer Algorithm for Visibility Approximation
Doherty, Patrick
, with dif- ferent view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm or more sentries while moving to a goal position. Algorithms for finding a covert paths in the presence of stationary and moving sentries has been devised by [5] [6]. An approximate visibility algorithm was devised
Partitioned algorithms for maximum likelihood and
Smyth, Gordon K.
Partitioned algorithms for maximum likelihood and other nonlinear estimation Gordon K. Smyth There are a variety of methods in the literature which seek to make iterative estimation algorithms more manageable by breaking the iterations into a greater number of simpler or faster steps. Those algorithms which deal
Total Algorithms \\Lambda Gerard Tel y
Utrecht, Universiteit
Total Algorithms \\Lambda Gerard Tel y Department of Computer Science, University of Utrecht, P and February 1993 Abstract We define the notion of total algorithms for networks of processes. A total algorithm enforces that a ``decision'' is taken by a subset of the processes, and that participation of all
Distributed QR Factorization Based on Randomized Algorithms
Zemen, Thomas
Distributed QR Factorization Based on Randomized Algorithms Hana Strakov´a1 , Wilfried N. Gansterer of Algorithms Hana.Strakova@univie.ac.at, Wilfried.Gansterer@univie.ac.at 2 Forschungszentrum Telekommunication Wien, Austria Thomas.Zemen@ftw.at Abstract. Most parallel algorithms for matrix computations assume
Minimum-Flip Supertrees: Complexity and Algorithms
Sanderson, Michael J.
Minimum-Flip Supertrees: Complexity and Algorithms Duhong Chen, Oliver Eulenstein, David Ferna that it is fixed-parameter tractable and give approximation algorithms for special cases. Index Terms assembled from all species in the study. Because the conventional algorithms to solve these problems
Algorithms and Theory of Computation Handbook, Second
Algorithms and Theory of Computation Handbook, Second Edition CRC PRESS Boca Raton Ann Arbor London Parameterized Algorithms 1 Rodney G. Downey and Catherine McCartin School of Mathematical and Computing Sciences.2 The Main Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Practical FPT Algorithms
Finding Algorithms in Scientific Articles Sumit Bhatia
Giles, C. Lee
Finding Algorithms in Scientific Articles Sumit Bhatia , Prasenjit Mitra and C. Lee Giles,giles}@ist.psu.edu ABSTRACT Algorithms are an integral part of computer science literature. How- ever, none of the current search engines offer specialized algorithm search facility. We describe a vertical search engine
Algorithms in pure mathematics G. Stroth
Stroth, Gernot
Algorithms in pure mathematics G. Stroth 1 Introduction In this article, we will discuss algorithmic group theory from the point of view of pure, and where one might be surprised that there is no algorithmic solution. The two most developed areas
Study of Proposed Internet Congestion Control Algorithms*
Study of Proposed Internet Congestion Control Algorithms* Kevin L. Mills, NIST (joint work with D Y Algorithms Mills et al. Innovations in Measurement Science More information @ http;Study of Proposed Internet Congestion Control Algorithms Mills et al. OutlineOutline Technical
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close proximity in the phase space to each other. We show the performance of our algorithm in the case of magnetic shower.
Santhanam, Balu
LMS Algorithm: MotivationLMS Algorithm: Motivation Only a single realization of observations : delay in tap-weight adjustment. Simplicity: real-time applications possible. LMS AlgorithmLMS Algorithm Use instantaneous estimates for statistics: Filter output: Estimation error: Tap-weight update: LMS
On the relation between the MXL family of algorithms and Grobner basis algorithms
International Association for Cryptologic Research (IACR)
On the relation between the MXL family of algorithms and Gr¨obner basis algorithms Martin R Solving (PoSSo) problem. The most efficient known algorithms reduce the Gr¨obner basis computation", on which a new family of algorithms is based (MXL, MXL2 and MXL3). By studying and de- scribing
Improved algorithms for reaction path following: Higher-order implicit algorithms
Schlegel, H. Bernhard
Improved algorithms for reaction path following: Higher-order implicit algorithms Carlos Gonzaleza (Received 13May 1991;accepted17June 1991) Eight new algorithms for reaction path following are presented or if accurate propertiessuch ascurvature and frequenciesare needed.3*4 Numerous algorithms exist for following
Building Operator Certification
Lilley, D.
2013-01-01
Certification Energy Efficiency through Operator Training CATEE December 18, 2013 – San Antonio, TX Dennis Lilley, CEM, PMP ESL-KT-13-12-49 CATEE 2013: Clean Air Through Energy Efficiency Conference, San Antonio, Texas Dec. 16-18 Building Operator Certification... Energy Efficiency through Operator Training What is Building Operator Certification? Industry-recognized credential in energy efficient building operation practices Created with 100 industry experts Launched in 1996 9,000 building engineers...
Save Energy Now Assessments Results 2008 Detailed Report
Wright, Anthony L [ORNL; Martin, Michaela A [ORNL; Nimbalkar, Sachin U [ORNL; Quinn, James [U.S. Department of Energy; Glatt, Ms. Sandy [DOE Industrial Technologies Program; Orthwein, Mr. Bill [U.S. Department of Energy
2010-09-01
In October 2005, U.S. Department of Energy Secretary Bodman launched his Easy Ways to Save Energy campaign with a promise to provide energy assessments to 200 of the largest U.S. manufacturing plants. DOE's Industrial Technologies Program (ITP) responded to the Secretary's campaign with its Save Energy Now initiative, featuring a new and highly cost-effective form of energy savings assessment. The approach for these assessments drew heavily on the existing resources of ITP's technology delivery component. Over the years, ITP Technology Delivery has worked with industry partners to assemble a suite of respected software tools, proven assessment protocols, training curricula, certified energy experts, and strong partnerships for deployment. The Save Energy Now assessments conducted in calendar year 2006 focused on natural gas savings and targeted many of the nation's largest manufacturing plants - those that consume at least 1 TBtu of energy annually. The 2006 Save Energy Now assessments focused primarily on assessments of steam and process heating systems, which account for an estimated 74% of all natural gas use by U.S. manufacturing plants. Because of the success of the Save Energy Now assessments conducted in 2006 and 2007, the program was expanded and enhanced in two major ways in 2008: (1) a new goal was set to perform at least 260 assessments; and (2) the assessment focus was expanded to include pumping, compressed air, and fan systems in addition to steam and process heating. DOE ITP also has developed software tools to assess energy efficiency improvement opportunities in pumping, compressed air, and fan systems. The Save Energy Now assessments integrate a strong training component designed to teach industrial plant personnel how to use DOE's opportunity assessment software tools. This approach has the advantages of promoting strong buy-in of plant personnel for the assessment and its outcomes and preparing them better to independently replicate the assessment process at the company's other facilities. Another important element of the Save Energy Now assessment process is the follow-up process used to identify how many of the recommended savings opportunities from individual assessments have been implemented in the industrial plants. Plant personnel involved with the Save Energy Now assessments are contacted 6 months, 12 months, and 24 months after individual assessments are completed to determine implementation results. A total of 260 Save Energy Now assessments were successfully completed in calendar year 2008. This means that a total of 718 assessments were completed in 2006, 2007, and 2008. As of July 2009, we have received a total of 239 summary reports from the ESAs that were conducted in year 2008. Hence, at the time that this report was prepared, 680 final assessment reports were completed (200 from year 2006, 241 from year 2007, and 239 from year 2008). The total identified potential cost savings from these 680 assessments is $1.1 billion per year, including natural gas savings of about 98 TBtu per year. These results, if fully implemented, could reduce CO{sub 2} emissions by about 8.9 million metric tons annually. When this report was prepared, data on implementation of recommended energy and cost savings measures from 488 Save Energy Now assessments were available. For these 488 plants, measures saving a total of $147 million per year have been implemented, measures that will save $169 million per year are in the process of being implemented, and plants are planning implementation of measures that will save another $239 million per year. The implemented recommendations are already achieving total CO{sub 2} reductions of about 1.8 million metric tons per year. This report provides a summary of the key results for the Save Energy Now assessments completed in 2008; details of the 6-month, 12-month, and 24-month implementation results obtained to date; and an evaluation of these implementation results. This report also summarizes key accomplishments, findings, and lessons learned from all the Save Energy No
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas2195
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity ofkandz-cm11 Outreach Home RoomPreservationBio-Inspired SolarAboutXu Named| Princeton PlasmaZhihong Lin ZhihongTexas21958524
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Homesum_a_epg0_fpd_mmcf_m.xls" ,"Available from WebQuantity of NaturalDukeWakefield MunicipalTechnicalInformation4563 LLNL Small-scale Friction Sensitivityv b W r88fracturing
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23
We discuss recent algorithmic improvements in simulating finite temperature QCD on a lattice. In particular, the Rational Hybrid Monte Carlo(RHMC) algorithm is employed to generate lattice configurations for 2+1 flavor QCD. Unlike the Hybrid R Algorithm, RHMC is reversible, admitting a Metropolis accept/reject step that eliminates the $\\mathcal{O}(\\delta t^2)$ errors inherent in the R Algorithm. We also employ several algorithmic speed-ups, including multiple time scales, the use of a more efficient numerical integrator, and Hasenbusch pre-conditioning of the fermion force.
Construction details of an earth-sheltered passive solar thermosiphon air house
Ashelman, R.B.; Hagen, G.C.
1980-01-01
Construction details are presented for Sunrise, a passive solar, earth-sheltered house in eastern West Virginia. Particular attention is paid to the thermosiphon air system, as well as structural, waterproofing and insulation details.
Distributed Approaches for Determination of Reconfiguration Algorithm Termination
Lai, Hong-jian
Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard
Meier, W.; Weigand, P.; Duan, X.R.; Giezendanner-Thoben, R.
2007-07-15
A nozzle configuration for technically premixed gas turbine flames was operated with CH{sub 4} and air at atmospheric pressure. The flames were confined by a combustion chamber with large quartz windows, allowing the application of optical and laser diagnostics. In a distinct range of operating conditions the flames exhibited strong self-excited thermoacoustic pulsations at a frequency around 290 Hz. A flame with P=25kW thermal power and an equivalence ratio of {phi}=0.7 was chosen as a target flame in order to analyze the dynamics and the feedback mechanism of the periodic instability in detail. The velocity field was measured by three-component laser Doppler velocimetry, the flame structures were measured by chemiluminescence imaging and planar laser-induced fluorescence of OH, and the joint probability density functions of major species concentrations, mixture fraction, and temperature were measured by laser Raman scattering. All measuring techniques were applied in a phase-locked mode with respect to the phase angle of the periodic pulsation. In addition to the pulsating flame, a nonpulsating flame with increased fuel flow rate (P=30kW, {phi}=0.83) was studied for comparison. The measurements revealed significant differences between the structures of the pulsating and the nonpulsating (or ''quiet'') flame. Effects of finite-rate chemistry and unmixedness were observed in both flames but were more pronounced in the pulsating flame. The phase-locked measurements revealed large variations of all measured quantities during an oscillation cycle. This yielded a clear picture of the sequence of events and allowed the feedback mechanism of the instability to be identified and described quantitatively. The data set presents a very good basis for the verification of numerical combustion simulations because the boundary conditions of the experiment were well-defined and the most important quantities were measured with a high accuracy. (author)
Reading of Electronic Documents: The Usability of Linear, Fisheye, and Overview+Detail Interfaces
Reading of Electronic Documents: The Usability of Linear, Fisheye, and Overview+Detail Interfaces, and an overview+detail interface for electronic documents. Using these interfaces, 20 subjects wrote essays and answered questions about scientific documents. Essays written using the overview+detail interface received
Detailed Calculation of Test-Mass Charging in the LISA Mission
H. M. Araujo; P. Wass; D. Shaul; G. Rochester; T. J. Sumner
2004-10-07
The electrostatic charging of the LISA test masses due to exposure of the spacecraft to energetic particles in the space environment has implications in the design and operation of the gravitational inertial sensors and can affect the quality of the science data. Robust predictions of charging rates and associated stochastic fluctuations are therefore required for the exposure scenarios expected throughout the mission. We report on detailed charging simulations with the Geant4 toolkit, using comprehensive geometry and physics models, for Galactic cosmic-ray protons and helium nuclei. These predict positive charging rates of 50 +e/s (elementary charges per second) for solar minimum conditions, decreasing by half at solar maximum, and current fluctuations of up to 30 +e/s/Hz^{1/2}. Charging from sporadic solar events involving energetic protons was also investigated. Using an event-size distribution model, we conclude that their impact on the LISA science data is manageable. Several physical processes hitherto unexplored as potential charging mechanisms have also been assessed. Significantly, the kinetic emission of very low-energy secondary electrons due to bombardment of the inertial sensors by primary cosmic rays and their secondaries can produce charging currents comparable with the Monte Carlo rates.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Climate Data Operators (CDO) Climate Data Operators (CDO) Description and Overview CDO is a large tool set for working on climate data. NetCDF 34, GRIB including SZIP compression,...
None
2010-01-01
A multiple vview shot of the SWPF crane lift operation at the Savannah River Site. Funded by the Recovery Act.
White, Tony
with infrared distance sensors. A more detailed physics model would be needed, but the neural network training period of time. Each car is mounted with multiple straight-line distance sensors, which provide the input traveled and rely on this for fitness evaluations. Both evolutionary algorithms are well suited
Jacobs, David
Gear's algorithm As long as we're talking about matrix methods, let's also look at Gear's very. Gear solves this by using linear algebra methods to select the columns in the most stable way elements. Since Gear's paper for details. #12;
Well Control Optimization using Derivative-Free Algorithms and a Multiscale Approach
Wang, Xiang; Feng, Qihong
2015-01-01
In this paper, we use numerical optimization algorithms and a multiscale approach in order to find an optimal well management strategy over the life of the reservoir. The large number of well rates for each control step make the optimization problem more difficult and at a high risk of achieving a suboptimal solution. Moreover, the optimal number of adjustments is not known a priori. Adjusting well controls too frequently will increase unnecessary well management and operation cost, and an excessively low number of control adjustments may not be enough to obtain a good yield. We investigate three derivative-free optimization algorithms, chosen for their robust and parallel nature, to determine optimal well control strategies. The algorithms chosen include generalized pattern search (GPS), particle swarm optimization (PSO) and covariance matrix adaptation evolution strategy (CMA-ES). These three algorithms encompass the breadth of available black-box optimization strategies: deterministic local search, stochas...
Hero, Alfred O.
Background Basic methods Model-based algorithms Model-free algorithms RTI Perspectives Conclusions 23, 2015 1 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI Coates (McGill) 2 52 #12;Background Basic methods Model-based algorithms Model-free algorithms RTI
Static and dynamic properties of a particle-based algorithm for non-ideal fluids and binary mixtures
Thomas Ihle; Erkan Tuzel
2006-10-12
A recently introduced particle-based model for fluid dynamics with effective excluded volume interactions is analyzed in detail. The interactions are modeled by means of stochastic multiparticle collisions which are biased and depend on local velocities and densities. Momentum and energy are exactly conserved locally. The isotropy and relaxation to equilibrium are analyzed and measured. It is shown how a discrete-time projection operator technique can be used to obtain Green-Kubo relations for the transport coefficients. Because of a large viscosity no long-time tails in the velocity auto-correlation and stress correlation functions were seen. Strongly reduced self-diffusion due to caging and an order/disorder transition is found at high collision frequency, where clouds consisting of at least four particles form a cubic phase. These structures were analyzed by measuring the pair-correlation function above and below the transition. Finally, the algorithm is extended to binary mixtures which phase-separate above a critical collision rate.
Relativistic Wave Equations: An Operational Approach
G. Dattoli; E. Sabia; K. Górska; A. Horzela; K. A. Penson
2015-02-02
The use of operator methods of algebraic nature is shown to be a very powerful tool to deal with different forms of relativistic wave equations. The methods provide either exact or approximate solutions for various forms of differential equations, such as relativistic Schr\\"odinger, Klein-Gordon and Dirac. We discuss the free particle hypotheses and those relevant to particles subject to non-trivial potentials. In the latter case we will show how the proposed method leads to easily implementable numerical algorithms.
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17
The model of laminated wave turbulence puts forth a novel computational problem - construction of fast algorithms for finding exact solutions of Diophantine equations in integers of order $10^{12}$ and more. The equations to be solved in integers are resonant conditions for nonlinearly interacting waves and their form is defined by the wave dispersion. It is established that for the most common dispersion as an arbitrary function of a wave-vector length two different generic algorithms are necessary: (1) one-class-case algorithm for waves interacting through scales, and (2) two-class-case algorithm for waves interacting through phases. In our previous paper we described the one-class-case generic algorithm and in our present paper we present the two-class-case generic algorithm.
Global tree network for computing structures enabling global processing operations
Blumrich; Matthias A. (Ridgefield, CT); Chen, Dong (Croton-On-Hudson, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Hoenicke, Dirk (Ossining, NY); Steinmacher-Burow, Burkhard D. (Mount Kisco, NY); Takken, Todd E. (Mount Kisco, NY); Vranas, Pavlos M. (Bedford Hills, NY)
2010-01-19
A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.
Comprehensive Examination Operating Systems
Wang, Deli
it. 2a. Briefly describe each of the following page replacement algorithms in terms of (1) the page, text editing, web browsing, applications with good locality) b) Web search engine (single application and enter the boarding area. (a) Is this a capabilities based or access control list based access control
The OLAP-Enabled Grid: Model and Query Processing Algorithms Michael Lawrence Andrew Rau-Chaplin
Rau-Chaplin, Andrew
is on the efficient optimization of resources for answering queries based on a distributed query algorithm which uses com- puting resources. Grids, widely distributed collections of heterogeneous computers whose.cgmLab.org Abstract The operation of modern distributed enterprises, be they commercial, scientific, or health related
Man-Portable Power Generation Devices: Product Design and Supporting Algorithms
and operation of microfabricated fuel cell sys- tems is proposed and algorithms for relevant optimization here. Microfabricated fuel cell systems are a promising alternative to batteries for man- portable for the degree of Doctor of Philosophy in Chemical Engineering Abstract A methodology for the optimal design
Mathe, Laszlo
windings and an inverter as an active rectifier. In Proceedings of the 2014 IEEE Vehicle Power windings as grid side inductors and controlling the inverter to operate as an active boost rectifierAalborg Universitet Electric vehicle battery charging algorithm using PMSM windings and an inverter
Power Flow Analysis Algorithm for Islanded LV Microgrids Including Distributed Generator Units with
Chaudhary, Sanjay
Power Flow Analysis Algorithm for Islanded LV Microgrids Including Distributed Generator Units power system. Being able to operate in both grid-connected and islanded mode, a microgrid manages and controls distributed energy resources, energy storage systems and loads, most of them are power electronic
Energy-Aware Prefetching for Parallel Disk Systems Algorithms, Models, and Evaluation
Qin, Xiao
implement the energy-saving calculation module that is invoked in the prefetching algorithm. We system grows, the energy consumed by the I/O system often becomes a large part of the total cost of ownership [16]. Reducing the energy costs of operating these large-scale disk I/O systems often becomes one
" Venkatasubramanian School of Electrical Engineering and Computer Science Washington State University, Pullman, WA will discuss the new algorithms along with illustrative examples on standard IEEE test systems. #12;- 2 - 1 that heavy power-flows across long transmission lines weakens the operational security of the power system
Genetic Algorithm based Data-aware Group Scheduling for Big Data Clouds Raghavendra Kune1
Buyya, Rajkumar
Genetic Algorithm based Data-aware Group Scheduling for Big Data Clouds Raghavendra Kune1 , Pramod on demand. Big Data Clouds is a new generation data analytics platform using Cloud computing as a back end and empirical tools. MapReduce scheduling models for Big Data computing operate in the cluster mode, where
ORNL ADCP POST-PROCESSING GUIDE AND MATLAB ALGORITHMS FOR MHK SITE FLOW AND TURBULENCE ANALYSIS
Gunawan, Budi; Neary, Vincent S
2011-09-01
Standard methods, along with guidance for post-processing the ADCP stationary measurements using MATLAB algorithms that were evaluated and tested by Oak Ridge National Laboratory (ORNL), are presented following an overview of the ADCP operating principles, deployment methods, error sources and recommended protocols for removing and replacing spurious data.
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem (Extended Abstract)
design and analysis. The usual metric, minimizing the total distance traveled, is an important one of other heavy machinery: for many such devices turning is an expensive operation. We give approximation, 11, 12, 21, 15], and has been a testbed for many of the most useful ideas in algorithm design
MODIS Global Cloud-Top Pressure and Amount Estimation: Algorithm Description and Results
Baum, Bryan A.
MODIS Global Cloud-Top Pressure and Amount Estimation: Algorithm Description and Results W. PAUL measurements for deriving global and regional cloud properties. MODIS has spectral coverage combined the capability for global cloud property retrievals. MODIS operational cloud products are derived globally
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19
Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.
Operations Research Tools for Addressing Current Challenges in Emergency Medical Services
Henderson, Shane
Operations Research Tools for Addressing Current Challenges in Emergency Medical Services Shane G of the key challenges and potential operations research based remedies, and to discuss in detail one for both operations research specialists and EMS professionals, although it is written primarily for EMS
Theoretical Analysis and Efficient Algorithms for Crowdsourcing
Li, Hongwei
2015-01-01
algorithm to solve it efficiently. Empirical results on bothto solve problems efficiently by online game players. Foralgorithm is proposed to efficiently infer the true labels
Design and Analysis of Algorithms Course Page
Design and Analysis of Algorithms. TTR 3:05- 4:25, IC 109. OFFICE HOURS: Wed 11-12 or by appointment (Rm: Skiles, 116).
Parallel GPU Algorithms for Mechanical CAD
Krishnamurthy, Adarsh
2010-01-01
of California, Berkeley, Mechanical Engineering Department,GPU Algorithms for Mechanical CAD by Adarsh Krishnamurthy Aof Philosophy in Engineering - Mechanical Engineering in the
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
High-Performance Engineering Optimization: Applications, Algorithms...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
High-Performance Engineering Optimization: Applications, Algorithms, and Adoption Event Sponsor: Mathematics and Computer Science Division Start Date: Aug 19 2015 - 10:30am...
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-11-08
Algorithmic cooling is a method that employs thermalization to increase qubit purification level, namely it reduces the qubit-system's entropy. We utilized gradient ascent pulse engineering (GRAPE), an optimal control algorithm, to implement algorithmic cooling in liquid state nuclear magnetic resonance. Various cooling algorithms were applied onto the three qubits of $^{13}$C$_2$-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. In particular, in one experiment a carbon qubit was cooled by a factor of 4.61. This work is a step towards potentially integrating tools of NMR quantum computing into in vivo magnetic resonance spectroscopy.
LO, NLO, LO* and jet algorithms
J. Huston
2010-01-14
The impact of NLO corrections, and in particular, the role of jet algorithms, is examined for a variety of processes at the Tevatron and LHC.
Hybrid and optical implementation of the Deutsch-Jozsa algorithm
Luis A. Garcia; Jagdish R. Luthra
2009-12-31
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.
A fast contour descriptor algorithm for supernova imageclassification
Aragon, Cecilia R.; Aragon, David Bradburn
2006-07-16
We describe a fast contour descriptor algorithm and its application to a distributed supernova detection system (the Nearby Supernova Factory) that processes 600,000 candidate objects in 80 GB of image data per night. Our shape-detection algorithm reduced the number of false positives generated by the supernova search pipeline by 41% while producing no measurable impact on running time. Fourier descriptors are an established method of numerically describing the shapes of object contours, but transform-based techniques are ordinarily avoided in this type of application due to their computational cost. We devised a fast contour descriptor implementation for supernova candidates that meets the tight processing budget of the application. Using the lowest-order descriptors (F{sub 1} and F{sub -1}) and the total variance in the contour, we obtain one feature representing the eccentricity of the object and another denoting its irregularity. Because the number of Fourier terms to be calculated is fixed and small, the algorithm runs in linear time, rather than the O(n log n) time of an FFT. Constraints on object size allow further optimizations so that the total cost of producing the required contour descriptors is about 4n addition/subtraction operations, where n is the length of the contour.
Not Available
1988-01-01
The Nuclear Waste Policy Act of 1982 assigned to the Department of Energy's (DOE) Office of Civilian Waste Management the responsibility for disposing of high-level waste and spent fuel. A significant part of that responsibility involves transporting nuclear waste materials within the federal waste management system; that is, from the waste generator to the repository. The lead responsibility for transportation operations has been assigned to Oak Ridge Operations, with Oak Ridge National Laboratory (ORNL) providing technical support through the Transportation Operations Support Task Group. One of the ORNL support activities involves assessing what facilities, equipment and services are required to assure that an acceptable, cost-effective and safe transportation operations system can be designed, operated and maintained. This study reviews, surveys and assesses the experience of Nuclear Assurance Corporation (NAC) in operating a fleet of spent-fuel shipping casks to aid in developing the spent-fuel transportation system.
Numerical Methods for the QCD Overlap Operator IV: Hybrid Monte Carlo
N. Cundy; S. Krieg; G. Arnold; A. Frommer; Th. Lippert; K. Schilling
2008-12-18
The extreme computational costs of calculating the sign of the Wilson matrix within the overlap operator have so far prevented four dimensional dynamical overlap simulations on realistic lattice sizes, because the computational power required to invert the overlap operator, the time consuming part of the Hybrid Monte Carlo algorithm, is too high. In this series of papers we introduced the optimal approximation of the sign function and have been developing preconditioning and relaxation techniques which reduce the time needed for the inversion of the overlap operator by over a factor of four, bringing the simulation of dynamical overlap fermions on medium-size lattices within the range of Teraflop-computers. In this paper we adapt the HMC algorithm to overlap fermions. We approximate the matrix sign function using the Zolotarev rational approximation, treating the smallest eigenvalues of the Wilson operator exactly within the fermionic force. We then derive the fermionic force for the overlap operator, elaborating on the problem of Dirac delta-function terms from zero crossings of eigenvalues of the Wilson operator. The crossing scheme proposed shows energy violations which are better than O($\\Delta\\tau^2$) and thus are comparable with the violations of the standard leapfrog algorithm over the course of a trajectory. We explicitly prove that our algorithm satisfies reversibility and area conservation. Finally, we test our algorithm on small $4^4$, $6^4$, and $8^4$ lattices at large masses.
Detailed balance The key idea in most practical MCMC methods is reversibility or
Green, Peter
Detailed balance The key idea in most practical MCMC methods is reversibility or , i.e. a balance is in detailed balance with respect to Ã? if for all Â¼ , Â´ ÂµÃ?Â´ Â¼ Âµ 73 Why does detailed balance ensure the correct stationary distribution? Suppose Â´ ÂµÃ?Â´ Â¼ Âµ Â´ Â¼ ÂµÃ?Â´ Â¼ Âµ Sum both sides over : we have "global balance": Â´ Âµ
Xiao, Jianyuan; Liu, Jian; Qin, Hong; Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 ; Yu, Zhi
2013-10-15
Smoothing functions are commonly used to reduce numerical noise arising from coarse sampling of particles in particle-in-cell (PIC) plasma simulations. When applying smoothing functions to symplectic algorithms, the conservation of symplectic structure should be guaranteed to preserve good conservation properties. In this paper, we show how to construct a variational multi-symplectic PIC algorithm with smoothing functions for the Vlasov-Maxwell system. The conservation of the multi-symplectic structure and the reduction of numerical noise make this algorithm specifically suitable for simulating long-term dynamics of plasmas, such as those in the steady-state operation or long-pulse discharge of a super-conducting tokamak. The algorithm has been implemented in a 6D large scale PIC code. Numerical examples are given to demonstrate the good conservation properties of the multi-symplectic algorithm and the reduction of the noise due to the application of smoothing function.
Lu, Jianfeng
Multipole Representation of the Fermi Operator with Application to the Electronic Structure Analysis of Metallic Systems Lin Lin and Jianfeng Lu Program in Applied and Computational Mathematics and the Fermi operator, and use this representation to develop algorithms for electronic structure analysis
A Detailed Chemical Kinetic Analysis of Low Temperature Non-Sooting Diesel Combustion
Aceves, S M; Flowers, D L
2004-10-01
We have developed a model of the diesel fuel injection process for application to analysis of low temperature non-sooting combustion. The model uses a simplified mixing correlation and detailed chemical kinetics, and analyzes a parcel of fuel as it moves along the fuel jet, from injection into evaporation and ignition. The model predicts chemical composition and soot precursors, and is applied at conditions that result in low temperature non-sooting combustion. Production of soot precursors is the first step toward production of soot, and modeling precursor production is expected to give insight into the overall evolution of soot inside the engine. The results of the analysis show that the model has been successful in describing many of the observed characteristics of low temperature combustion. The model predicts results that are qualitatively similar to those obtained for soot formation experiments at conditions in which the EGR rate is increased from zero to very high values as the fueling rate is kept constant. The model also describes the two paths to achieve non-sooting combustion. The first is smokeless rich combustion and the second is modulated kinetics (MK). The importance of the temperature after ignition and the equivalence ratio at the time of ignition is demonstrated, as these parameters can be used to collapse onto a single line all the results for soot precursors for multiple fueling rates. A parametric analysis indicates that precursor formation increases considerably as the gas temperature in the combustion chamber and the characteristic mixing time are increased. The model provides a chemical kinetic description of low temperature diesel combustion that improves the understanding of this clean and efficient regime of operation.
Webinar: Guidance for Filling Out a Detailed H2A Production Case Study
Broader source: Energy.gov [DOE]
Video recording and text version of the webinar titled, Guidance for Filling Out a Detailed H2A Production Case Study, originally presented on July 9, 2013.
River Corridor Cleanup Contract Fiscal Year 2006 Detailed Work Plan: DWP Summary, Volume 1
Project Integration
2005-09-26
This detailed work plan provides the scope, cost, and schedule for the Fiscal Year 2006 activities required to support River Corridor cleanup objectives within the directed guidance.
The Energy Endoscope: Real-time Detailed Energy Accounting for Wireless Sensor Nodes
Stathopoulos, Thanos; McIntire, Dustin; Kaiser, W J
2007-01-01
meter for energy monitoring of wireless sensor networks attime Detailed Energy Accounting for Wireless Sensor Nodessuch Subsystem Energy (%) Ethernet CF Wireless PXA SDRAM
California at Berkeley, University of
Detailed Energy Data Collection for Miscellaneous and Electronic Loads in a Commercial Office to cost-effectively generate representative MELs energy data for future studies, this study addressed
Saxena, Samveg
2013-01-01
Steward, F.R. , 1988, Exergy Analysis of Thermal, Chemical,Engines Using Detailed Exergy Analysis Samveg Saxena 1 ,that is using exergy analysis as a research portfolio
Spectral Operators of Matrices
2014-01-10
Jan 10, 2014 ... a thorough study on a new class of matrix valued functions, coined as spectral operators of ..... not self-adjoint. ...... 9 (1981) 1135–1151.
Transmission and Storage Operations
Transmission and Storage Operations Natural Gas Infrastructure R&D and Methane Mitigation Workshop Mary Savalle, PMP, LSSGB Compression Reliability Engineer November 12, 2014...
Broader source: Energy.gov [DOE]
This position is located in Power Services of the Bonneville Power Administration. The purpose of this position is to serve as a developmental operations research analyst responsible for...
Broader source: Energy.gov (indexed) [DOE]
to the Commission to Review Effectiveness of National Energy Laboratories Jeff Smith Deputy for Operations Oak Ridge National Laboratory February 24, 2015 The Importance...
Not Available
1992-03-01
This report discusses the following aspects of the Bevalac: Accelerator Technology and Operations Summary; Support for Space Exploration; Nuclear Science Research; and Biomedical Research.
Not Available
1990-06-01
This report discusses the following topics in relation to the Bevalac accelerator: accelerator technology operations summary; nuclear science; biomedical research; and publications and presentations.
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
Algorithmic cooling and scalable NMR quantum computers
Mor, Tal
Algorithmic cooling and scalable NMR quantum computers P. Oscar Boykin*, Tal MorÂ§ , Vwani cooling (via polarization heat bath)--a powerful method for obtaining a large number of highly polarized (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression
Energy Aware Algorithmic Engineering Swapnoneel Roy
Rudra,, Atri
Energy Aware Algorithmic Engineering Swapnoneel Roy School of Computing University of North Florida: akshat.verma@in.ibm.com Abstract--In this work, we argue that energy management should be a guiding are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number
Enhancing Smart Home Algorithms Using Temporal Relations
Cook, Diane J.
Enhancing Smart Home Algorithms Using Temporal Relations Vikramaditya R. JAKKULA1 and Diane J COOK School of Electrical Engineering and Computer Science Abstract. Smart homes offer a potential benefit improves the performance of these algorithms and thus enhances the ability of smart homes to monitor
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of number fields to an open conjecture from elementary number theory.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01
polynomial time algorithm O(n?), ISO-MT, that seems' to solve the graph isomorphism decision problem correctly for all classes of graphs. Our algorithm is extremely useful from the practical point of view since counter examples (pairs of graphs for which our...
Algorithmic Aspects of Proportional Symbol Sergio Cabello
Utrecht, Universiteit
Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello Herman Haverkort Marc van Kreveld-CS-2008-008 www.cs.uu.nl ISSN: 0924-3275 #12;Algorithmic Aspects of Proportional Symbol Maps Sergio@cs.uu.nl Abstract Proportional symbol maps visualize numerical data associated with point locations by plac- ing
Quadruped Gait Learning Using Cyclic Genetic Algorithms
Hickey, Timothy J.
and in particular, Genetic Algorithms, have previously been used to develop gaits for legged (primarily hexapod]. In a previous work Parker made use of cyclic genetic algorithms to develop walking gaits for a hexapod robot [5]. Each of the six legs of this hexapod robot could only move vertically and horizontally and the number
Stochastic Search for Signal Processing Algorithm Optimization
Stochastic Search for Signal Processing Algorithm Optimization Bryan Singer Manuela Veloso May address the complex task of signal processing optimization. We first introduce and discuss the complexities of this domain. In general, a single signal processing algorithm can be represented by a very
Communication and Computation in Distributed CSP Algorithms
Krishnamachari, Bhaskar
Communication and Computation in Distributed CSP Algorithms C`esar Fern`andez1 , Ram´on B´ejar1 in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment
Virtual Scanning Algorithm for Road Network Surveillance
Jeong, Jaehoon "Paul"
Virtual Scanning Algorithm for Road Network Surveillance Jaehoon Jeong, Student Member, IEEE, Yu Gu a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design roadways and 2) the road network maps are normally known. We guarantee the detection of moving targets
Pole Placement Algorithms ROBERT MAHONY~ UWE
Moore, John Barratt
Pole Placement Algorithms ROBERT MAHONY~ UWE for Symmetric Realisations HELMKE$ JOHN MOORE a numerical algorithm for deter- mining optimal output feedback gains for the pole place- ment task is well defined even when an exact solution to the pole placement task does not exist. Thus, the proposed
Discrimination of Unitary Transformations and Quantum Algorithms
David Collins
2008-11-09
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the sequence with others remaining fixed. For oracle query algorithms, the input determines the oracle unitary transformation. Such algorithms can be regarded as devices for discriminating amongst a set of unitary transformations. The question arises: "Given a set of known oracle unitary transformations, to what extent is it possible to discriminate amongst them?" We investigate this for the Deutsch-Jozsa problem. The task of discriminating amongst the admissible oracle unitary transformations results in an exhaustive collection of algorithms which can solve the problem with certainty.
Final report: Task 4a.2 20% wind scenario assessment of electric grid operational features
Toole, Gasper L.
2009-01-01
Wind integration modeling in electricity generation capacity expansion models is important in that these models are often used to inform political or managerial decisions. Poor representation of wind technology leads to under-estimation of wind's contribution to future energy scenarios which may hamper growth of the industry. The NREL's Wind Energy Deployment System (WinDS) model provides the most detailed representation of geographically disperse renewable resources and the optimization of transmission expansion to access these resources. Because WinDS was selected as the primary modeling tool for the 20% Wind Energy by 2030 study, it is the ideal tool for supplemental studies of the transmission expansion results. However, as the wind industry grows and knowledge related to the wind resource and integration of wind energy into the electric system develops, the WinDS model must be continually improved through additional data and innovative algorithms to capture the primary effects of variable wind generation. The detailed representation of wind technology in the WinDS model can be used to provide improvements to the simplified representation of wind technology in other capacity expansion models. This task did not employ the WinDS model, but builds from it and its results. Task 4a.2 provides an assessment of the electric grid operational features of the 20% Wind scenario and was conducted using power flow models accepted by the utility industry. Tasks 2 provides information regarding the physical flow of electricity on the electric grid which is a critical aspect of infrastructure expansion scenarios. Expanding transmission infrastructure to access remote wind resource in a physically realizable way is essential to achieving 20% wind energy by 2030.
Characterization of a noisy quantum process by complementary classical operations
Holger F. Hofmann; Ryo Okamoto; Shigeki Takeuchi
2006-10-31
One of the challenges in quantum information is the demonstration of quantum coherence in the operations of experimental devices. While full quantum process tomography can do the job, it is both cumbersome and unintuitive. In this presentation, we show that a surprisingly detailed and intuitively accessible characterization of errors is possible by measuring the error statistics of only two complementary classical operations of a quantum gate.
Danner, Andrew
of the School of Geography, University of Leeds for his contribution to the development work associated the boundaries for a set of contiguous zones. Each zone is characterised by a label (the zone's identi
2003 Special issue Statistical efficiency of adaptive algorithms
Widrow, Bernard
2003 Special issue Statistical efficiency of adaptive algorithms Bernard Widrow*, Max Kamenetsky Serra Mall, Stanford, CA 94305, USA Abstract The statistical efficiency of a learning algorithm applied gradient descent adaptive algorithms are compared, the LMS algorithm and the LMS/Newton algorithm. LMS
EM Algorithms from a Non-Stochastic Perspective Charles Byrne
Byrne, Charles
EM Algorithms from a Non-Stochastic Perspective Charles Byrne Charles Byrne@uml.edu Department The EM algorithm is not a single algorithm, but a template for the con- struction of iterative algorithms a method for estimat- ing parameters in statistics, the essence of the EM algorithm is not stochastic
A Visualization System for Correctness Proofs of Graph Algorithms
Metaxas, Takis
A Visualization System for Correctness Proofs of Graph Algorithms P.A. Gloor1, D.B. Johnson2, F. Makedon2, P. Metaxas3 Feb. 28, 1993 Running head: Proof Visualization of Graph Algorithms Correspondence proofs of graph algorithms. The system has been demonstrated for a greedy algorithm, Prim's algorithm
Sketching, streaming, and sub-linear space algorithms
Reif, Rafael
Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) #12 algorithms are approximate · We assume worst-case input stream Adversaries do exist General algorithms Modular composition · Randomized algorithms OK (often necessary) Randomness in the algorithm
QRlike Algorithms---An Overview of Convergence Theory and Practice
QRÂlike Algorithms--- An Overview of Convergence Theory and Practice David S. Watkins Abstract. The family of GR algorithms is discussed. This includes the stanÂ dard and multishift QR and LR algorithms, the Hamiltonian QR algorithm, divideÂandÂconquer algorithms such as the matrix sign function method, and many
human spaceflight and operations
Anand, Mahesh
1 human spaceflight and operations Lunar Lander human spaceflight and operations #12;2 human cooperation in exploration prim ary objective opportunity for investigations #12;3 human spaceflight No RHUs LANDING SITE South Polar Reliant on Solar Power generation + conventional thermal control LAUNCHER
Emergency Evacuation Operations Plan
Eberhard, Marc O.
Emergency Evacuation Operations Plan Civil and Environmental Engineering More Hall 2015 #12;1 Introduction Environmental Health and Safety (EH&S) developed this model Emergency Evacuation and Operations Plan (EEOP) to assist departments in preparing for building emergencies as expected and required
Semantics for algebraic operations
Plotkin, Gordon; Power, John
2003-01-01
Given a category C with finite products and a strong monad T on C, we investigate axioms under which an ObC-indexed family of operations of the form ?_x : (Tx)n ! Tx provides a definitive semantics for algebraic operations ...
Lipson, Michal
Samsung Engineer I Austin TX Saudi Aramco Operation Engineer Dhahran Saudi ARABIA Schlumberger Field
DETAILED LOOP MODEL (DLM) ANALYSIS OF LIQUID SOLAR THERMOSIPHONS WITH HEAT EXCHANGERS
Mertol, A.
2013-01-01
pump and controls represent an investment in terms of initial cost, maintenance and electrical operating costs.
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15
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.
An enhanced version of the heat exchange algorithm with excellent energy conservation properties
Wirnsberger, P; Dellago, C
2015-01-01
We propose a new algorithm for non-equilibrium molecular dynamics simulations of thermal gradients. The algorithm is an extension of the heat exchange algorithm developed by Hafskjold and co-workers [Mol. Phys. 80, 1389 (1993); Mol. Phys. 81, 251 (1994)], in which a certain amount of heat is added to one region and removed from another by rescaling velocities appropriately. Since the amount of added and removed heat is the same and the dynamics between velocity rescaling steps is Hamiltonian, the heat exchange algorithm is expected to conserve the energy. However, it has been reported previously that the original version of the heat exchange algorithm exhibits a pronounced drift in the total energy, the exact cause of which remained hitherto unclear. Here, we show that the energy drift is due to the truncation error arising from the operator splitting and suggest an additional coordinate integration step as a remedy. The new algorithm retains all the advantages of the original one whilst exhibiting excellent ...
FlashPower: A Detailed Power Model for NAND Flash Memory
Gurumurthi, Sudhanva
FlashPower: A Detailed Power Model for NAND Flash Memory Vidyabhushan Mohan Sudhanva Gurumurthi, such as cell-phones and music players, and is increasingly displacing hard disk drives as the primary storage. Exploring this design space requires detailed insights into the power characteristics of flash memory
Bak, Claus Leth
Aalborg Universitet Transient Studies in Large Offshore Wind Farms, Employing Detailed Circuit Studies in Large Offshore Wind Farms, Employing Detailed Circuit Breaker Representation. Electrical Power 1996-1073 www.mdpi.com/journal/energies Article Transient Studies in Large Offshore Wind Farms
Design Professional-Schedule of Project Details Page 1 of 5 Form Date: AE January 2010
Kamat, Vineet R.
Professional-Schedule of Project Details Page 2 of 5 Form Date: AE January 2010 The Basic Lump Sum Fee includes in the Basic Fee are as follows: Firm Name Type of Architect/Engineer Additional Fee The following additional Professional-Schedule of Project Details Page 1 of 5 Form Date: AE January 2010 Note: Instructions
EconoGrid: A detailed Simulation Model of a Standards-based Grid Compute Economy
EconoGrid: A detailed Simulation Model of a Standards-based Grid Compute Economy EconoGrid is a detailed simulation model, implemented in SLX1 , of a grid compute economy that implements selected of users. In a grid compute economy, computing resources are sold to users in a market where price
Entanglement quantification by local unitary operations
Monras, A.; Giampaolo, S. M.; Gualdi, G.; Illuminati, F.; Adesso, G.; Davies, G. B.
2011-07-15
Invariance under local unitary operations is a fundamental property that must be obeyed by every proper measure of quantum entanglement. However, this is not the only aspect of entanglement theory where local unitary operations play a relevant role. In the present work we show that the application of suitable local unitary operations defines a family of bipartite entanglement monotones, collectively referred to as ''mirror entanglement.'' They are constructed by first considering the (squared) Hilbert-Schmidt distance of the state from the set of states obtained by applying to it a given local unitary operator. To the action of each different local unitary operator there corresponds a different distance. We then minimize these distances over the sets of local unitary operations with different spectra, obtaining an entire family of different entanglement monotones. We show that these mirror-entanglement monotones are organized in a hierarchical structure, and we establish the conditions that need to be imposed on the spectrum of a local unitary operator for the associated mirror entanglement to be faithful, i.e., to vanish in and only in separable pure states. We analyze in detail the properties of one particularly relevant member of the family, the ''stellar mirror entanglement'' associated with the traceless local unitary operations with nondegenerate spectra and equispaced eigenvalues in the complex plane. This particular measure generalizes the original analysis of S. M. Giampaolo and F. Illuminati [Phys. Rev. A 76, 042301 (2007)], valid for qubits and qutrits. We prove that the stellar entanglement is a faithful bipartite entanglement monotone in any dimension and that it is bounded from below by a function proportional to the linear entropy and from above by the linear entropy itself, coinciding with it in two- and three-dimensional spaces.
Advanced algorithms for information science
Argo, P.; Brislawn, C.; Fitzgerald, T.J.; Kelley, B.; Kim, W.H.; Mazieres, B.; Roeder, H.; Strottman, D.
1998-12-31
This is the final report of a one-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). In a modern information-controlled society the importance of fast computational algorithms facilitating data compression and image analysis cannot be overemphasized. Feature extraction and pattern recognition are key to many LANL projects and the same types of dimensionality reduction and compression used in source coding are also applicable to image understanding. The authors have begun developing wavelet coding which decomposes data into different length-scale and frequency bands. New transform-based source-coding techniques offer potential for achieving better, combined source-channel coding performance by using joint-optimization techniques. They initiated work on a system that compresses the video stream in real time, and which also takes the additional step of analyzing the video stream concurrently. By using object-based compression schemes (where an object is an identifiable feature of the video signal, repeatable in time or space), they believe that the analysis is directly related to the efficiency of the compression.
A high voltage, high current, low error operational amplifier with novel features
Poitzsch, Alec Julius
2014-01-01
This project details the design and evaluation of an operational amplifier designed in XF40, a 40 Volt bipolar process. Initially the signal path circuitry of the amplifier is outlined. Design decisions are chiefly formed ...
Entanglement versus relaxation and decoherence in a quantum algorithm for quantum chaos
Bettelli, S.; Shepelyansky, D.L. [Laboratoire de Physique Quantique, UMR 5626 du CNRS, Universite Paul Sabatier, 31062 Toulouse Cedex 4 (France)
2003-05-01
We study analytically and numerically the behavior of the concurrence (a measure of the entanglement of formation) of a pair of qubits in a quantum computer operating an efficient algorithm for quantum chaos. Our results show that in an ideal algorithm the entanglement decays exponentially with the diffusive relaxation rate induced by classical chaos. This decay reaches a residual level which drops exponentially with increasing number of qubits n{sub q}. Decoherence destroys the residual entanglement with a rate exponential in n{sub q}.
Evaluating operating system vulnerability to memory errors.
Ferreira, Kurt Brian; Bridges, Patrick G.; Pedretti, Kevin Thomas Tauke; Mueller, Frank; Fiala, David; Brightwell, Ronald Brian
2012-05-01
Reliability is of great concern to the scalability of extreme-scale systems. Of particular concern are soft errors in main memory, which are a leading cause of failures on current systems and are predicted to be the leading cause on future systems. While great effort has gone into designing algorithms and applications that can continue to make progress in the presence of these errors without restarting, the most critical software running on a node, the operating system (OS), is currently left relatively unprotected. OS resiliency is of particular importance because, though this software typically represents a small footprint of a compute node's physical memory, recent studies show more memory errors in this region of memory than the remainder of the system. In this paper, we investigate the soft error vulnerability of two operating systems used in current and future high-performance computing systems: Kitten, the lightweight kernel developed at Sandia National Laboratories, and CLE, a high-performance Linux-based operating system developed by Cray. For each of these platforms, we outline major structures and subsystems that are vulnerable to soft errors and describe methods that could be used to reconstruct damaged state. Our results show the Kitten lightweight operating system may be an easier target to harden against memory errors due to its smaller memory footprint, largely deterministic state, and simpler system structure.
Liley, David
COURSE PREFERENCE Provide details of your preferred course(s). Refer to Swinburne Course Search.g. Hawthorn) (e.g. full-time or part-time) (e.g. Feb 2015) 1. 2. 3. 1 Course type Enter the abbreviated course of Technology If same as postal address, write `as above' #12;Do you have a disability, impairment, long-term
An Efficient Rescaled Perceptron Algorithm for Conic Systems
Vempala, Santosh
The classical perceptron algorithm is an elementary row-action/relaxation algorithm for solving a homogeneous linear inequality system Ax > 0. A natural condition measure associated with this algorithm is the Euclidean ...
Statistical algorithms in the study of mammalian DNA methylation
Singer, Meromit
2012-01-01
non-overlapping CCGIs: the algorithm 2.2.6 Running time andI Statistical algorithms in the study of mammalian DNAof the result of the CCGI algorithm. Nodes marked along the
Two Strategies to Speed up Connected Component Labeling Algorithms
Wu, Kesheng; Otoo, Ekow; Suzuki, Kenji
2008-01-01
but not linear set union algorithm,” J. ACM, vol. 22, no. 2,analysis of set union algorithms,” J. ACM, vol. 31, no. 2,An improved equivalence algorithm,” Commun. ACM, vol. 7, no.
Comparison of generality based algorithm variants for automatic taxonomy generation
Madnick, Stuart E.
We compare a family of algorithms for the automatic generation of taxonomies by adapting the Heymann-algorithm in various ways. The core algorithm determines the generality of terms and iteratively inserts them in a growing ...
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions
Troina, Angelo
An Alternative to Gillespie's Algorithm for Simulating Chemical Reactions Roberto Barbuti, Andrea introduce a probabilistic algorithm for the simulation of chemical reactions, which can be used evolution of chemical reactive systems described by Gillespie. Moreover, we use our algorithm
Global Optimization for Scheduling Refinery Crude Oil Operations Ramkumar Karuppiaha
Grossmann, Ignacio E.
Global Optimization for Scheduling Refinery Crude Oil Operations Ramkumar Karuppiaha , Kevin C of a nonconvex Mixed Integer Nonlinear Programming (MINLP) model for the scheduling of crude oil movement of crude oil and products. Furthermore, detailed scheduling models often require a continuous time
MGMT 421, Production and Operations Management Instructor: Mr. Donald Marshall
Diestel, Geoff
the relationship between MRP, ERP, JIT, and Lean Operations. Recall the techniques used for aggregate and detailed in manufacturing, logistics, and marketing. b) Identify the scope of enterprise resource planning (ERP & MRP) Identify important attributes of a lean supply chain. Week16 & 17 Complete final / term paper, makeup quiz
-calculus for the Stokes operator on Andre Noll, Jurgen Saal
Saal, Jürgen
´e Noll, J¨urgen Saal In 1981 Giga [Gig81] investigated the analyticity of the Stokes semigroup. In a subsequent paper [Gig85] he considered domains of fractional powers of the Stokes operator and proved in hand extends the results of [Gig85] in several ways. By checking the details in Giga's proof one
Archer, Daniel E.; Hornback, Donald Eric; Johnson, Jeffrey O.; Nicholson, Andrew D.; Patton, Bruce W.; Peplow, Douglas E.; Miller, Thomas Martin; Ayaz-Maierhafer, Birsen
2015-01-01
This report summarizes the findings of a two year effort to systematically assess neutron and gamma backgrounds relevant to operational modeling and detection technology implementation. The first year effort focused on reviewing the origins of background sources and their impact on measured rates in operational scenarios of interest. The second year has focused on the assessment of detector and algorithm performance as they pertain to operational requirements against the various background sources and background levels.
Defining work from operational principles
R. Gallego; J. Eisert; H. Wilming
2015-09-25
In recent years we have witnessed a concentrated effort to make sense of thermodynamics for small-scale systems. One of the main difficulties is that, at the nano-scale, thermal fluctuations of energy in general render it conceptually difficult to distinguish work from heat. Despite of several attempts to resolve this issue, many of which inspired by quantum information theory, there is still remarkable little consensus on it. In this work, we attempt to define work in a strictly operational way. In our resource-theoretic approach, agents wish to agree upon how much work needs to be invested to effect a transition from one state of an arbitrary quantum work-storage device to another. We introduce basic operational principles, and deduce from them a strict set of mathematical properties that any reasonable function quantifying such work has to fulfill. We show that one work quantifier satisfying all the required properties is the difference of the non-equilibrium free energy of the initial and final state of the work-storage system. More generally, for any work quantifier fulfilling the stated properties, we can derive a quantitative second law in the sense of bounding the work that can be performed using some non-equilibrium resource by the work that is needed to create it. The appropriate treatment of correlations turns out to be essential to obtain such second laws and we discuss their role in detail. We furthermore discuss the role of path dependence for work quantifiers and the connection to the concept of probability-distributions of work. Our mathematical results can be formulated abstractly and are general enough to carry over to other resource theories than quantum thermodynamics.
Nishimura, K.; Dey, B.; Aston, D.; Leith, D.W.G.S.; Ratcliff, B.; Roberts, D.; Ruckman, L.; Shtol, D.; Varner, G.S.; Va'vra, J.; Vavra, Jerry; ,
2012-07-30
We present a detailed study of a novel Cherenkov imaging detector called the Focusing DIRC (FDIRC) with waveform digitizing electronics. In this test study, the FDIRC prototype has been instrumented with seven Hamamatsu H-8500 MaPMTs. Waveforms from {approx}450 pixels are digitized with waveform sampling electronics based on the BLAB2 ASIC, operating at a sampling speed of {approx}2.5 GSa/s. The FDIRC prototype was tested in a large cosmic ray telescope (CRT) providing 3D muon tracks with {approx}1.5 mrad angular resolution and muon energy of E{sub muon} > 1.6 GeV. In this study we provide a detailed analysis of the tails in the Cherenkov angle distribution as a function of various variables, compare experimental results with simulation, and identify the major contributions to the tails. We demonstrate that to see the full impact of these tails on the Cherenkov angle resolution, it is crucial to use 3D tracks, and have a full understanding of the role of ambiguities. These issues could not be fully explored in previous FDIRC studies where the beam was perpendicular to the quartz radiator bars. This work is relevant for the final FDIRC prototype of the PID detector at SuperB, which will be tested this year in the CRT setup.
Environmental assessment related to the operation of Argonne National Laboratory, Argonne, Illinois
Not Available
1982-08-01
In order to evaluate the environmental impacts of Argonne National Laboratory (ANL) operations, this assessment includes a descriptive section which is intended to provide sufficient detail to allow the various impacts to be viewed in proper perspective. In particular, details are provided on site characteristics, current programs, characterization of the existing site environment, and in-place environmental monitoring programs. In addition, specific facilities and operations that could conceivably impact the environment are described at length. 77 refs., 16 figs., 47 tabs.
Improved Sampling Algorithms in Lattice QCD
Gambhir, Arjun Singh
2015-01-01
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
QCDLAB: Designing Lattice QCD Algorithms with MATLAB
Artan Borici
2006-10-09
This paper introduces QCDLAB, a design and research tool for lattice QCD algorithms. The tool, a collection of MATLAB functions, is based on a ``small-code'' and a ``minutes-run-time'' algorithmic design philosophy. The present version uses the Schwinger model on the lattice, a great simplification, which shares many features and algorithms with lattice QCD. A typical computing project using QCDLAB is characterised by short codes, short run times, and the ability to make substantial changes in a few seconds. QCDLAB 1.0 can be downloaded from the QCDLAB project homepage {\\tt http://phys.fshn.edu.al/qcdlab.html}.
Improved Sampling Algorithms in Lattice QCD
Arjun Singh Gambhir; Kostas Orginos
2015-06-19
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating potential barriers that may cause inefficiencies in exploring the field configuration space. The highly successful Cluster algorithms for spin systems can be derived from the RMC framework. In this work we apply RMC ideas to pure gauge theory, aiming to alleviate the critical slowing down observed in the topological charge evolution as well as other long distance observables. We present various formulations of the basic idea and report on our numerical experiments with these algorithms.
Recent Developments in Dual Lattice Algorithms
J. Wade Cherrington
2008-10-02
We review recent progress in numerical simulations with dually transformed SU(2) LGT, starting with a discussion of explicit dual amplitudes and algorithms for SU(2) pure Yang Mills in D=3 and D=4. In the D=3 case, we discuss results that validate the dual algorithm against conventional simulations. We also review how a local, exact dynamical fermion algorithm can naturally be incorporated into the dual framework. We conclude with an outlook for this technique and a look at some of the current challenges we've encountered with this method, specifically critical slowing down and the sign problem.
An Overview of LISA Data Analysis Algorithms
Edward K. Porter
2009-10-02
The development of search algorithms for gravitational wave sources in the LISA data stream is currently a very active area of research. It has become clear that not only does difficulty lie in searching for the individual sources, but in the case of galactic binaries, evaluating the fidelity of resolved sources also turns out to be a major challenge in itself. In this article we review the current status of developed algorithms for galactic binary, non-spinning supermassive black hole binary and extreme mass ratio inspiral sources. While covering the vast majority of algorithms, we will highlight those that represent the state of the art in terms of speed and accuracy.
Gen IV Materials Handbook Functionalities and Operation
Ren, Weiju
2009-12-01
This document is prepared for navigation and operation of the Gen IV Materials Handbook, with architecture description and new user access initiation instructions. Development rationale and history of the Handbook is summarized. The major development aspects, architecture, and design principles of the Handbook are briefly introduced to provide an overview of its past evolution and future prospects. Detailed instructions are given with examples for navigating the constructed Handbook components and using the main functionalities. Procedures are provided in a step-by-step fashion for Data Upload Managers to upload reports and data files, as well as for new users to initiate Handbook access.
CH Packaging Operations Manual
Washington TRU Solutions LLC
2005-06-13
This procedure provides instructions for assembling the CH Packaging Drum payload assembly, Standard Waste Box (SWB) assembly, Abnormal Operations and ICV and OCV Preshipment Leakage Rate Tests on the packaging seals, using a nondestructive Helium (He) Leak Test.
Nuclear material operations manual
Tyler, R.P.
1981-02-01
This manual provides a concise and comprehensive documentation of the operating procedures currently practiced at Sandia National Laboratories with regard to the management, control, and accountability of nuclear materials. The manual is divided into chapters which are devoted to the separate functions performed in nuclear material operations-management, control, accountability, and safeguards, and the final two chapters comprise a document which is also issued separately to provide a summary of the information and operating procedures relevant to custodians and users of radioactive and nuclear materials. The manual also contains samples of the forms utilized in carrying out nuclear material activities. To enhance the clarity of presentation, operating procedures are presented in the form of playscripts in which the responsible organizations and necessary actions are clearly delineated in a chronological fashion from the initiation of a transaction to its completion.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2014-10-14
This Order establishes requirements for the management and operation of the Department of Energy (DOE) Federal Protective Forces (FPF), Contractor Protective Forces (CPF), and the Physical Security of property and personnel under the cognizance of DOE.
Wurbs, Ralph A.
1985-01-01
to store and to release or withdraw for flood control and various conservation purposes. The report is intended to provide a comprehensive, indepth description of how reservoirs are operated in Texas...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2005-01-14
The notice defines requirements and responsibilities for continuity of operations planning within the DOE to ensure the capability to continue essential Departmental functions across a wide range of all hazard emergencies. Does not cancel other directives.
Unknown
2011-08-17
vehicles made in going through the arterial and the total stops at each intersection, were also used. Two operational regions were identified in this research. It was found that none of the strategies provided significant improvement over the others...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1992-04-30
To establish policies, responsibilities and authorities for implementing and sustaining the Department of Energy (DOE) Operations Security (OPSEC) Program. Cancels DOE O 5632.3B. Canceled by DOE O 471.2 of 9-28-1995.
Supervisory Operations Research Analyst
Broader source: Energy.gov [DOE]
This position is located in Power Services Short-Term Planning(PGSP), Bonneville Power Administration. Short Term Planning provides hydraulic operations strategies to achieve power and non-power...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2010-06-29
This Order defines the requirements for establishing and implementing Conduct of Operations Programs at Department of Energy (DOE), including National Nuclear Security Administration (NNSA), facilities and projects. Cancels DOE O 5480.19. Admin Chg 1, 6-25-13
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2010-06-29
This Order defines the requirements for establishing and implementing Conduct of Operations Programs at Department of Energy (DOE), including National Nuclear Security Administration (NNSA), facilities and projects. Admin Chg 2, dated 12-3-14, supersedes Admin Chg 1.
Paxton, Blaine Kermit
2004-01-01
Dell, Inc. is well known for its dramatic and continually improving operational performance in terms of unit cost, inventory level, production capacity, and labor efficiency. However, in late 2002, several members of Dell's ...
NONE
1997-10-01
This document is the first edition of Argonne`s new Operating Plan. The Operating Plan complements the strategic planning in the Laboratory`s Institutional Plan by focusing on activities that are being pursued in the immediate fiscal year, FY 1998. It reflects planning that has been done to date, and it will serve in the future as a resource and a benchmark for understanding the Laboratory`s performance. The heart of the Institutional Plan is the set of major research initiatives that the Laboratory is proposing to implement in future years. In contrast, this Operating Plan focuses on Argonne`s ongoing R&D programs, along with cost-saving measures and other improvements being implemented in Laboratory support operations.
Cogeneration Operational Issues
Williams, M.
1985-01-01
important, however, are the operational Issues which impact the utility and the cogenerator. This paper addresses the utility perspective in regard to possible impact of cogeneration systems on utility service to other customer, safety and substation...
Operational Waste Volume Projection
STRODE, J.N.
2000-08-28
Waste receipts to the double-shell tank system are analyzed and wastes through the year 2015 are projected based on generation trends of the past 12 months. A computer simulation of site operations is performed, which results in projections of tank fill schedules, tank transfers, evaporator operations, tank retrieval, and aging waste tank usage. This projection incorporates current budget planning and the clean-up schedule of the Tri-Party Agreement. Assumptions were current as of June. 2000.
Operational Waste Volume Projection
STRODE, J.N.
1999-08-24
Waste receipts to the double-shell tank system are analyzed and wastes through the year 2018 are projected based on assumption as of July 1999. A computer simulation of site operations is performed, which results in projections of tank fill schedules, tank transfers, evaporator operations, tank retrieval, and aging waste tank usage. This projection incorporates current budget planning and the clean-up schedule of the Tri-Party Agreement.
Generators of KMS Symmetric Markov Semigroups on B(h) Symmetry and Quantum Detailed Balance
F. Fagnola; V. Umanitá
2009-08-06
We find the structure of generators of norm continuous quantum Markov semigroups on B(h) that are symmetric with respect to the scalar product tr(\\rho^{1/2}x\\rho^{1/2}y) induced by a faithful normal invariant state invariant state \\rho and satisfy two quantum generalisations of the classical detailed balance condition related with this non-commutative notion of symmetry: the so-called standard detailed balance condition and the standard detailed balance condition with an antiunitary time reversal.
Surviving Operation Desert Storm
Vice, J. (Booz, Allen and Hamilton, Inc., Dayton, OH (United States))
1992-08-01
The importance of aircraft survivability during the invasion of Iraq is examined detailing anecdotal evidence of susceptibility and vulnerability reduction. Among the aircraft used that were designed to be more survivable than their predecessors were the F-117, A-10, F/A-18, and the AH-64. Reduced vulnerability is incorporated into the aircraft designs in the form of damage tolerant components, redundancy, self-sealing fluid systems, and miniaturization.
Abdoun, Otman; Abouchabka, Jaafar
2012-01-01
In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM. The efficiency of the HPRM is compared as against some existing mutation operators; namely, Reverse Sequence Mutation (RSM) and Partial Shuffle Mutation (PSM) for BERLIN52 as instance of TSPLIB. Experimental results show that the new mutation operator is better than the RSM and PSM.
Benchmarking Derivative-Free Optimization Algorithms
2008-05-13
has encouraged a new wave of theory and algorithms. ... the solver that delivers the largest reduction within a given computational budget. ..... cost per iteration. ..... expensive optimization problems that arise in DOE's SciDAC initiative.
A modified convective/stratiform partitioning algorithm
Listemaa, Steven Alan
1998-01-01
by using different radar reflectivity-rail-ate relationships. Several authors have developed their own convective-stratiform partitioning, but each had its limitations. An algorithm has been developed which partitions precipitating systems...
Large scale prediction models and algorithms
Monsch, Matthieu (Matthieu Frederic)
2013-01-01
Over 90% of the data available across the world has been produced over the last two years, and the trend is increasing. It has therefore become paramount to develop algorithms which are able to scale to very high dimensions. ...
An algorithmic approach to social networks
Liben-Nowell, David
2005-01-01
Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze ...
A Saturation Algorithm for Homogeneous Binomial Ideals
Mehta, Shashank K
A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian at computation in smaller rings is by Kesh and Mehta [7] which also requires the computation of one Gr
Greedy Algorithms Slides by Kevin Wayne.
Kosecka, Jana
. telephone, electrical, hydraulic, TV cable, computer, road Approximation algorithms for NP-hard problems. At each step, add the cheapest edge e to T that has exactly one endpoint in T. Remark. All three