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-20T23:59:59.000Z
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.
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 and analysis of large time step operator splitting algorithms for the numerical simulation of multiphase flow the main ideas behind these novel operator splitting algorithms for a basic twophase flow model. Special
NONE
1995-09-01T23:59:59.000Z
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 2 provides the complete set of the Detail Design drawings along with a listing of the drawings. Once approved by WHC, these drawings will be issued and baselined for the Title 3 construction effort.
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41cloth Documentation DataDepartment of EnergyOn-Farm1 of 62.1 Print NationalFive-MonthProspects andBernard8 Best
Operating Range Comments Details on page 149 Curve of constant assigned power rating
Ida, Nathan
. permissible winding temperature +100°C Weight of motor 0.35 g 8 pole permanent magnet 3 phased coil stator winding temperature will be reached during continuous oper- ation at 25°C ambient. = Thermal limit. Short term operation The motor may be briefly overloaded (recurring). Motor with high resistance winding
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 ...
NONE
1995-09-01T23:59:59.000Z
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.
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 of Agricultural and Biosystems Engineering University of Puerto Rico at Mayagüez harmsen1000@hotmail.com In this study an operational water and energy balance algorithm for Puerto Rico (GOES- PRWEB) was developed
Solid Waste Operations Complex W-113, Detail Design Report (Title II). Volume 3: Specifications
NONE
1995-09-01T23:59:59.000Z
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-30T23:59:59.000Z
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-01T23:59:59.000Z
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.
Operated device estimation framework
Rengarajan, Janarthanan
2009-05-15T23:59:59.000Z
protective device estimation algorithm which helps in identifying which protective devices have operated to clear a short circuit condition. The algorithm uses manufacturer’s device details, power quality data measured from substation monitoring devices...
A new operator splitting algorithm for elastoviscoplastic flow problems
Boyer, Edmond
cell assemblies [28, 34] display both liquid and solid mechanical properties, being simultane- ously Elastic (E), viscous (V), and plastic (P): at small deformation, such a material reversibly come back an efficient numerical algorithm based on mixed Finite Elements Methods for solving the highly nonlinear set
Decision algorithms for Unmanned Underwater Vehicles during offensive operations
Smith, Tyler B. (Tyler Bradford)
2006-01-01T23:59:59.000Z
The field of research involving autonomous vehicles has expanded greatly over the past decade. This thesis addresses the case of a system of Unmanned Underwater Vehicles (UUVs) operating in littoral areas in an offensive ...
Parameter Control Methods for Selection Operators in Genetic Algorithms
Eiben, A.E. "Guszti"
of such methods on three groups of test functions and conclude that varying se- lection pressure during a GA run largely on their parameters, such as population size, selection pressure, crossover and mutation rates size determines the selection pressure, and can thus be used to control the selection operator [11
Aoki, K. (Hiroshima Univ., Higashihiroshima (JP)); Kuwabara, H. (Kinki Univ., Kure (JP)); Satoh, T. (Hiroshima Univ., Higashihiroshima (JP)); Kanezashi, M. (Aichi Institute of Technology, Toyota (JP))
1988-10-01T23:59:59.000Z
This paper presents a systematic and practical algorithm for load balancing of transformers and feeders by automatic sectionalizing switch operation in large scale distribution systems of radial type. The algorithm is developed by extending an approximation algorithm for load transfer of desired two transformers. The algorithm proposed here is applicable to operations not only in normal state, but also in scheduled and failure outage states. Computational experience on a real large scale system has indicated that the algorithm is valid and effective for practical operations.
NONE
1995-09-01T23:59:59.000Z
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.
Quantum chaos in the spectrum of operators used in Shor's algorithm
Krishnendu Maity; Arul Lakshminarayan
2006-08-28T23:59:59.000Z
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.
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-01T23:59:59.000Z
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) | SciTech Connect Journal Article: X-ray lineARMParticipants1.1 Buildings SectorCMI SuccessScanning Probe Microscopy Art
An algorithm for improving Non-Local Means operators via low-rank approximation
Victor May; Yosi Keller; Nir Sharon; Yoel Shkolnisky
2014-11-20T23:59:59.000Z
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.
A new operator splitting algorithm for elastoviscoplastic flow problems I. Cheddadi 1
Saramito, Pierre
assemblies [28,34] display both liquid and solid mechanical properties, being simultaneously Elastic (E), viscous (V), and plastic (P): at small deformation, such a material reversibly come back to its shape an efficient numerical algorithm based on mixed Finite Elements Methods for solving the highly nonlinear set
NUMERICAL SOLUTION OF RESERVOIR FLOW MODELS BASED ON LARGE TIME STEP OPERATOR SPLITTING ALGORITHMS
processes. A black-oil model is commonly used to describe water injection. This model works well. Special focus is posed on the numerical solution algorithms for the saturation equation, which is a convection dominated, degenerate convection-di#11;usion equation. Both theory and applications are discussed
Michele Mosca
2008-08-04T23:59:59.000Z
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.
Shi, Cong, Ph.D. Massachusetts Institute of Technology
2012-01-01T23:59:59.000Z
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 ...
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
Anagnostakis, Ioannis
2004-01-01T23:59:59.000Z
(cont.) to the design of a heuristic decomposed algorithm for solving the ROP problem. This decomposition methodology offers an original paradigm potentially applicable to the design of solution algorithms for a class of ...
Mittal, Shashi, Ph. D. Massachusetts Institute of Technology
2011-01-01T23:59:59.000Z
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 ...
on the complexity of some hierarchical structured matrix algorithms
2012-05-17T23:59:59.000Z
matrix algorithms, in terms of hierarchically semiseparable (HSS) matrices. ... We perform detailed complexity analysis for some typical HSS algorithms, with.
Detailed balance and entanglement
Rocco Duvenhage; Machiel Snyman
2015-03-27T23:59:59.000Z
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.
Annual Energy Outlook 2013 [U.S. Energy Information Administration (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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318Cubic Feet) YearSalesNew FieldDetailed Tables To download all 1992 detailed tables:
Markov Chain Monte Carlo Method without Detailed Balance
Hidemaro Suwa; Synge Todo
2010-10-13T23:59:59.000Z
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.
Solving radiative transfer with line overlaps using Gauss Seidel algorithms
F. Daniel; J. Cernicharo
2008-07-11T23:59:59.000Z
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.
Parallel matrix transpose algorithms on distributed memory concurrent computers
Choi, J.; Walker, D.W. [Oak Ridge National Lab., TN (United States); Dongarra, J.J. [Oak Ridge National Lab., TN (United States); [Univ. of Tennessee, Knoxville, TN (United States). Dept. of Computer Science
1993-10-01T23:59:59.000Z
This paper describes parallel matrix transpose algorithms on distributed memory concurrent processors. It is assumed that the matrix is distributed over a P x Q processor template with a block scattered data distribution. P, Q, and the block size can be arbitrary, so the algorithms have wide applicability. The communication schemes of the algorithms are determined by the greatest common divisor (GCD) of P and Q. If P and Q are relatively prime, the matrix transpose algorithm involves complete exchange communication. If P and Q are not relatively prime, processors are divided into GCD groups and the communication operations are overlapped for different groups of processors. Processors transpose GCD wrapped diagonal blocks simultaneously, and the matrix can be transposed with LCM/GCD steps, where LCM is the least common multiple of P and Q. The algorithms make use of non-blocking, point-to-point communication between processors. The use of nonblocking communication allows a processor to overlap the messages that it sends to different processors, thereby avoiding unnecessary synchronization. Combined with the matrix multiplication routine, C = A{center_dot}B, the algorithms are used to compute parallel multiplications of transposed matrices, C = A{sup T}{center_dot}B{sup T}, in the PUMMA package. Details of the parallel implementation of the algorithms are given, and results are presented for runs on the Intel Touchstone Delta computer.
2003 CBECS Detailed Tables: Summary
U.S. Energy Information Administration (EIA) Indexed Site
lower than earlier surveys since the 2003 figures do not include mall buildings. See "Change in Data Collection Procedures for Malls" for a more detailed explanation. Tables A1...
Thirty Meter Telescope Detailed Science Case: 2015
Skidmore, Warren; Fukugawa, Misato; Goswami, Aruna; Hao, Lei; Jewitt, David; Laughlin, Greg; Steidel, Charles; Hickson, Paul; Simard, Luc; Schöck, Matthias; Treu, Tommaso; Cohen, Judith; Anupama, G C; Dickinson, Mark; Harrison, Fiona; Kodama, Tadayuki; Lu, Jessica R; Macintosh, Bruce; Malkan, Matt; Mao, Shude; Narita, Norio; Sekiguchi, Tomohiko; Subramaniam, Annapurni; Tanaka, Masaomi; Tian, Feng; A'Hearn, Michael; Akiyama, Masayuki; Ali, Babar; Aoki, Wako; Bagchi, Manjari; Barth, Aaron; Bhalerao, Varun; Bradac, Marusa; Bullock, James; Burgasser, Adam J; Chapman, Scott; Chary, Ranga-Ram; Chiba, Masashi; Cooray, Asantha; Crossfield, Ian; Currie, Thayne; Das, Mousumi; Dewangan, G C; de Grijs, Richard; Do, Tuan; Dong, Subo; Evslin, Jarah; Fang, Taotao; Fang, Xuan; Fassnacht, Christopher; Fletcher, Leigh; Gaidos, Eric; Gal, Roy; Ghez, Andrea; Giavalisco, Mauro; Grady, Carol A; Greathouse, Thomas; Gogoi, Rupjyoti; Guhathakurta, Puragra; Ho, Luis; Hasan, Priya; Herczeg, Gregory J; Honda, Mitsuhiko; Imanishi, Masa; Inanmi, Hanae; Iye, Masanori; Kamath, U S; Kane, Stephen; Kashikawa, Nobunari; Kasliwal, Mansi; Kirby, Vishal KasliwalEvan; Konopacky, Quinn M; Lepine, Sebastien; Li, Di; Li, Jianyang; Liu, Junjun; Liu, Michael C; Lopez-Rodriguez, Enrigue; Lotz, Jennifer; Lubin, Philip; Macri, Lucas; Maeda, Keiichi; Marchis, Franck; Marois, Christian; Marscher, Alan; Martin, Crystal; Matsuo, Taro; Max, Claire; McConnachie, Alan; McGough, Stacy; Melis, Carl; Meyer, Leo; Mumma, Michael; Muto, Takayuki; Nagao, Tohru; Najita, Joan R; Navarro, Julio; Pierce, Michael; Prochaska, Jason X; Oguri, Masamune; Ojha, Devendra K; Okamoto, Yoshiko K; Orton, Glenn; Otarola, Angel; Ouchi, Masami; Packham, Chris; Padgett, Deborah L; Pandey, Shashi Bhushan; Pilachowsky, Catherine; Pontoppidan, Klaus M; Primack, Joel; Puthiyaveettil, Shalima; Ramirez-Ruiz, Enrico; Reddy, Naveen; Rich, Michael; Richter, Matthew J; Schombert, James; Sen, Anjan Ananda; Shi, Jianrong; Sheth, Kartik; Srianand, R; Tan, Jonathan C; Tanaka, Masayuki; Tanner, Angelle; Tominaga, Nozomu; Tytler, David; U, Vivian; Wang, Lingzhi; Wang, Xiaofeng; Wang, Yiping; Wilson, Gillian; Wright, Shelley; Wu, Chao; Wu, Xufeng; Xu, Renxin; Yamada, Toru; Yang, Bin; Zhao, Gongbo; Zhao, Hongsheng
2015-01-01T23:59:59.000Z
The TMT Detailed Science Case describes the transformational science that the Thirty Meter Telescope will enable. Planned to begin science operations in 2024, TMT will open up opportunities for revolutionary discoveries in essentially every field of astronomy, astrophysics and cosmology, seeing much fainter objects much more clearly than existing telescopes. Per this capability, TMT's science agenda fills all of space and time, from nearby comets and asteroids, to exoplanets, to the most distant galaxies, and all the way back to the very first sources of light in the Universe. More than 150 astronomers from within the TMT partnership and beyond offered input in compiling the new 2015 Detailed Science Case. The contributing astronomers represent the entire TMT partnership, including the California Institute of Technology (Caltech), the Indian Institute of Astrophysics (IIA), the National Astronomical Observatories of the Chinese Academy of Sciences (NAOC), the National Astronomical Observatory of Japan (NAOJ),...
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01T23:59:59.000Z
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
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
Improving alternative fuel utilization: detailed kinetic combustion...
Improving alternative fuel utilization: detailed kinetic combustion modeling & experimental testing Improving alternative fuel utilization: detailed kinetic combustion modeling &...
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
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
Topics in Approximation Algorithms
Khare, Monik
2012-01-01T23:59:59.000Z
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
An algorithm for minimization of quantum cost
Anindita Banerjee; Anirban Pathak
2010-04-09T23:59:59.000Z
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.
Nikolova, Evdokia Velinova
2009-01-01T23:59:59.000Z
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 ...
Operations and Maintenance Manual for Large Aperture Scanner System
Jones, Anthony M.; Hall, Thomas E.
2010-04-08T23:59:59.000Z
Operations and maintenance manual includes detailed instructions for system assembly, use, and maintenance.
Improvements of the local bosonic algorithm
B. Jegerlehner
1996-12-15T23:59:59.000Z
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.
Ancillary service details: Voltage control
Kirby, B.; Hirst, E.
1997-12-01T23:59:59.000Z
Voltage control is accomplished by managing reactive power on an alternating-current power system. Reactive power can be produced and absorbed by both generation and transmission equipment. Reactive-power devices differ substantially in the magnitude and speed of response and in their capital costs. System operators, transmission owners, generators, customers, power marketers, and government regulators need to pay close attention to voltage control as they restructure the U.S. electricity industry. Voltage control can affect reliability and commerce in three ways: (1) Voltages must be maintained within an acceptable range for both customer and power-system equipment to function properly. (2) The movement of reactive power consumes transmission resources, which limits the ability to move real power and worsens congestion. (3) The movement of reactive power results in real-power losses. When generators are required to supply excessive amounts of reactive power, their real-power production must be curtailed. These opportunity costs are not currently compensated for in most regions. Current tariffs are based on embedded costs. These embedded-cost tariffs average about $0.51/MWh, equivalent to $1.5 billion annually for the United States as a whole. Although this cost is low when compared with the cost of energy, it still aggregates to a significant amount of money. This report takes a basic look at why the power system requires reactive power (an appendix explains the fundamentals of real and reactive power). The report then examines the various types of generation and transmission resources used to supply reactive power and to control voltage. Finally it discusses how these resources are deployed and paid for in several reliability regions around the country. As the U.S. electricity industry is restructured, the generation, transmission, and system-control equipment and functions that maintain voltages within the appropriate ranges are being deintegrated.
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;
Simulation levels of detail for plant motion
Beaudoin, Jacob Michael
2013-02-22T23:59:59.000Z
In this paper we describe a method for simulating motion of realistically complex plants interactively. We use a precomputation stage to generate the plant structure, along with a set of simulation levels of detail. The levels of detail are made...
Beyond bolts : architectural details, construction, meaning
Weber, Peter Dominic
1991-01-01T23:59:59.000Z
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. ...
Improving alternative fuel utilization: detailed kinetic combustion...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Improving alternative fuel utilization: detailed kinetic combustion modeling & experimental testing Salvador Aceves, Daniel Flowers, Bill Pitz, Charlie Westbrook, Emma Silke,...
BISICLES Captures Details of Retreating Antarctic Ice
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
part by the SciDAC FASTMath (Frameworks, Algorithms, and Scalable Technologies for Mathematics) Institute. More information: http:crd.lbl.govgroups-deptsANAGresearch...
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
EVALUATING CLOUD RETRIEVAL ALGORITHMS WITH THE ARM BBHRP FRAMEWORK
EVALUATING CLOUD RETRIEVAL ALGORITHMS WITH THE ARM BBHRP FRAMEWORK E. Mlawer, T. Shippert, K. L closure analyses has been the evaluation of cloud microphysical retrieval algorithms. This evaluation for modeling studies. This poster details the continued effort to evaluate cloud property retrieval algorithms
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-11T23:59:59.000Z
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.
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
Quantum Chaos and Quantum Algorithms
Daniel Braun
2001-10-05T23:59:59.000Z
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.
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01T23:59:59.000Z
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-01T23:59:59.000Z
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-01T23:59:59.000Z
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Resource analysis of the quantum linear system algorithm
Artur Scherer; Benoît Valiron; Siun-Chuon Mau; Scott Alexander; Eric van den Berg; Thomas E. Chapuran
2015-05-25T23:59:59.000Z
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described generalization [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order $10^{25}$ if oracle costs are excluded, and a circuit width and depth of order $10^8$ and $10^{29}$, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.
Data-flow algorithms for parallel matrix computations
O'Leary, D.P.; Stewart, G.W.
1985-08-01T23:59:59.000Z
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.
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
Horava-Lifshitz gravity with detailed balance
Daniele Vernieri; Thomas P. Sotiriou
2012-12-18T23:59:59.000Z
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
Optimisation of Quantum Evolution Algorithms
Apoorva Patel
2015-03-04T23:59:59.000Z
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.
Optimisation of Quantum Evolution Algorithms
Patel, Apoorva
2015-01-01T23:59:59.000Z
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.
A Faster Primal Network Simplex Algorithm
Aggarwal, Charu C.
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...
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
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
Algorithms and tools for high-throughput geometry-based analysis...
Office of Scientific and Technical Information (OSTI)
Algorithms and tools for high-throughput geometry-based analysis of crystalline porous materials Citation Details In-Document Search Title: Algorithms and tools for high-throughput...
HIGH DETAIL STATIONARY OPTIMIZATION MODELS FOR GAS ...
2014-11-26T23:59:59.000Z
linear physics, major gas network operators in Germany and Europe face hard ..... This is a natural approach since our industrial partners rely on the same ...
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...
SciTech Connect: Matrix multiplication operations with datapre...
Office of Scientific and Technical Information (OSTI)
Matrix multiplication operations with data pre-conditioning in a high performance computing architecture Citation Details In-Document Search Title: Matrix multiplication operations...
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;
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01T23:59:59.000Z
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
Cooling algorithms based on the 3-bit majority
Phillip Kaye
2007-05-15T23:59:59.000Z
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.
Business Management BA / MA (Hons) Key details
Painter, Kevin
Operations Management l Market Research Analysis l Social Entrepreneurship l Production Management l Quality Management, Operations Management, Commercial Law, Organisational Behaviour, Statistics and Quantitative Management at Heriot-Watt University in Dubai? l High quality British degree programme l Enhance your career
Occurrence Reporting and Processing of Operations Information
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1995-09-25T23:59:59.000Z
This Manual provides detailed requirements to supplement DOE O 232.1, Occurrence Reporting and Processing of Operations Information. Chg 1 dated 8-12-96.
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
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
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 and services, and producing the enabling technology and know-how for a sustainable future. Chemical
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
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
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
Tripol condensate polishing - operational experience
Swainsbury, D. [Mission Energy Management Australia, Victoria (Australia)
1995-01-01T23:59:59.000Z
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.
Five Quantum Algorithms Using Quipper
Safat Siddiqui; Mohammed Jahirul Islam; Omar Shehab
2014-06-18T23:59:59.000Z
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \\ensuremath{4 \\times 4} matrix constructors for Unitary operators, we have also implemented \\ensuremath{8 \\times 8} and \\ensuremath{16 \\times 16} matrix constructors.
Installing and operating FEGTEMs
Hetherington, C.J.; Cullis, A.G.; Walker, S.; Turner, J.; Nelson, E.C.; O'Keefe, M.A.
1997-11-03T23:59:59.000Z
In order to operate at full potential, Field-Emission-Gun Transmission Electron Microscopes (FEG-TEMs) require special environments designed to minimize the effects of vibration and electromagnetic noise. This report shows how careful attention to these details can enable such instruments to achieve their design parameters and produce information transfer to sub-Angstrom resolutions.
High performance parallel algorithms for incompressible flows
Sambavaram, Sreekanth Reddy
2002-01-01T23:59:59.000Z
innovative algorithms using solenoidal basis methods to solve the generalized Stokes problem for 3D MAC (Marker and Cell) and 2D unstructured P1-isoP1 finite element grids. It details a localized algebraic approach to construct solenoidal basis. An efficient...
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
Detailed balance in Horava-Lifshitz gravity
Gianluca Calcagni
2010-02-04T23:59:59.000Z
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.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5(Million Cubic Feet) Oregon (Including Vehicle Fuel) (MillionStructural Basis of5,:,, , ., ..., at the1-6522supercomputing |fragmenttech details
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Rates Operations & Maintenance Operations OASIS: WACM (Note: this site is not hosted by Western and requires a digital certificate and login for full access.) wesTTrans Common...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Operations and Maintenance Operations OASIS: OATI (Note: this site is not hosted by Western and requires a digital certificate and login for full access.) Contact Information...
CBECS 1992 - Consumption & Expenditures, Detailed Tables
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National and Regional Data; Row: NAICS Codes; Column:3,2,19,30,"BANGOR HYDRO ELECTRICTables and Spreadsheets 1991A 6Feet) Year7 0164Detailed 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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaiiEnergyFlorida July 9, 2009TweetREMEDIATE ANDFinancialDetailed Look at RNA
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaiiEnergyFlorida July 9, 2009TweetREMEDIATE ANDFinancialDetailed Look at
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaiiEnergyFlorida July 9, 2009TweetREMEDIATE ANDFinancialDetailed Look atFirst
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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaiiEnergyFlorida July 9, 2009TweetREMEDIATE ANDFinancialDetailed Look
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01T23:59:59.000Z
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
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
Straub, John E.
Generalized simulated annealing algorithms using Tsallis statistics: Application to conformational, Boston, Massachusetts 02215 Received 18 December 1995 A Monte Carlo simulated annealing algorithm based on the generalized entropy of Tsallis is presented. The algorithm obeys detailed balance and reduces to a steepest
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
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
New details on nuclear weapons program bared
Hileman, B.
1994-07-11T23:59:59.000Z
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-18T23:59:59.000Z
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.
San Joaquin-Tulare Conjunctive Use Model: Detailed model description
Quinn, N.W.T.
1992-03-01T23:59:59.000Z
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.
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01T23:59:59.000Z
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Reconstruction algorithms for MRI
Bilgic?, Berkin
2013-01-01T23:59:59.000Z
This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...
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 ...
Sustaining Operational Efficiency of a CHP System
Katipamula, Srinivas; Brambley, Michael R.
2010-01-04T23:59:59.000Z
This chapter provides background information on why sustaining operations of combined cooling, heating and power systems is important, provides the algorithms for CHP system performance monitoring and commissioning verification, and concludes with a discussion on how these algorithms can be deployed.
Atomic detail brownian dynamics simulations of concentrated protein...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
detail brownian dynamics simulations of concentrated protein solutions with a mean field treatment of hydrodynamic Atomic detail brownian dynamics simulations of concentrated...
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...
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...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01T23:59:59.000Z
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-01T23:59:59.000Z
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
Fourth-order diffusion Monte Carlo algorithms for solving quantum many-body problems
Forbert, HA; Chin, Siu A.
2001-01-01T23:59:59.000Z
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 algorithms require...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Giorda, Paolo [Institute for Scientific Interchange, Villa Gualino Viale Settimio Severo 65, 10133 Turin (Italy); Iorio, Alfredo [Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307 (United States); INFN, Rome (Italy); Sen, Samik [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); Sen, Siddhartha [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); IACS, Jadavpur, Calcutta 700032 (India)
2004-09-01T23:59:59.000Z
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-(1/2) SU(2) generalized coherent states. Surprisingly, we find evidence that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.
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-22T23:59:59.000Z
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.
Detailed model for practical pulverized coal furnaces and gasifiers
Philips, S.D.; Smoot, L.D.
1989-08-01T23:59:59.000Z
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.
Shivakumar, R
2010-01-01T23:59:59.000Z
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...
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07T23:59:59.000Z
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).
Planning and scheduling proximity operations for autonomous orbital rendezvous
Guerra, Christopher J., 1978-
2003-01-01T23:59:59.000Z
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, ...
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
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
Brambley, Michael R.; Katipamula, Srinivas
2006-10-06T23:59:59.000Z
Pacific Northwest National Laboratory (PNNL) is assisting the U.S. Department of Energy (DOE) Distributed Energy (DE) Program by developing advanced control algorithms that would lead to development of tools to enhance performance and reliability, and reduce emissions of distributed energy technologies, including combined heat and power technologies. This report documents phase 2 of the program, providing a detailed functional specification for algorithms for performance monitoring and commissioning verification, scheduled for development in FY 2006. The report identifies the systems for which algorithms will be developed, the specific functions of each algorithm, metrics which the algorithms will output, and inputs required by each algorithm.
Nonlinear Transformations and Filtering Theory for Space Operations
Weisman, Ryan Michael 1984-
2012-11-19T23:59:59.000Z
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...
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21T23:59:59.000Z
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-03T23:59:59.000Z
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.
External-Memory Algorithms with Applications in GIS -(L. Arge)
de Figueiredo, Luiz Henrique
External-Memory Algorithms with Applications in GIS - (L. Arge) Enylton Machado Roberto Beauclair Algorithms · GIS Thematic Maps stored as layers · geometric: roads, cities, etc. · abstract: population are abstractions of important GIS operation. #12;GIS · Map overlaying problems: Line-Breaking: computing
Developing Geospatial Intelligence Stewardship for Multinational Operations
Thomas, Jeff
2009-11-18T23:59:59.000Z
, Directs reachback analysis – Improved Situational Awareness/Understanding – Greater Common Operational Picture Survey • A detailed survey to a broad multinational audience consisting of Joint, Interagency, Intergovernmental, Multinational, Industry...Developing Geospatial Intelligence Stewardship for Multinational Operations Jeff Thomas, BA, MPPA, MS Major, US Army Corps of Engineers Student, Space Operations US Army Command & General Staff College Fort Leavenworth, Kansas GIS Day @ KU Nov 18...
Trajectory-switching algorithm for a MEMS gyroscope
Park, Sungsu; Horowitz, Roberto; Hong, Sung Kyung; Nam, Yoonsu
2007-01-01T23:59:59.000Z
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
A resource allocation algorithm for wide area search ammunitions
Rathinam, Sivakumar
2001-01-01T23:59:59.000Z
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...
A resource allocation algorithm for wide area search ammunitions
Rathinam, Sivakumar
2001-01-01T23:59:59.000Z
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...
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
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
Agrawal, Manindra
Introduction Two Applications Basic Operations Tools Overview of the Tools A Survey of Techniques and IIT Kanpur Kunming Tutorial, May 2005 #12;Introduction Two Applications Basic Operations Tools Cryptography Application: RSA Cryptosystem Complexity of Basic Operations Tools for Designing Algorithms
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, ...
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-31T23:59:59.000Z
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%.
Multi-unit operations considerations.
Gilmore, Walter E. (Los Alamos National Laboratory, Los Alamos, NM); Bennett, Thomas C. (Lawrence Livermore National Laboratory, Albuquerque, NM); Brannon, Nathan Gregory
2005-09-01T23:59:59.000Z
Several nuclear weapons programs have or are pursuing the implementation of multi-unit operations for tasks such as disassembly and inspection, and rebuild. A multi-unit operation is interpreted to mean the execution of nuclear explosive operating procedures in a single facility by two separate teams of technicians. The institution of a multi-unit operations program requires careful consideration of the tools, resources, and environment provided to the technicians carrying out the work. Therefore, a systematic approach is necessary to produce safe, secure, and reliable processes. In order to facilitate development of a more comprehensive multi-unit operations program, the current work details categorized issues that should be addressed prior to the implementation of multi-unit operations in a given weapons program. The issues have been organized into the following categories: local organizational conditions, work process flow/material handling/workplace configuration, ambient environmental conditions, documented safety analysis, and training.
Equipment Operational Requirements
Greenwalt, B; Henderer, B; Hibbard, W; Mercer, M
2009-06-11T23:59:59.000Z
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.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1997-03-28T23:59:59.000Z
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.
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
Design Optimization and Performance Evaluation of the Relaying Algorithms, Relays and Protective quality measures for designing, optimizing, setting and evaluating the protective relaying algorithms the performance indices for the operating principles, relays and protection systems. Multi-objective formal
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01T23:59:59.000Z
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
Gas characterization system operation, maintenance, and calibration plan
Tate, D.D.
1996-03-04T23:59:59.000Z
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.
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
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21T23:59:59.000Z
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01T23:59:59.000Z
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
Parallelism of the SANDstorm hash algorithm.
Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree
2009-09-01T23:59:59.000Z
Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) |govInstrumentsmfrirtA Journey Inside the Complex(MARSSIM) Site TheTechnical30 2.436OperationalOperations Videos
Perceptual learning of context-sensitive phonetic detail
Barden, Katharine
2011-07-12T23:59:59.000Z
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-01T23:59:59.000Z
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-14T23:59:59.000Z
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.
Details, details...The impact of market rules on emerging ``green'' energy markets
Wiser, R.H.; Pickle, S.J.; Eto, J.H.
1998-07-01T23:59:59.000Z
Green power marketing is creating a customer-driven market for renewable energy resources, including solar, wind, geothermal, biomass, and hydropower. Yet there are a number of market barriers to the creation of a workable green power market, and the ultimate success of retail markets for green power products will depend critically on the detailed market rules established at the onset of restructuring and on a number of market facilitation efforts. By surveying green power marketers and reviewing regulatory filings, this paper identifies and analyzes the types of restructuring market rules and market facilitation efforts that impact the competitive market for electricity services broadly, and the retail market for green power specifically. Taking a marketer perspective as the point of reference, they emphasize those rules and efforts that most effectively target key market barriers and that might be most successful in expanding the market for retail green power products. This information should help those interested in encouraging the development of the green power market during the early years of electricity restructuring.
Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems
Van Benthem, Mark H. (Middletown, DE); Keenan, Michael R. (Albuquerque, NM)
2008-11-11T23:59:59.000Z
A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.
Pumped Storage Hydropower (Detailed Analysis to Demonstrate Value...
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Pumped Storage Hydropower (Detailed Analysis to Demonstrate Value)-Modeling and Analysis of Value of Advanced Pumped Storage Hydropower in the U.S. Pumped Storage Hydropower...
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...
INFILTRATION - PRESSURIZATION CORRELATIONS: DETAILED MEASUREMENT ON A CALIFORNIA HOUSE
Grimsrud, D.T.
2011-01-01T23:59:59.000Z
Systems. Abstract Infiltration studies have been carried outThis paper describes infiltration studies in a single-familyreported a detailed study of infiltration rates measured
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...
New Argonne initiative to examine the details of the combustion...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Argonne initiative to examine the details of the combustion process By Jared Sagoff * July 15, 2014 Tweet EmailPrint ARGONNE, Ill. - Every science experiment and every mathematical...
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...
Total Recall: Detailing Nitinol's Shape-Memory Behavior | The...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Total Recall: Detailing Nitinol's Shape-Memory Behavior The first complete atomic-scale view of the structural transformations responsible for the Nitinol's shape-memory ability...
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
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
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
BUILDING SURROGATE MODELS BASED ON DETAILED AND APPROXIMATE SIMULATIONS
Seepersad, Carolyn Conner
- Page 1 - BUILDING SURROGATE MODELS BASED ON DETAILED AND APPROXIMATE SIMULATIONS Zhiguang Qian is taken to integrate data from approximate and detailed simulations to build a surrogate model approximate simulations form the bulk of the data, and they are used to build a model based on a Gaussian
A DETAILLED WEATHER DATA GENERATOR FOR BUILDINGS SIMULATION
Paris-Sud XI, Université de
A DETAILLED WEATHER DATA GENERATOR FOR BUILDINGS SIMULATION L. ADELARD*, H. BOYER, F. GARDE, J@iremia.univ-reunion.fr Abstract Thermal buildings simulation softwares need meteorological files in thermal comfort, energetic@iremia.univ-reunion.fr #12;1 A DETAILLED WEATHER DATA GENERATOR FOR BUILDINGS SIMULATION L. Adelard*, H. Boyer, F. Garde, J
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
Structure of Partially Premixed Flames Using Detailed Chemistry Simulations
Kluzek, Celine D.
2010-10-12T23:59:59.000Z
, and the attendant effects on a number of species. Using the detailed analysis of different reaction rates, the adiabatic and radiative nitric oxide concentrations are compared. The cross-transport effects, i.e. Soret and Dufour, were studied in detail. The Soret...
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
Pruvost, N.; Tsitouras, J.
1981-03-18T23:59:59.000Z
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.
Ricci, Laura
D in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithmsIntroduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Epidemic 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-01T23:59:59.000Z
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.
Chang, Wen-Long
1991-01-01T23:59:59.000Z
&. complexity is reduced to the logarithmic time O(lory&7llog&'l&1). Tllls algoi'itlnn and iirchite&ture is iiell suited to real-tinip applications which clearly &&quire highly parallel solutions. 'vVe detail loiv le&&1 liardware details suit able for &ustoni... 4'I, SI applications. 1&ut thc algorithms themselves are also amenable to some general parallel processor machines. The third algorithm presente&l in Chapter V is the decoding line algorithin. The clecoding line algorithm has the same order...
New algorithms and new results for strong coupling LQCD
Wolfgang Unger; Philippe de Forcrand
2012-11-30T23:59:59.000Z
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.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5(Million Cubic Feet) Oregon (Including Vehicle Fuel) (Million Cubic Feet) NaturalOctober OctoberResolved: Pathscale/4.0.9LA-UR-14-26830Operations
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) | SciTech Connect Journal Article: X-rayContract DocumentsofDioxideNotesthis site Â» Open Government OpenOperational
Lin, J.; Bartal, Y.; Uhrig, R.E.
1995-03-01T23:59:59.000Z
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.
A Note on Perturbation Results for Learning Empirical Operators
De Vito, Ernesto
2008-08-19T23:59:59.000Z
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eigenfunctions of operators defined by a ...
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
The detailed proposal for ECN and IP: K. K. Ramakrishnan,
Floyd, Sally
#12;Details of ECN and IP: The IPv4 TOS byte is currently defined as follows. This byte is under +-----+-----+-----+-----+-----+-----+-----+-----+ | PRECEDENCE | TOS | | +-----+-----+-----+-----+-----+-----+-----+-----+ 2 #12;Our proposal is as follows: 0 1
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...
Deduction, Ordering, and Operations in Quantum Logic
Norman D. Megill; Mladen Pavicic
2001-08-16T23:59:59.000Z
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.
The effect of network detail on traffic assignment
Long, Gary Don
1968-01-01T23:59:59.000Z
exceed the actual separation on the ground. Thus, with the coded networks common1y used, severs!. city blocks are appropri. ately aggregated to form a single zone. The zone centroid is connected to the network in a manner consistent with the physical... these facil- ities and underloading the arterials and collectors. CHAPTER II I NETWORK AS SIGNHENT Detailed Network The initial assignr, . ent of the detailed network resulted in con- siderable disagreement between assigned volumes and ground counts...
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02T23:59:59.000Z
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.
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
Genetic Algorithms Artificial Life
Forrest, Stephanie
systems tremendously. Likewise, evolution of artificial systems is an important component of artificial) are currently the most promi nent and widely used models of evolution in artificiallife systems. GAs have beenGenetic Algorithms and Artificial Life Melanie Mitchell Santa Fe Institute 1660 Old Pecos Tr
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
Efficient scalable algorithms for hierarchically semiseparable matrices
Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de
2011-09-14T23:59:59.000Z
Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the #12;ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the #12;first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01T23:59:59.000Z
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-01T23:59:59.000Z
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23T23:59:59.000Z
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
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02T23:59:59.000Z
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.
High Detail Stationary Optimization Models for Gas Networks
Martin Schmidt
2014-10-15T23:59:59.000Z
Oct 15, 2014 ... Abstract: Due to strict regulatory rules in combination with complex nonlinear physics, major gas network operators in Germany and Europe ...
Tomasz Plawski, J. Hovater
2010-09-01T23:59:59.000Z
A digital low level radio frequency (RF) system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA, and finally a transmitting DAC. This universal platform opens up the possibilities for a variety of control algorithm implementations. The foremost concern for an RF control system is cavity field stability, and to meet the required quality of regulation, the chosen control system needs to have sufficient feedback gain. In this paper we will investigate the effectiveness of the regulation for three basic control system algorithms: I&Q (In-phase and Quadrature), Amplitude & Phase and digital SEL (Self Exciting Loop) along with the example of the Jefferson Lab 12 GeV cavity field control system.
Stability of Coupling Algorithms
Akkasale, Abhineeth
2012-07-16T23:59:59.000Z
of Committee, K. B. Nakshatrala Committee Members, Steve Suh J. N. Reddy Head of Department, Dennis O?Neal May 2011 Major Subject: Mechanical Engineering iii ABSTRACT Stability of Coupling Algorithms. (May 2011) Abhineeth Akkasale, B.E., Bangalore... step. iv To Amma and Anna v ACKNOWLEDGMENTS First and foremost, I thank Dr. Kalyana B. Nakshatrala for being an incredible advisor and for his time and patience in constantly guiding me through my research. I am indebted to him for his guidance...
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01T23:59:59.000Z
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
IBRD Operational Decision Framework
Greenwalt, R; Hibbard, W; Raber, E; Carlsen, T; Folks, K; MacQueen, D; Mancieri, S; Bunt, T; Richards, J; Hirabayashi-Dethier, J
2010-11-12T23:59:59.000Z
The IBRD Operational Decision Framework in this document is an expansion of an emerging general risk management framework under development by an interagency working group. It provides the level of detail necessary to develop a general Consequence Management Guidance Document for biological contamination remediation and restoration. It is the intent of this document to support both wide area and individual site remediation and restoration activities. This product was initiated as a portion of the IBRD Task 1 Systems Analysis to aid in identification of wide area remediation and restoration shortcomings and gaps. The draft interagency general risk management framework was used as the basis for the analysis. The initial Task 1 analysis document expanded the draft interagency framework to a higher level of resolution, building on both the logic structure and the accompanying text explanations. It was then employed in a qualitative manner to identify responsible agencies, data requirements, tool requirements, and current capabilities for each decision and task. This resulted in identifying shortcomings and gaps needing resolution. Several meetings of a joint LLNL/SNL working group reviewed and approved the initial content of this analysis. At the conclusion of Task 1, work continued on the expanded framework to generate this Operational Decision Framework which is consistent with the existing interagency general risk management framework. A large LLNL task group met repeatedly over a three-month period to develop the expanded framework, coordinate the framework with the biological remediation checklist, and synchronize the logic with the Consequence Management Plan table of contents. The expanded framework was briefed at a large table top exercise reviewing the interagency risk management framework. This exercise had representation from major US metropolitan areas as well as national agencies. This product received positive comments from the participants. Upon completion of the Operational Decision Framework, another joint LLNL/SNL working group conducted a day-long review. Identified modifications were made to the document, resulting in the included product.
Distributed algorithms for mobile ad hoc networks
Malpani, Navneet
2001-01-01T23:59:59.000Z
We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...
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
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-01T23:59:59.000Z
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
EMIS Quick User Guide Search page (details on page 2)
Barthelat, Francois
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
Methods for Detailed Energy Data Collection of Miscellaneous
94720 USA b University of California, Berkeley Berkeley, CA 94720 USA Environmental Energy Technologies primary energy consumption in the U.S., with 22% consumed by the residential sector and 18LBNL-6384E Methods for Detailed Energy Data Collection of Miscellaneous and Electronic Loads
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
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
Math 241: Fourier series: details and convergence University of Pennsylvania
DeTurck, Dennis
Math 241: Fourier series: details and convergence D. DeTurck University of Pennsylvania October 15, 2012 D. DeTurck Math 241 002 2012C: Fourier series 1 / 22 #12;Fourier series We've been using Fourier questions: Â· Do Fourier series converge? Â· What do they converge to? Do they converge to the functions we
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
Baca geothermal demonstration project. Power plant detail design document
Not Available
1981-02-01T23:59:59.000Z
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.
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
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
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
Quantum algorithm for optical template recognition with noise filtering
Gernot Schaller; Ralf Schützhold
2006-07-21T23:59:59.000Z
We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm just requires a few incident photons and is thus suitable for very sensitive pictures (similar to the Elitzur-Vaidman problem). Furthermore, for a $2^{n}\\times 2^{m}$ image, $\\ord(n+m)$ qubits are sufficient. Using the quantum Fourier transform, it is possible to improve the fault tolerance of the quantum algorithm by filtering out small-scale noise in the picture. For example images with $512\\times512$ pixels, we have numerically simulated the unitary operations in order to demonstrate the applicability of the algorithm and to analyze its fault tolerance.
Wang, Xiubin
2001-01-01T23:59:59.000Z
Institute of Technology. Kolen, A.W.J. , A.H.G. Rinnooy Kanreduced (see for example Kolen Rinnooy Kan and Trienekens,
National Security Technology Incubator Operations Plan
None
2008-04-30T23:59:59.000Z
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.
Hall, Dennis E.
2013-01-01T23:59:59.000Z
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-16T23:59:59.000Z
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.
Simulation of Quantum Algorithms with a Symbolic Programming Language
Peter Nyman
2007-05-24T23:59:59.000Z
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.
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
Parallelization of Path Planning Algorithms for AUVs Concepts, Opportunities, and Program-Technical
Kremer, Ulrich
Parallelization of Path Planning Algorithms for AUVs Concepts, Opportunities, and Program of an energy-aware, many-core computing architec- ture to perform on-board path planning within a battery- operated AUV. A previously published path planning algorithm was ported onto the SCC, an experimental 48
Efficient Pruning of Operators in Planning Domains Anders Jonsson
Jonsson, Anders
of individual state variables and performs search in the graphs to identify reÂ dundant operators. We prove.jonsson@upf.edu Abstract. Many recent successful planners use domainÂindependent heuristics to speed up the search domains demonstrate that our algorithm can reduce the number of operators as well as speed up search. 1
Efficient Pruning of Operators in Planning Domains Anders Jonsson
Jonsson, Anders
of individual state variables and performs search in the graphs to identify re- dundant operators. We prove.jonsson@upf.edu Abstract. Many recent successful planners use domain-independent heuristics to speed up the search domains demonstrate that our algorithm can reduce the number of operators as well as speed up search. 1
A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot ...
2004-02-09T23:59:59.000Z
A. Wagelmans, A. van Hoesel and A. Kolen. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research ...
Man-portable power generation devices : product design and supporting algorithms
Mitsos, Alexander
2006-01-01T23:59:59.000Z
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 ...
SNAP operating system reference manual
Sabuda, J.D.; Polito, J.; Walker, J.L.; Grant, F.H. III
1982-03-01T23:59:59.000Z
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.
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01T23:59:59.000Z
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.
Languages, Algorithms, Procedures, Calculi, and Metalogic
Mark Burgin
2007-01-04T23:59:59.000Z
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.
Detailed chemical kinetic oxidation mechanism for a biodiesel surrogate
Herbinet, O; Pitz, W J; Westbrook, C K
2007-09-20T23:59:59.000Z
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, O; Pitz, W J; Westbrook, C K
2007-09-17T23:59:59.000Z
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.
Cosmological perturbations in Horava-Lifshitz theory without detailed balance
Anzhong Wang; Roy Maartens
2010-01-14T23:59:59.000Z
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.
Non adiabatic quantum search algorithms
A. Perez; A. Romanelli
2007-06-08T23:59:59.000Z
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.
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, ...
Algebras of unbounded operators and physical applications: a survey
Fabio Bagarello
2009-03-31T23:59:59.000Z
After an historical introduction on the standard algebraic approach to quantum mechanics of large systems we review the basic mathematical aspects of the algebras of unbounded operators. After that we discuss in some details their relevance in physical applications.
Weather conditions affecting VTOL airbus operations in the Northeast Corridor
Simpson, R. W.
1966-01-01T23:59:59.000Z
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-15T23:59:59.000Z
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...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01T23:59:59.000Z
The first is vegetable oil from the market, which the farmercalculated. Oil was again from the market, and the details
Selected Items in Jet Algorithms
Giuseppe Bozzi
2008-08-06T23:59:59.000Z
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-28T23:59:59.000Z
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.
Hedge Algorithm and Subgradient Methods
2010-10-05T23:59:59.000Z
standard complexity results on subgradient algorithms allows us to derive optimal parameters ...... the American Statistical Association, 58:13–30, 1963. 1In fact ...
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
Modeling of batch operations in the Defense Waste Processing Facility at the Savannah River Site
Smith, F.G.
1995-02-01T23:59:59.000Z
A computer model is in development to provide a dynamic simulation of batch operations within the Defense Waste Processing Facility (DWPF) at the Savannah River Site (SRS). The DWPF will chemically treat high level waste materials from the site tank farm and vitrify the resulting slurry into a borosilicate glass for permanent disposal. The DWPF consists of three major processing areas: Salt Processing Cell (SPC), Chemical Processing Cell (CPC) and the Melt Cell. Separate models have been developed for each of these process units using the SPEEDUP{trademark} software from Aspen Technology. Except for glass production in the Melt Cell, all of the chemical operations within DWPF are batch processes. Since the SPEEDUP software is designed for dynamic modeling of continuous processes, considerable effort was required to devise batch process algorithms. This effort was successful and the models are able to simulate batch operations and the dynamic behavior of the process. In this paper, we will describe the SPC model in some detail and present preliminary results from a few simulation studies.
Peak thrust operation of linear induction machines from parameter identification
Zhang, Z.; Eastham, T.R.; Dawson, G.E. [Queen`s Univ., Kingston, Ontario (Canada). Dept. of Electrical and Computer Engineering
1995-12-31T23:59:59.000Z
Various control strategies are being used to achieve high performance operation of linear drives. To maintain minimum volume and weight of the power supply unit on board the transportation vehicle, peak thrust per unit current operation is a desirable objective. True peak thrust per unit current through slip control is difficult to achieve because the parameters of linear induction machines vary during normal operation. This paper first develops a peak thrust per unit current control law based on the per-phase equivalent circuit for linear induction machines. The algorithm for identification of the variable parameters in induction machines is then presented. Application to an operational linear induction machine (LIM) demonstrates the utility of this algorithm. The control strategy is then simulated, based on an operational transit LIM, to show the capability of achieving true peak thrust operation for linear induction machines.
Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms
Balasubramonian, Rajeev
1 Lecture 24: Parallel Algorithms I · Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) · At each clock, processors receive input output #12;4 Control at Each Processor · Each processor stores the minimum number it has seen
Fast algorithms for computing defects and their derivatives in the Regge calculus
Leo Brewin
2010-11-08T23:59:59.000Z
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.
An efficient algorithm for the Riemannian 10j symbols
J. Daniel Christensen; Greg Egan
2002-01-24T23:59:59.000Z
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.
Hazardous waste operational plan for site 300
Roberts, R.S.
1982-02-12T23:59:59.000Z
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.
Spatial compression algorithm for the analysis of very large multivariate images
Keenan, Michael R. (Albuquerque, NM)
2008-07-15T23:59:59.000Z
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-16T23:59:59.000Z
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.
Chiang, H.D.; Wang, J.C.; Tong, J. [Cornell Univ., Ithaca, NY (United States). School of Electrical Engineering; Darling, G. [NYSEG Corp., Binghamton, NY (United States). Distribution System Dept.
1994-12-31T23:59:59.000Z
This paper develops an effective and, yet, practical solution methodology for optimal capacitor placement, replacement and control in large-scale unbalanced, general radial or loop distribution systems. The solution methodology can optimally determine (1) the locations to install (or replace, or remove) capacitors, (2) the types and sizes of capacitors to be installed (or replaced) and, during each load level, (3) the control schemes for each capacitor in the nodes of a general three-phase unbalanced distribution system such that a desired objective function is minimized while the load constraints, network constraints and operational constraints at different load levels are satisfied. The solution methodology is based on a combination of the simulated annealing technique and the greedy search technique in order to achieve computational speed and high-quality of solutions. Both the numerical and implementational aspects of the solution methodology are detailed. Analysis of the computational complexity of the solution algorithm indicated that the algorithm is also effective for large-scale distribution systems in terms of occupational efforts. Test results on a realistic, unbalanced distribution network, a 291-bus with 77 laterals, 305 distribution lines and 6 transformers, with varying loading conditions, are presented with promising results. The robustness of the solution methodology under varying loading conditions is also investigated.
Chiang, H.D.; Wang, J.C.; Tong, J. [Cornell Univ., Ithaca, NY (United States). School of Electrical Engineering; Darling, G. [NYSEG Corp., Binghamton, NY (United States). Distribution System Dept.
1995-02-01T23:59:59.000Z
This paper develops an effective and, yet, practical solution methodology for optimal capacitor placement, replacement and control in large-scale unbalanced, general radial or loop distribution systems. The solution methodology can optimally determine (i) the locations to install (or replace, or remove) capacitors, (ii) the types and sizes of capacitors to be installed (or replaced) and, during each load level, (iii) the control schemes for each capacitor in the nodes of a general three-phase unbalanced distribution system such that a desired objective function is minimized while the load constraints, network constraints and operational constraints at different load levels are satisfied. The solution methodology is based on a combination of the simulated annealing technique and the greedy search technique in order to achieve computational speed and high-quality of solutions. Both the numerical and implementational aspects of the solution methodology are detailed. Analysis of the computational complexity of the solution algorithm indicates that the algorithm is also effective for large-scale distribution systems in terms of computational efforts. Test results on a realistic, unbalanced distribution network, a 291-bus with 77 laterals, 305 distribution lines and 6 transformers, with varying loading conditions, are presented with promising results. The robustness of the solution methodology under varying loading conditions is also investigated.
Buildings and Energy in the 80's -- 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:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706 802 1979-2013OctoberEstimatedDecade Year-0 Year-1Decade3)/1Biofuels Issues1Detailed
CBECS 1993 - Federal Buildings Supplement Survey - Detailed Tables
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National and Regional Data; Row: NAICS Codes; Column:3,2,19,30,"BANGOR HYDRO ELECTRICTables and Spreadsheets 1991A 6Feet) Year7 0164Detailed
Electric Utility Sales and Revenue - EIA-826 detailed data file
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power AdministrationHawaii Electricity Profile 2013callYearAdministration826 detailed data The Form
Detail Shot Of Mira | Argonne Leadership Computing Facility
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41clothThe Bonneville Power Administration wouldDecember 2014 NationalDepartmentConvergencePortalFuelDetail Shot Of Mira
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 DeliciousPlasmaP a g eWorksVillagesource History(Redirected from Davis EnergyDenton CountyDesert QueenDesertDetailed
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 Coupled Oscillator Model for Grover's Quantum Database Search Algorithm
Aavishkar A. Patel
2007-11-29T23:59:59.000Z
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 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
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15T23:59:59.000Z
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.
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-15T23:59:59.000Z
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.
A Modified Heat Stress Algorithm for Partially Enclosed Structures
Hunter, C.H.
2002-03-26T23:59:59.000Z
Historical data for wet bulb globe temperature (WBGT) were requested by WSRC Systems Engineering as part of an assessment of climate on loading operations to be conducted at the proposed Low Enriched Uranium (LEU) Loading Station in H-Area. This facility will have an insulated roof and partially enclosed sides to allow cooling inside the facility by natural convection. In 1996, the SRTC Atmospheric Technologies Group developed a computer algorithm to estimate WBGT using standard meteorological measurements. This algorithm assumes exposure to the ambient environment; consequently, modifications were necessary to the simulation.
Detailed Physical Trough Model for NREL's Solar Advisor Model: Preprint
Wagner, M. J.; Blair, N.; Dobos, A.
2010-10-01T23:59:59.000Z
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.
Anmer Daskin
2015-05-20T23:59:59.000Z
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.
Local algorithms for graph partitioning and finding dense subgraphs
Andersen, Reid
2007-01-01T23:59:59.000Z
ed local partitioning algorithm . . . . . . . . . . . .7 A Local Algorithm for Finding DenseComparison of local partitioning algorithms . . . . . . . .
Dynamic Algorithm for Space Weather Forecasting System
Fischer, Luke D.
2011-08-08T23:59:59.000Z
We propose to develop a dynamic algorithm that intelligently analyzes existing solar weather data and constructs an increasingly more accurate equation/algorithm for predicting solar weather accurately in real time. This dynamic algorithm analyzes a...
Efficient Algorithms for High Dimensional Data Mining
Rakthanmanon, Thanawin
2012-01-01T23:59:59.000Z
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-01T23:59:59.000Z
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
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
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10T23:59:59.000Z
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.
Heat Transfer Operators Associated with Quantum Operations
Ç. Aksak; S. Turgut
2011-04-14T23:59:59.000Z
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.
Building Operator Certification
Lilley, D.
2013-01-01T23:59:59.000Z
Air Through Energy Efficiency Conference, San Antonio, Texas Dec. 16-18 Building Operator Certification Energy Efficiency through Operator Training BOC Lighting Project ? Inspect lighting fixtures and lamps to assess type and wattage ? Identify... Antonio, Texas Dec. 16-18 Building Operator Certification Energy Efficiency through Operator Training Benefits of the Process • Overview of systems operation • Understanding of systems interaction • Builds Awareness of ? Operational decisions...
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-15T23:59:59.000Z
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-07T23:59:59.000Z
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-01T23:59:59.000Z
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-01T23:59:59.000Z
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.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Historical powerplant data Historical operations data Planning & Projects Power Marketing Rates Operations OASIS: wesTTrans OASIS (Note: this site is not hosted by Western and...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Operations and Maintenance Operations OASIS: WALC-DSW (Note: this site is not hosted by Western and requires a digital certificate and login for full access.) Contact Information...
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-28T23:59:59.000Z
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.
A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear ...
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 ...
Evolution Operators for Linearly Polarized Two-Killing Cosmological Models
J. Fernando Barbero G.; Daniel Gómez Vergel; Eduardo J. S. Villaseñor
2006-06-15T23:59:59.000Z
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.
WP3 Prototype development for operational planning tool
smaller parts of a power system but with more detailed representation of the transmission and distribution. This is done by the transmission system operator (TSO) in the Scandinavian power system. · Power producers the actual operation hour is documented in Section 3.2. With regard to the evaluation of a power system, its
Surface moisture measurement system operation and maintenance manual
Vargo, G.F., Westinghouse Hanford
1996-06-11T23:59:59.000Z
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.
Randomized algorithms for reliable broadcast
Vaikuntanathan, Vinod
2009-01-01T23:59:59.000Z
In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...
Bayesian inference algorithm on Raw
Luong, Alda
2004-01-01T23:59:59.000Z
This work explores the performance of Raw, a parallel hardware platform developed at MIT, running a Bayesian inference algorithm. Motivation for examining this parallel system is a growing interest in creating a self-learning ...
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
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 MANAGEMENT Spring 2008
Almor, Amit
the operations and supply chain strategy. This survey course in operations management introduces students1 MGSC 395 OPERATIONS MANAGEMENT Spring 2008 Course Syllabus Instructor: Professor Anand Nair Class MATERIALS Required Text Books Textbook: Krajewski, Lee, Ritzman, Larry, and Malhotra, Manoj. Operations
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
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-26T23:59:59.000Z
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.
Imaging algorithms in radio interferometry
R. J. Sault; T. A. Oosterloo
2007-01-08T23:59:59.000Z
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.
Waste receiving and processing facility module 1, detailed design report
Not Available
1993-10-01T23:59:59.000Z
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.
Synchronous multi-microprocessor system for implementing digital signal processing algorithms
Barnwell, T.P. III; Hodges, C.J.M.
1982-01-01T23:59:59.000Z
This paper discusses the details of a multi-microprocessor system design as a research facility for studying multiprocessor implementation of digital signal processing algorithms. The overall system, which consists of a control microprocessor, eight satellite microprocessors, a control minicomputer, and extensive distributed software, has proven to be an effect tool in the study of multiprocessor implementations. 5 references.
Vincenzo Tamma
2015-05-18T23:59:59.000Z
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.
Evolution Effects on Parton Energy Loss with Detailed Balance
Luan cheng; Enke Wang
2010-04-30T23:59:59.000Z
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-03T23:59:59.000Z
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.
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-30T23:59:59.000Z
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.
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-01T23:59:59.000Z
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.
Finite Density Matrix Renormalisation Group Algorithm for Anyonic Systems
Robert N. C. Pfeifer; Sukhwinder Singh
2015-05-01T23:59:59.000Z
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.
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
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
Tetrahedral hp finite elements: Algorithms and flow simulations
Sherwin, S.J.; Karniadakis, G.E. [Brown Univ., Providence RI (United States)] [Brown Univ., Providence RI (United States)
1996-03-01T23:59:59.000Z
We present a new discretisation for the incompressible Navier-Stokes equations that extends spectral methods to three-dimensional complex domains consisting of tetrahedral subdomains. The algorithm is based on standard concepts of hp finite elements as well as tensorial spectral elements. This new formulation employs a hierarchical/modal basis constructed from a new apex co-ordinate system which retains a generalised tensor product. These properties enable the development of computationally efficienct algorithms for use on standard finite volume unstructed meshes. A detailed analysis is presented that documents the stability and exponential convergence of the method and several flow cases are simulated and compared with analytical and experimental results. 34 refs., 28 figs., 1 tab.
The Yang-Mills Spectrum from a 2-level Algorithm
Harvey B. Meyer
2003-12-20T23:59:59.000Z
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.
Journes MAS 2010, Bordeaux Session : Algorithmes Stochastiques
Boyer, Edmond
. En particulier plusieurs facettes et applications des algorithmes MCO, MCOP, MCOG, ... seront mises
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
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
Griffiss AFB integrated resource assessment. Volume 2, Electric baseline detail
Dixon, D.R.; Armstrong, P.R.; Keller, J.M.
1993-02-01T23:59:59.000Z
The US Air Force Air Combat Command has tasked the Pacific Northwest Laboratory (PNL) as the lead laboratory supporting the US Department of Energy (DOE) Federal Energy Management Program`s (FEMP) mission to identify, evaluate, and assist in acquiring all cost-effective energy projects at Griffiss Air Force Base (AFB). This is a model program PNL is designing for federal customers served by the Niagara Mohawk Power Company (Niagara Mohawk). It will (1) identify and evaluate all electric cost-effective energy projects; (2) develop 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) secure 100% of the financing required to implement electric energy efficiency projects from Niagara Mohawk and have Niagara Mohawk procure the necessary contractors to perform detailed audits and install the technologies. This report documents the assessment of baseline energy use at one of Niagara Mohawk`s primary federal facilities, Griffiss AFB, an Air Combat Command facility located near Rome, New York. It is a companion report to Volume 1, the Executive Summary, and Volume 3, the Electric Resource Assessment. The analysis examines the characteristics of electric, gas, oil, propane, coal, and purchased thermal capacity use for fiscal year (FY) 1990. The results include energy-use intensities for the facilities at Griffiss AFB by building type and electric energy end use. A complete electric energy consumption reconciliation is presented that accounts for the distribution of all major electric energy uses and losses among buildings, utilities, and central systems.
Comparison of a Greedy Selection Operator to Tournament Selection and a Hill Climber
Parker, Gary B.
genetic algorithm selection operator with very high selection pressure, dubbed the "Jugate Adaptive Method of the search space at large [1-3]. Genetic algorithms (GAs) address the need for exploration through random for exploitation by constantly generating mutants or neighbors of the current candidate solution and adopting
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
An improved interior-point approach for use in reservoir operation Abbas Seifi
Tunçel, Levent
, 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
An improved interiorpoint approach for use in reservoir operation Abbas Seif i
Tunçel, Levent
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
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
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
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...
Lifetime Prediction of IGBT in a STATCOM Using Modified-Graphical Rainflow Counting Algorithm
Gopi Reddy, Lakshmi Reddy [ORNL; Tolbert, Leon M [ORNL; Ozpineci, Burak [ORNL
2012-01-01T23:59:59.000Z
Rainflow algorithms are one of the best counting methods used in fatigue and failure analysis [17]. There have been many approaches to the rainflow algorithm, some proposing modifications. Graphical Rainflow Method (GRM) was proposed recently with a claim of faster execution times [10]. However, the steps of the graphical method of rainflow algorithm, when implemented, do not generate the same output as the four-point or ASTM standard algorithm. A modified graphical method is presented and discussed in this paper to overcome the shortcomings of graphical rainflow algorithm. A fast rainflow algorithm based on four-point algorithm but considering point comparison than range comparison is also presented. A comparison between the performances of the common rainflow algorithms [6-10], including the proposed methods, in terms of execution time, memory used, and efficiency, complexity, and load sequences is presented. Finally, the rainflow algorithm is applied to temperature data of an IGBT in assessing the lifetime of a STATCOM operating for power factor correction of the load. From 5-minute data load profiles available, the lifetime is estimated to be at 3.4 years.
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
Single qudit realization of the Deutsch algorithm using superconducting many-level quantum circuits
E. O. Kiktenko; A. K. Fedorov; A. A. Strakhov; V. I. Man'ko
2015-04-05T23:59:59.000Z
Design of a large-scale quantum computer has paramount importance for science and technologies. We investigate a scheme for realization of quantum algorithms using noncomposite quantum systems, i.e., systems without subsystems. In this framework, $n$ artificially allocated "subsystems" play a role of qubits in $n$-qubits quantum algorithms. With focus on two-qubit quantum algorithms, we demonstrate a realization of the universal set of gates using a $d=5$ single qudit state. Manipulation for an ancillary level in the systems allows effective implementation of operators from ${\\rm U}(4)$ group via operators from ${\\rm SU}(5)$ group. Using a possible experimental realization of such systems through anharmonic superconducting many-level quantum circuits, we present a blueprint for a single qudit realization of the Deutsch algorithm, which generalizes previously studied realization based on the virtual spin representation [A.R. Kessel et al., Phys. Rev. A 66, 062322 (2002)].
Lifting -- A Nonreversible Markov Chain Monte Carlo Algorithm
Vucelja, Marija
2015-01-01T23:59:59.000Z
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...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Longitudinal bunch profile and Up: APS Storage Ring Parameters Previous: Source Parameter Table Storage Ring Operation Modes Standard Operating Mode, top-up Fill pattern: 102 mA in...
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,...
Wurbs, Ralph A.
management of the surface water resources of the various river basins of the state. The operation of these essential water control facilities is examined in this report. Reservoir operation is viewed here from the perspective of deciding how much water...
Building Operator Certification
Lilley, D.
2013-01-01T23:59:59.000Z
and maintenance technicians hold the BOC® credential ? Energy efficient operational practices ? Utility cost reduction ? Sustainable building operation for LEED® and ENERGY STAR® initiatives ESL-KT-13-12-49 CATEE 2013: Clean Air Through Energy Efficiency... engineers Lighting consultants LEED AP’s Certified Energy Managers 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...
None
2010-01-01T23:59:59.000Z
A multiple vview shot of the SWPF crane lift operation at the Savannah River Site. Funded by the Recovery Act.
Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
Vestergaard, Christian L
2015-01-01T23:59:59.000Z
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,...
human spaceflight and operations
Anand, Mahesh
1 human spaceflight and operations Lunar Lander human spaceflight and operations #12;2 human spaceflight and operations Lunar Lander Mission Objective Astronaut health Resources e.g. water, O, OH cooperation in exploration prim ary objective opportunity for investigations #12;3 human spaceflight
Top 100 Operators: Proved Reserves and Production, Operated vs...
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
Top 100 Operators: Proved Reserves and Production, Operated vs Owned, 2009 1 Top 100 Operators: Proved Reserves and Production, Operated vs Owned, 2009 The operator of an oil or...
Submitted to Operations Research manuscript (Please, provide the mansucript number!)
Powell, Warren B.
of developing near-optimal policies for an energy system that combines energy from an exogenously varying supply, direct policy search 1. Introduction Incorporating large amounts of energy from intermittent resources programming algorithm to operate an energy storage facility and a wind farm. Sørensen (1981) describes
Jet Shapes and Jet Algorithms in SCET
Stephen D. Ellis; Andrew Hornig; Christopher Lee; Christopher K. Vermilion; Jonathan R. Walsh
2010-11-15T23:59:59.000Z
Jet shapes are weighted sums over the four-momenta of the constituents of a jet and reveal details of its internal structure, potentially allowing discrimination of its partonic origin. In this work we make predictions for quark and gluon jet shape distributions in N-jet final states in e+e- collisions, defined with a cone or recombination algorithm, where we measure some jet shape observable on a subset of these jets. Using the framework of Soft-Collinear Effective Theory, we prove a factorization theorem for jet shape distributions and demonstrate the consistent renormalization-group running of the functions in the factorization theorem for any number of measured and unmeasured jets, any number of quark and gluon jets, and any angular size R of the jets, as long as R is much smaller than the angular separation between jets. We calculate the jet and soft functions for angularity jet shapes \\tau_a to one-loop order (O(alpha_s)) and resum a subset of the large logarithms of \\tau_a needed for next-to-leading logarithmic (NLL) accuracy for both cone and kT-type jets. We compare our predictions for the resummed \\tau_a distribution of a quark or a gluon jet produced in a 3-jet final state in e+e- annihilation to the output of a Monte Carlo event generator and find that the dependence on a and R is very similar.
Patrick Cassam-Chenaï; Guillaume Dhont; Frédéric Patras
2014-07-12T23:59:59.000Z
Invariant theory provides more efficient tools, such as Molien generating functions and integrity bases, than basic group theory, that relies on projector techniques for the construction of symmetry--adapted polynomials in the symmetry coordinates of a molecular system, because it is based on a finer description of the mathematical structure of the latter. The present article extends its use to the construction of polynomial bases which span possibly, non--totally symmetric irreducible representations of a molecular symmetry group. Electric or magnetic observables can carry such irreducible representations, a common example is given by the electric dipole moment surface. The elementary generating functions and their corresponding integrity bases, where both the initial and the final representations are irreducible, are the building blocks of the algorithm presented in this article, which is faster than algorithms based on projection operators only. The generating functions for the full initial representation of interest are built recursively from the elementary generating functions. Integrity bases which can be used to generate in the most economical way symmetry--adapted polynomial bases are constructed alongside in the same fashion. The method is illustrated in detail on XY4 type of molecules. Explicit integrity bases for all five possible final irreducible representations of the tetrahedral group have been calculated and are given in the supplemental material associated with this paper.
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
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-28T23:59:59.000Z
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.
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
Machine Learning: Foundations and Algorithms
Ben-David, Shai
with accident prevention systems that are built using machine learning algorithms. Machine learning is also to us). Machine learning tools are concerned with endowing programs with the ability to "learn if the learning process succeeded or failed? The second goal of this book is to present several key machine
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
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
Algorithmic Thermodynamics John C. Baez
Tomkins, Andrew
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
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-01T23:59:59.000Z
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
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
A (P)HMC algorithm for N_f = 2 + 1 + 1 flavours of twisted mass fermions
T. Chiarappa; R. Frezzotti; C. Urbach
2005-09-27T23:59:59.000Z
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.
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-19T23:59:59.000Z
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.
Oscillation Detection Algorithm Development Summary Report and Test Plan
Zhou, Ning; Huang, Zhenyu; Tuffner, Francis K.; Jin, Shuangshuang
2009-10-03T23:59:59.000Z
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.
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
Detailed Calculation of Test-Mass Charging in the LISA Mission
H. M. Araujo; P. Wass; D. Shaul; G. Rochester; T. J. Sumner
2004-10-07T23:59:59.000Z
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.
Not Available
1988-01-01T23:59:59.000Z
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.
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
The bidimensionality theory and its algorithmic applications
Hajiaghayi, MohammadTaghi
2005-01-01T23:59:59.000Z
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. ...
Constant time algorithms in sparse graph model
Nguyen, Huy Ngoc, Ph. D. Massachusetts Institute of Technology
2010-01-01T23:59:59.000Z
We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum ...
A distributed K-mutual exclusion algorithm
Bulgannawar, Shailaja Gurupad
1994-01-01T23:59:59.000Z
This thesis presents a new token-based K-mutual exclusion algorithm for distributed systems. The proposed algorithm uses K tokens to achieve K-mutual exclusion. The system of N nodes is organized as a logical forest, with ...
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 ...
Algorithms for Constrained Route Planning in Road Networks
Rice, Michael Norris
2013-01-01T23:59:59.000Z
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-01T23:59:59.000Z
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-01T23:59:59.000Z
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-01T23:59:59.000Z
5.2 Algorithm ECHS with Ratio5.3 Algorithm EBGS with RatioFormulation 2.1.3 Approximation Algorithms . 2.1.4 Bifactor
Spectral Operators of Matrices
2014-01-10T23:59:59.000Z
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.
Not Available
1992-03-01T23:59:59.000Z
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-01T23:59:59.000Z
This report discusses the following topics in relation to the Bevalac accelerator: accelerator technology operations summary; nuclear science; biomedical research; and publications and presentations.
Broader source: Energy.gov [DOE]
A successful candidate in this position serves as safety analyst responsible for conducting independent operational, process and economic analyses for a category of conceptual and advanced...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
RL Deputy Manager, responsible for oversight of daily operations, program planning, project execution, budgeting, compliance with the Hanford Federal Facility Agreement and...
Pipeline Operations Program (Louisiana)
Broader source: Energy.gov [DOE]
The Pipeline Operations Program regulates the construction, acquisition, abandonment and interconnection of natural gas pipelines, as well as, the transportation and use of natural gas supplies.
Optimization Online - Efficient parallel coordinate descent algorithm ...
Ion Necoara
2012-11-02T23:59:59.000Z
Nov 2, 2012 ... Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC.
Optimization Online - Efficient Algorithmic Techniques for Several ...
Mugurel Ionut Andreica
2008-10-23T23:59:59.000Z
Oct 23, 2008 ... Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems. Mugurel Ionut ...
An implicit numerical algorithm general relativistic hydrodynamics
A. Hujeirat
2008-01-09T23:59:59.000Z
An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017
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
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
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
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
A DISTRIBUTED POWER CONTROL ALGORITHM FOR
Mitra, Debasis
A DISTRIBUTED POWER CONTROL ALGORITHM FOR BURSTY TRANSMISSIONS ON CELLULAR, SPREAD SPECTRUM, USA ABSTRACT We propose a distributed algorithm for power control in cellular, wideband networks, although its parameters are different from data. We propose a distributed algorithm for power control
university-logo Intro Algorithm Results Concl.
Aarts, Gert
university-logo Intro Algorithm Results Concl. Strong coupling lattice QCD at finite temperature Ph. de Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. QCD Forcrand Trento, March 2009 = 0 QCD #12;university-logo Intro Algorithm Results Concl. Motivation (1
Equivalence of Learning Algorithms Julien Audiffren1
Equivalence of Learning Algorithms Julien Audiffren1 and Hachem Kadri2 1 CMLA, ENS Cachan is to introduce a concept of equivalence between machine learn- ing algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance
Voronoi Particle Merging Algorithm for PIC Codes
Luu, Phuc T; Pukhov, A
2015-01-01T23:59:59.000Z
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.
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
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
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
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
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
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
A Genetic Algorithm Approach for Technology Characterization
Galvan, Edgar
2012-10-19T23:59:59.000Z
A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY CHARACTERIZATION A Thesis by EDGAR GALVAN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE August 2012 Major Subject: Mechanical Engineering A Genetic Algorithm Approach for Technology Characterization Copyright 2012 Edgar Galvan A GENETIC ALGORITHM APPROACH FOR TECHNOLOGY...
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
Logo-like Learning of Basic Concepts of Algorithms -Having Fun with Algorithms
Logo-like Learning of Basic Concepts of Algorithms - Having Fun with Algorithms Gerald Futschek are not primarily interested in programming the way of learning is highly influenced by the Logo style of learning to design efficient algorithms. Keywords Logo-like learning, algorithms, group learning 1 2 3 4 5 n ... 1
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
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
Humanitarian Operations Pinar Keskinocak
Li, Mo
1 Humanitarian Operations Pinar Keskinocak H. Milton Stewart School of Industrial & Systems for Allocating Urban Emergency Units: A Survey Larson (1972), Urban Police Patrol Analysis Larson and Odoni (1981), Urban Operations Research Jones and Eden (1981), O.R. in the Community Pollock, Rothkopf, Barnett (1994
Characterization of a noisy quantum process by complementary classical operations
Holger F. Hofmann; Ryo Okamoto; Shigeki Takeuchi
2006-10-31T23:59:59.000Z
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.
Testing Algorithms for Finite Temperature Lattice QCD
M. Cheng; M. A. Clark; C. Jung; R. D. Mawhinney
2006-08-23T23:59:59.000Z
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.
C Gormezano 14/07/2003 Control Issues Control Issues for Integrated Steady-State Operation
specific modelling (development of model-based control algorithm: Moreau) q Tools: ECCD, NBCD, LHCD Ø1 C Gormezano 14/07/2003 Control Issues Control Issues for Integrated Steady-State Operation Ø First principle: · Steady state operation is not conceivable without active control Ø Plan of the talk q
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23TribalInformation Access toTen Problems in ExperimentalUnitarityOrganic lightCap plasticity 'ORNL
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
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
Final report: Task 4a.2 20% wind scenario assessment of electric grid operational features
Toole, Gasper L. [Los Alamos National Laboratory
2009-01-01T23:59:59.000Z
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.
Cone algorithm jets in e{sup +}e{sup {minus}} collisions
Chay, J. [Department of Physics, Korea University, Seoul 136-701 (Korea)] [Department of Physics, Korea University, Seoul 136-701 (Korea); Ellis, S.D. [Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States)] [Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States)
1997-03-01T23:59:59.000Z
The structure of hadronic jets depends not only on the dynamics of QCD but also on the details of the jet finding algorithm and the physical process in which the jet is produced. To study these effects in more detail we calculate the jet cross section and the internal jet structure in e{sup +}e{sup {minus}} annihilations and compare them to the results found in hadronic collisions using the {ital same} jet definition, the cone algorithm. The different structures of the overall events in the two cases are evident in the comparison. For a given cone size and jet energy, the distribution of energy inside the cone is more concentrated near the center for jets from e{sup +}e{sup {minus}} collisions than for jets from hadronic collisions. {copyright} {ital 1997} {ital The American Physical Society}
A high voltage, high current, low error operational amplifier with novel features
Poitzsch, Alec Julius
2014-01-01T23:59:59.000Z
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 ...
Evaluating operating system vulnerability to memory errors.
Ferreira, Kurt Brian; Bridges, Patrick G. (University of New Mexico); Pedretti, Kevin Thomas Tauke; Mueller, Frank (North Carolina State University); Fiala, David (North Carolina State University); Brightwell, Ronald Brian
2012-05-01T23:59:59.000Z
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.
Positive-operator-valued measure optimization of classical correlations
Hamieh, S.; Kobes, R.; Zaraket, H. [Kernfysisch Versneller Instituut, Zernikelaan 25 9747 AA Groningen (Netherlands); Physics Department, The University of Winnipeg, 515 Portage Avenue, Winnipeg, Manitoba, R3B 2E9 (Canada)
2004-11-01T23:59:59.000Z
We study the problem of optimization over positive-operator-valued measures to extract classical correlation in a bipartite quantum system. The proposed method is applied to binary states only. Moreover, to illustrate this method, an explicit example is studied in detail.
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
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
Operation Prognostics and Operation Diagnostics—Technologies for Enhanced Operations and Controls
Baumann, O.
PROGNOSTICS AND OPERATION DIAGNOSTICS ? NEW TECHNOLOGIES FOR ENHANCED OPERATIONS AND CONTROLS OLIVER BAUMANN, PRESIDENT 202-608-1334 EBERT & BAUMANN CONSULTING ENGINEERS, WASHINGTON D.C. The Methodologies of Operation Prognostics and Operation...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2005-01-14T23:59:59.000Z
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.
NONE
1997-10-01T23:59:59.000Z
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.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2010-06-29T23:59:59.000Z
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
Wurbs, Ralph A.
1985-01-01T23:59:59.000Z
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...
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: Energy.gov [DOE]
The incumbent in this position will serve as an Operation Research Analyst in the Market Analysis and Pricing organization of Power Services. This organization is responsible for performing market...
Paxton, Blaine Kermit
2004-01-01T23:59:59.000Z
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 ...
Unknown
2011-08-17T23:59:59.000Z
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...
CH Packaging Operations Manual
Washington TRU Solutions LLC
2005-06-13T23:59:59.000Z
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-01T23:59:59.000Z
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-14T23:59:59.000Z
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.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1992-04-30T23:59:59.000Z
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.
Cogeneration Operational Issues
Williams, M.
1985-01-01T23:59:59.000Z
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...
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": Â´ Âµ
A Detailed Chemical Kinetic Analysis of Low Temperature Non-Sooting Diesel Combustion
Aceves, S M; Flowers, D L
2004-10-01T23:59:59.000Z
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.
Operational Waste Volume Projection
STRODE, J.N.
2000-08-28T23:59:59.000Z
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-24T23:59:59.000Z
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.
Operations | Argonne National Laboratory
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5(Million Cubic Feet) Oregon (Including Vehicle Fuel) (Million Cubic Feet) NaturalOctober OctoberResolved:Operations building Operations
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 With larger portion of growing electricity demand which is being fed through distributed generation (DG power system. Being able to operate in both grid-connected and islanded mode, a microgrid manages
ORNL ADCP POST-PROCESSING GUIDE AND MATLAB ALGORITHMS FOR MHK SITE FLOW AND TURBULENCE ANALYSIS
Gunawan, Budi [Oak Ridge National Laboratory (ORNL); Neary, Vincent S [ORNL
2011-09-01T23:59:59.000Z
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.
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
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
Algorithms for Green Buildings: Learning-Based Techniques for Energy Prediction and Fault Diagnosis
Seshia, Sanjit A.
Algorithms for Green Buildings: Learning-Based Techniques for Energy Prediction and Fault Diagnosis Buildings: Learning-Based Techniques for Energy Prediction and Fault Diagnosis Daniel Holcomb Wenchao Li consider two problems in the design and operation of energy-efficient buildings. The first
Gibbons, Jeremy
Efficient parallel algorithms for tree accumulations Jeremy Gibbons, Wentong Cai and David B. Skillicorn Abstract. Accumulations are higherÂorder operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements
Tachi, Susumu
- 2777 - The Control Algorithm Enabling Natural Physical Interaction with Humanoid Robot Arm Having_teterukov@ipc.i.u-tokyo.ac.jp) Abstract: The paper is concentrated on control of humanoid robot arm intended for operation in unstructured that proposed approach not only provides safe interaction of robot arm with a person, but also improves
Gen IV Materials Handbook Functionalities and Operation
Ren, Weiju [ORNL
2009-12-01T23:59:59.000Z
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.
River Corridor Cleanup Contract Fiscal Year 2006 Detailed Work Plan: DWP Summary, Volume 1
Project Integration
2005-09-26T23:59:59.000Z
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.
Saxena, Samveg
2013-01-01T23:59:59.000Z
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
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.
The Energy Endoscope: Real-time Detailed Energy Accounting for Wireless Sensor Nodes
Stathopoulos, Thanos; McIntire, Dustin; Kaiser, W J
2007-01-01T23:59:59.000Z
meter for energy monitoring of wireless sensor networks attime Detailed Energy Accounting for Wireless Sensor Nodessuch Subsystem Energy (%) Ethernet CF Wireless PXA SDRAM
Environmental assessment related to the operation of Argonne National Laboratory, Argonne, Illinois
Not Available
1982-08-01T23:59:59.000Z
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.
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
Surviving Operation Desert Storm
Vice, J. (Booz, Allen and Hamilton, Inc., Dayton, OH (United States))
1992-08-01T23:59:59.000Z
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.
Archer, Daniel E. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Hornback, Donald Eric [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Johnson, Jeffrey O. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Nicholson, Andrew D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Patton, Bruce W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Peplow, Douglas E. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Miller, Thomas Martin [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Ayaz-Maierhafer, Birsen [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-01-01T23:59:59.000Z
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.
Operations and Maintenance Contacts | Department of Energy
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
Program Areas Operations & Maintenance Operations and Maintenance Contacts Operations and Maintenance Contacts For more information about operations and maintenance, contact:...
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-01T23:59:59.000Z
pump and controls represent an investment in terms of initial cost, maintenance and electrical operating costs.
Laminated Wave Turbulence: Generic Algorithms II
Elena Kartashova; Alexey Kartashov
2006-11-17T23:59:59.000Z
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.
A fast contour descriptor algorithm for supernova imageclassification
Aragon, Cecilia R.; Aragon, David Bradburn
2006-07-16T23:59:59.000Z
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.
Algorithm for a microfluidic assembly line
Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner
2011-01-19T23:59:59.000Z
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.
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
Dendrodendritic Inhibition and Simulated Odor Responses in a Detailed Olfactory Bulb Network Model
Feng, Jianfeng
Dendrodendritic Inhibition and Simulated Odor Responses in a Detailed Olfactory Bulb Network Model responses in a detailed olfac- tory bulb network model. J Neurophysiol 90: 19211935, 2003. First published May 7, 2003; 10.1152/jn.00623.2002. In the olfactory bulb, both the spatial distribution
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
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 is disseminated electronically. We present an experiment that compares the usability of a linear, a fisheye of linear, fisheye, and overview+detail interfaces. Our focus on reading of electronic documents has two
Abdoun, Otman; Abouchabka, Jaafar
2012-01-01T23:59:59.000Z
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.
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2014-11-17T23:59:59.000Z
Algorithmic cooling is a method that employs thermalization to increase the qubits' 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 13C2-trichloroethylene, cooling the system beyond Shannon's entropy bound in several different ways. For example, 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-14T23:59:59.000Z
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.
Optimization Online - Efficient Heuristic Algorithms for Maximum ...
T. G. J. Myklebust
2012-11-19T23:59:59.000Z
Nov 19, 2012 ... Efficient Heuristic Algorithms for Maximum Utility Product Pricing Problems. T. G. J. Myklebust(tmyklebu ***at*** csclub.uwaterloo.ca)
Efficient Algorithmic Techniques for Several Multidimensional ...
Mugurel
2008-10-23T23:59:59.000Z
Politehnica University of Bucharest, Romania, mugurel.andreica@cs.pub.ro. Abstract: In this paper I present several novel, efficient, algorithmic techniques for.
Parallel Interval Continuous Global Optimization Algorithms
abdeljalil benyoub
2002-07-19T23:59:59.000Z
Jul 19, 2002 ... Abstract: We theorically study, on a distributed memory architecture, the parallelization of Hansen's algorithm for the continuous global ...
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...
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).
Algorithmic Cooling in Liquid State NMR
Yosi Atia; Yuval Elias; Tal Mor; Yossi Weinstein
2015-08-05T23:59:59.000Z
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.
A preliminary evaluation of a speed threshold incident detection algorithm
Kolb, Stephanie Lang
1996-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . , . Event Scan Algorithm . Neural Network . . . . . . . . . . . . . . . , . . . . . . California Algorithm ?8 with Fuzzy Logic Selected Algorithms Page 20 21 22 24 24 25 26 27 28 28 30 32 32 33 33 33 33... 7 California Algorithm ?10 Decision Tree 12 14 15 8 Speed/Flow Curve 9 McMaster Algorithm Template 15 25 10 Traffic Flow Relationships Applied in the Dynamic Model Algorithm. . . 26 11 Multi-Layer Feed-Forward Neural Network 12 Membership...
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
St Andrews, University of
The Need for Language Repair The Reformation Algorithm Discussion Reformation: A Domain of Edinburgh University of St Andrews, 27th November 2013 #12;The Need for Language Repair The Reformation Algorithm Discussion Outline 1 The Need for Language Repair 2 The Reformation Algorithm 3 Discussion #12;The
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL
MULTI-CRITERIA SEARCH ALGORITHM: AN EFFICIENT APPROXIMATE K-NN ALGORITHM FOR IMAGE RETRIEVAL Mehdi-NN search in large scale image databases, based on top-k multi-criteria search tech- niques. The method retrieval, stor- age requirements and update cost. The search algorithm delivers ap- proximate results
Sustainable Operations & Maintenance Implementation Support
Sustainable Operations & Maintenance Implementation Support (SOMIS) Warner College of Natural- day building operations and maintenance, as well as suggestions for overall retrofit and reha that are used to arrive at a collective sustainable approach to existing buildings operations and maintenance
van Hemmen, J. Leo
in this Publication is provided as is and has been prepared solely for the purpose of evaluating data center designOperation and Maintenance InRow® RD Air Cooled ACRD100 ACRD101 #12;This manual is available assumes no liability for damages, violations of codes, improper installation, system failures, or any
Concept of Operations: Essence
Hutton, William J.
2014-04-01T23:59:59.000Z
This concept of operations is designed to give the reader a brief overview of the National Rural Electric Cooperative Association’s Essence project and a description of the Essence device design. The data collected by the device, how the data are used, and how the data are protected are also discussed in this document.
Structuring Structural Operational
Mousavi, Mohammad
aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr.ir. C.J. van.A. Reniers CIPDATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN Mousavi, MohammadReza Structuring Structural Operational Semantics / MohammadReza Mousavi. Eindhoven : Technische Universiteit Eindhoven, 2005
Structuring Structural Operational
Reniers, Michel
aan de Technische Universiteit Eindhoven, op gezag van de Rector Magnificus, prof.dr.ir. C.J. van.A. Reniers CIP-DATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN Mousavi, MohammadReza Structuring Structural Operational Semantics / MohammadReza Mousavi. - Eindhoven : Technische Universiteit Eindhoven, 2005
Teschl, Gerald
-LATEX, PicTEX, and Makeindex. Version: November 7, 2012. Library of Congress Cataloging-in-Publication Data CIP Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting-adjoint operators and develop discrete Weyl-Titchmarsh-Kodaira theory, covering all classical aspects like Weyl m-functions
OPERATIONAL RISK RODNEY COLEMAN
Coleman, Rodney
is entered into with the aim of generating wealth, in the pursuit of returns Wiley Encyclopedia of Operations, not only because losses are widely expressed in monetary terms but also since the industry is highly the loss events are penalties imposed for contravening regulations, they enter the public domain. Onetime
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2010-06-29T23:59:59.000Z
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, dated 6-25-13, cancels DOE O 422.1. Certified 12-3-14.
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2010-06-29T23:59:59.000Z
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 2, dated 12-3-14, cancels Admin Chg 1.
Jan Berkow; Larry Banta
2003-07-29T23:59:59.000Z
The Intelligent Potroom Operation project focuses on maximizing the performance of an aluminum smelter by innovating components for an intelligent manufacturing system. The Intelligent Potroom Advisor (IPA) monitors process data to identify reduction cells exhibiting behaviors that require immediate attention. It then advises operational personnel on those heuristic-based actions to bring the cell back to an optimal operating state in order to reduce the duration and frequency of substandard reduction cell performance referred to as ''Off-Peak Modes'' (OPMs). Techniques developed to identify cells exhibiting OPMs include the use of a finite element model-based cell state estimator for defining the cell's current operating state via advanced cell noise analyses. In addition, rule induction was also employed to identify statistically significant complex behaviors that occur prior to OPMs. The intelligent manufacturing system design, concepts and formalisms developed in this project w ere used as a basis for an intelligent manufacturing system design. Future research will incorporate an adaptive component to automate continuous process improvement, a technology platform with the potential to improve process performance in many of the other Industries of the Future applications as well.
Nelson, Gary S.
1982-01-01T23:59:59.000Z
Z TA24S.7 8873 NO.1409 B-1409 SAFE CHAIN SAW OPERATION Gary S. Nelson* A chain saw is a portable power cutting machine. Used properly, it will trim or cut down trees, clear land or cut fireplace wood. Improperly used, a chain saw can...
DCO Operations Interesting Statistics
DRY BULB TEMPERATURE - °F 01 51 02 52 03 53 04 54 05 55 55 06 06 RIAYRDFODNUOPREPUTB-YPLAHTNE ENTHALPY - BTU PER POUND OF DRY AIR 51 02 52 03 53 04 54 05 RIA YRD F O DNU OP REP UTB- YPLAHTNE F°- ERUTAREP MET operate 1560 hard disks, totaling 530 TB of storage · Eight air conditioners within the zones process
Frew, Eric W.
Hawk, significant effort is required to survey each airfield at which the UAS will operate, and to specify detailedAbstract--This paper presents a vision-based navigation solution for unmanned aircraft operations on airfield surfaces in GPS-denied environments. The Unmanned Aircraft System Ground Operations Management
On the Existence of certain Quantum Algorithms
Bjoern Grohmann
2009-04-11T23:59:59.000Z
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.
On the Potential of Automatic Algorithm Configuration
Hutter, Frank
.g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well lead to enormous speed-ups of tree search algorithms for SAT for solving SAT-encoded software The problem of setting an algorithm's free parameters for maximal performance on a class of problem instances
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
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
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
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
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
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...
Power Control Algorithms in Wireless Communications
Power Control Algorithms in Wireless Communications Judd Rohwer , Chaouki T. Abdallah , Aly El-Osery 1 Abstract This paper presents a comprehensive review of the published algorithms on power control) and Time Division Multiple Access (TDMA). 2 Introduction Power control in cellular systems is applied
A heuristic algorithm for graph isomorphism
Torres Navarro, Luz
1999-01-01T23:59:59.000Z
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...
ASYNPLEX, an asynchronous parallel revised simplex algorithm
Hall, Julian
ASYNPLEX, an asynchronous parallel revised simplex algorithm J.A.J. Hall K.I.M. McKinnon February, an asynchronous parallel revised simplex algorithm J. A. J. Hall K. I. M. McKinnon 27th February 1998 Abstract This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable
Buffer assignment algorithms for data driven architectures
Chatterjee, Mitrajit
1994-01-01T23:59:59.000Z
algorithms have been shown to be O(V x E) and O(V'xlogV) re spectively; an improvement over the existing strategies. A novel buffer distribution algorithm to maximize the pipelining and throughput has also been proposed. The number of buffers obtained...
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
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05T23:59:59.000Z
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.
Note on Integer Factoring Algorithms II
N. A. Carella
2007-02-08T23:59:59.000Z
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.
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
Algorithmic Problems in Power Management Sandy Irani
Pruhs, Kirk
Algorithmic Problems in Power Management Sandy Irani School of Information and Computer Science on algorithmic problems related to power management. We will try to highlight some open problems that we feel are interesting. This survey places more concentration on lines of research of the authors: managing power using
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
Operations and Maintenance Program Structure
Broader source: Energy.gov [DOE]
The Federal Energy Management Program recommends Federal operations and maintenance (O&M) programs comprise of five distinct functions: operations, maintenance, engineering, training, and...
An enhanced version of the heat exchange algorithm with excellent energy conservation properties
Wirnsberger, P; Dellago, C
2015-01-01T23:59:59.000Z
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 ...
Generators of KMS Symmetric Markov Semigroups on B(h) Symmetry and Quantum Detailed Balance
F. Fagnola; V. Umanitá
2009-08-06T23:59:59.000Z
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.