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


1

Clouds and the Earth''s Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume I-Overviews (Subsystem 0)  

Science Conference Proceedings (OSTI)

The theoretical bases for the Release 1 algorithms that will be used to process satellite data for investigation of the Clouds and the Earth''s Radiant Energy System (CERES) are described. The architecture for software implementation of the methodologies ...

Team CERES Science

1995-12-01T23:59:59.000Z

2

Clouds and the Earth''s Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume II-Geolocation, Calibration, and ERBE-Like Analyses (Subsystems 1-3)  

Science Conference Proceedings (OSTI)

The theoretical bases for the Release 1 algorithms that will be used to process satellite data for investigation of the Clouds and Earth''s Radiant Energy System (CERES) are described. The architecture for software implementation of the methodologies ...

Team CERES Science

1995-12-01T23:59:59.000Z

3

A Theoretical Basis for Household Energy Conservation UsingProduct...  

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

A Theoretical Basis for Household Energy Conservation Using Product-Integrated Feedback Speaker(s): Teddy McCalley Date: October 11, 2002 - 12:00pm Location: Bldg. 90 Seminar Host...

4

Parallel algorithms for identifying convex and non-convex basis polygons in an image  

Science Conference Proceedings (OSTI)

In this paper, we propose two novel parallel algorithms for identifying all the basis polygons in an image formed by n straight line segments each of which is represented by its two end points. The first algorithm is designed to tackle the simple situation ... Keywords: Basis polygon, Edge traversal, Parallel algorithm

Arijit Laha; Amitava Sen; Bhabani P. Sinha

2005-03-01T23:59:59.000Z

5

An 'optimal' spawning algorithm for adaptive basis set expansion in nonadiabatic dynamics  

Science Conference Proceedings (OSTI)

The full multiple spawning (FMS) method has been developed to simulate quantum dynamics in the multistate electronic problem. In FMS, the nuclear wave function is represented in a basis of coupled, frozen Gaussians, and a 'spawning' procedure prescribes a means of adaptively increasing the size of this basis in order to capture population transfer between electronic states. Herein we detail a new algorithm for specifying the initial conditions of newly spawned basis functions that minimizes the number of spawned basis functions needed for convergence. 'Optimally' spawned basis functions are placed to maximize the coupling between parent and child trajectories at the point of spawning. The method is tested with a two-state, one-mode avoided crossing model and a two-state, two-mode conical intersection model.

Yang, Sandy; Coe, Joshua D.; Kaduk, Benjamin; Martinez, Todd J. [Department of Chemistry and Beckman Institute, University of Illinois at Urbana-Champaign, 600 S. Mathews Ave., Urbana, Illinois 61801 (United States)

2009-04-07T23:59:59.000Z

6

Battery Utilization in Electric Vehicles: Theoretical Analysis and an Almost Optimal Online Algorithm  

E-Print Network (OSTI)

Battery Utilization in Electric Vehicles: Theoretical Analysis and an Almost Optimal Online Algorithm Ron Adany Tami Tamir Abstract We consider the problem of utilizing a pack of m batteries serving among the batteries in the pack. A battery's life depends on the discharge current used for supplying

Tamir, Tami

7

Integration by cell algorithm for Slater integrals in a spline basis  

Science Conference Proceedings (OSTI)

An algorithm for evaluating Slater integrals in a B-spline basis is introduced. Based on the piecewise property of the B-splines, the algorithm divides the two-dimensional (r{sub 1}, r{sub 2}) region into a number of rectangular cells according to the chosen grid and implements the two-dimensional integration over each individual cell using Gaussian quadrature. Over the off-diagonal cells, the integrands are separable so that each two-dimensional cell-integral is reduced to a product of two one-dimensional integrals. Furthermore, the scaling invariance of the B-splines in the logarithmic region of the chosen grid is fully exploited such that only some of the cell integrations need to be implemented. The values of given Slater integrals are obtained by assembling the cell integrals. This algorithm significantly improves the efficiency and accuracy of the traditional method that relies on the solution of differential equations and renders the B-spline method more effective when applied to multi-electron atomic systems.

Qiu, Y.; Fischer, C.F.

1999-12-10T23:59:59.000Z

8

356 BOOK REVIEWS thorough development of the theoretical basis of the icr technique. Chapters 1 and 2  

E-Print Network (OSTI)

356 BOOK REVIEWS thorough development of the theoretical basis of the icr technique. Chapters 1. It is not until the third chapter that the book seems to hit its full stride. Also, for the price of $22.75, one a typed manuscript. The book would be useful for those unfamiliar or slightly familiar with ion cyclotron

Pines, Alexander

9

The Theoretical Basis for the Parameterization of Ice Crystal Habits: Growth by Vapor Deposition  

Science Conference Proceedings (OSTI)

A theoretical analysis of surface kinetic and gas-phase diffusional effects permits the growth rates and habits of ice crystals to be specified in a self-consistent way. The analysis makes use of the fact that the difference between the ...

Jen-Ping Chen; Dennis Lamb

1994-05-01T23:59:59.000Z

10

A priori convergence of the Greedy algorithm for the parametrized reduced basis method  

E-Print Network (OSTI)

The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the ...

Buffa, Annalisa

11

An algorithmic information-theoretic approach to the behavior of financial markets  

E-Print Network (OSTI)

Using frequency distributions of daily closing price sequences of several stock markets, we investigate whether the bias away from an equiprobable sequence distribution, predicted by algorithmic probability, may account for some of the deviation of financial markets from log-normal, and if so for how much of said deviation and over what sequence lengths. Our discussion might constitute a potential starting point for a further investigation of the market as a rule-based system with an 'algorithmic' component, despite its apparent randomness. The use of the theory of algorithmic complexity may supply a set of probing new tools that can be applied to the study of the market price phenomenon. Moreover, the main discussion is cast in terms of assumptions common to areas of economics consistent with an algorithmic view of the market.

Zenil, Hector

2010-01-01T23:59:59.000Z

12

Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study: Basic Concepts and Proofs  

Science Conference Proceedings (OSTI)

We propose a formal generalization for various works dealing with Heuristic Search in State Graphs. This generalization focuses on the properties of the evaluation functions, on the characteristics of the state graphs, on the notion of path length, ... Keywords: admissibility, algorithms A and A*, heuristic search, ordered search

Henri Farreny

1999-10-01T23:59:59.000Z

13

A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm  

Science Conference Proceedings (OSTI)

A graph theoretic approach is proposed to formulate communication graphs that enable ultrafast information distribution. In our earlier work, we reported that Borel Cayley graph (BCG) is a promising candidate as a logical topology for fast information ... Keywords: Borel Cayley graph, Cayley graph, Graph theory, Interconnection networks, Network modeling

Jaewook Yu; Eric Noel; K. Wendy Tang

2010-11-01T23:59:59.000Z

14

Correction of Radar Reflectivity and Differential Reflectivity for Rain Attenuation at X Band. Part I: Theoretical and Empirical Basis  

Science Conference Proceedings (OSTI)

In this two-part paper, a correction for rain attenuation of radar reflectivity (ZH) and differential reflectivity (ZDR) at the X-band wavelength is presented. The correction algorithm that is used is based on the self-consistent method with ...

S-G. Park; V. N. Bringi; V. Chandrasekar; M. Maki; K. Iwanami

2005-11-01T23:59:59.000Z

15

Fast Conversion Algorithms for Orthogonal Polynomials - Computer ...  

E-Print Network (OSTI)

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

16

Scientific Basis and Initial Evaluation of the CLAVR-1 Global Clear/Cloud Classification Algorithm for the Advanced Very High Resolution Radiometer  

Science Conference Proceedings (OSTI)

An algorithm for the remote sensing of global cloud cover using multispectral radiance measurements from the Advanced Very High Resolution Radiometer (AVHRR) on board National Oceanic and Atmospheric Administration (NOAA) polar-orbiting ...

Larry L. Stowe; Paul A. Davis; E. Paul McClain

1999-06-01T23:59:59.000Z

17

Lighting networks: A new approach for designing lighting algorithms  

E-Print Network (OSTI)

In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A recently developed alternative is the design of small and specialized algorithms (lighting operators) together with an infrastructure for creating more complex algorithms by connecting these building blocks--the Lighting Network. In this paper, we discuss the benefits of the Lighting Network approach for designing new and improved global illumination algorithms. Lighting Networks not only provide a flexible infrastructure for new algorithms, they also support a better theoretic understanding of the lighting simulation process. We show that a small number of global light propagation operators already provides the basis for creating many of todays illumination algorithms. Their illumination results are converted into more suitable representations by purely local conversion operators that are specific to an illumination algorithm. Varying the composition of these operators and introducing new elements allows us to create and explore the benefits of new simulation algorithms. We demonstrate the potential of Lighting Networks with several examples, implementing a diverse set of algorithms, such as density estimation, irradiance gradients, and a composite lighting simulation.

Philipp Slusallek; Marc Stamminger; Hans-Peter Seidel

1998-01-01T23:59:59.000Z

18

Groebner Basis Conversion with FGLM - CECM - Simon Fraser ...  

E-Print Network (OSTI)

Groebner Basis Conversion with FGLM. Roman Pearce, MITACS project. Simon Fraser University. The FGLM algorithm of Faugere, Gianni, Lazard and Mora, ...

19

?1 Minimization via Randomized First Order Algorithms  

E-Print Network (OSTI)

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

20

Grey-box radial basis function modelling  

Science Conference Proceedings (OSTI)

A fundamental principle in data modelling is to incorporate available a priori information regarding the underlying data generating mechanism into the modelling process. We adopt this principle and consider grey-box radial basis function (RBF) modelling ... Keywords: Black-box model, Boundary value constraint, Data modelling, Grey-box model, Orthogonal least squares algorithm, Radial basis function network, Symmetry

Sheng Chen; Xia Hong; Chris J. Harris

2011-05-01T23:59:59.000Z

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


21

Dual generalized Bernstein basis  

Science Conference Proceedings (OSTI)

The generalized Bernstein basis in the space @P"n of polynomials of degree at most n, being an extension of the q-Bernstein basis introduced by Philips [Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511-518], is given by the ... Keywords: Bernstein basis, Big q-Jacobi polynomials, Discrete Bernstein basis, Dual basis, Generalized Bernstein basis, Little q-Jacobi polynomials, Shifted Jacobi polynomials, q -Bernstein basis

Stanis?aw Lewanowicz; Pawe? Wo?ny

2006-02-01T23:59:59.000Z

22

Algorithms and Representations for Visual Recognition  

E-Print Network (OSTI)

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

Maji, Subhransu

2011-01-01T23:59:59.000Z

23

Distributed Basis Pursuit  

E-Print Network (OSTI)

consequence, many energy-aware algorithms and protocols for wireless sensor ... and the received signals, the Green's function of the model, represented by x ...

24

lattice basis - CECM  

E-Print Network (OSTI)

Discover an identity using lattice basis reduction. Find integers a and b such that a*Zeta(50)+b*Pi^50 = 0 using lattice basis reduction . First try using quadruple ...

25

Beyond Design Basis Events  

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

Beyond Design Basis Events Beyond Design Basis Events Following the March 2011 Fukushima Daiichi nuclear plant accident in Japan, DOE embarked upon several initiatives to investigate the safety posture of its nuclear facilities relative to beyond design basis events (BDBEs). These initiatives included issuing Safety Bulletin 2011-01, Events Beyond Design Safety Basis Analysis, and conducting two DOE nuclear safety workshops. DOE also issued two reports documenting the results of these initiatives: Review of Requirements and Capabilities for Analyzing and Responding to BDBEs, August 2011, and Report to the Secretary of Energy on Beyond Design Basis Event Pilot Evaluations, Results and Recommendations for Improvements to Enhance Nuclear Safety at DOE Nuclear Facilities, January 2013.

26

Nonlinear piecewise polynomial approximation: Theory and Algorithms  

E-Print Network (OSTI)

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

Karaivanov, Borislav

27

Gradient based variable forgetting factor RLS algorithm  

Science Conference Proceedings (OSTI)

An accurate new variable forgetting factor recursive least-square adaptive algorithm is derived. An improved mean square behaviour analysis is presented, which shows that the theoretical analysis and the simulation results are close to each other. The ... Keywords: RLS algorithm, adaptive filters, variable forgetting factor

C. F. So; S. C. Ng; S. H. Leung

2003-06-01T23:59:59.000Z

28

Safety Basis Report  

SciTech Connect

As part of the internal Integrated Safety Management Assessment verification process, it was determined that there was a lack of documentation that summarizes the safety basis of the current Yucca Mountain Project (YMP) site characterization activities. It was noted that a safety basis would make it possible to establish a technically justifiable graded approach to the implementation of the requirements identified in the Standards/Requirements Identification Document. The Standards/Requirements Identification Documents commit a facility to compliance with specific requirements and, together with the hazard baseline documentation, provide a technical basis for ensuring that the public and workers are protected. This Safety Basis Report has been developed to establish and document the safety basis of the current site characterization activities, establish and document the hazard baseline, and provide the technical basis for identifying structures, systems, and components (SSCs) that perform functions necessary to protect the public, the worker, and the environment from hazards unique to the YMP site characterization activities. This technical basis for identifying SSCs serves as a grading process for the implementation of programs such as Conduct of Operations (DOE Order 5480.19) and the Suspect/Counterfeit Items Program. In addition, this report provides a consolidated summary of the hazards analyses processes developed to support the design, construction, and operation of the YMP site characterization facilities and, therefore, provides a tool for evaluating the safety impacts of changes to the design and operation of the YMP site characterization activities.

R.J. Garrett

2002-01-14T23:59:59.000Z

29

Nuclear Facility Safety Basis  

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

Safety Basis Safety Basis FUNCTIONAL AREA GOAL: A fully compliant Nuclear Facility Safety Basis. Program is implemented and maintained across the site. REQUIREMENTS: ï‚· 10 CFR 830 Subpart B Guidance: ï‚· DOE STD 3009 ï‚· DOE STD 1104 ï‚· DOE STD ï‚· DOE G 421.1-2 Implementation Guide For Use in Developing Documented Safety Analyses To Meet Subpart B Of 10 CFR 830 ï‚· DOE G 423.1-1 Implementation Guide For Use In Developing Technical Safety Requirements ï‚· DOE G 424.1-1 Implementation Guide For Use In Addressing Unreviewed Safety Question Requirements Performance Objective 1: Contractor Program Documentation The site contractor has developed an up-to-date, comprehensive, compliant, documented nuclear facility safety basis and associated implementing mechanisms and procedures for all required nuclear facilities and activities (10 CFR

30

Quantum Public-Key Encryption with Information Theoretic Security  

E-Print Network (OSTI)

We propose a definition for the information theoretic security of a quantum public-key encryption scheme, and present bit-oriented and two-bit-oriented encryption schemes satisfying our security definition via the introduction of a new public-key algorithm structure. We extend the scheme to a multi-bitoriented one, and conjecture that it is also information theoretically secure, depending directly on the structure of our new algorithm.

Jiangyou Pan; Li Yang

2010-06-02T23:59:59.000Z

31

SNS backscattering spectrometer, BASIS  

Science Conference Proceedings (OSTI)

We describe the design and current performance of the backscattering silicon spectrometer (BASIS), a time-of-flight backscattering spectrometer built at the spallation neutron source (SNS) of the Oak Ridge National Laboratory (ORNL). BASIS is the first silicon-based backscattering spectrometer installed at a spallation neutron source. In addition to high intensity, it offers a high-energy resolution of about 3.5 {mu}eV and a large and variable energy transfer range. These ensure an excellent overlap with the dynamic ranges accessible at other inelastic spectrometers at the SNS.

Mamontov, Eugene [ORNL; Herwig, Kenneth W [ORNL

2011-01-01T23:59:59.000Z

32

Fully complex-valued radial basis function networks: Orthogonal least squares regression and classification  

Science Conference Proceedings (OSTI)

We consider a fully complex-valued radial basis function (RBF) network for regression and classification applications. For regression problems, the locally regularised orthogonal least squares (LROLS) algorithm aided with the D-optimality experimental ... Keywords: Classification, Complex-valued radial basis function network, D-optimality experimental design, Fisher ratio of class separability measure, Orthogonal least squares algorithm, Regression

S. Chen; X. Hong; C. J. Harris; L. Hanzo

2008-10-01T23:59:59.000Z

33

A forecasting system for car fuel consumption using a radial basis function neural network  

Science Conference Proceedings (OSTI)

A predictive system for car fuel consumption using a radial basis function (RBF) neural network is proposed in this paper. The proposed work consists of three parts: information acquisition, fuel consumption forecasting algorithm and performance evaluation. ... Keywords: Artificial neural network, Car fuel consumption, Radial basis function algorithm

Jian-Da Wu; Jun-Ching Liu

2012-02-01T23:59:59.000Z

34

A genetic fuzzy radial basis function neural network for structural health monitoring of composite laminated beams  

Science Conference Proceedings (OSTI)

In this paper, a new neural network learning procedure, called genetic fuzzy hybrid learning algorithm (GFHLA) is proposed for training the radial basis function neural network (RBFNN). The method combines the genetic algorithm and fuzzy logic to optimize ... Keywords: Fuzzy logic, Genetic algorithm, RBF neural network, Structural health monitoring

Shi-jie Zheng; Zheng-qiang Li; Hong-tao Wang

2011-09-01T23:59:59.000Z

35

Radioactive Waste Management Basis  

SciTech Connect

The purpose of this Radioactive Waste Management Basis is to describe the systematic approach for planning, executing, and evaluating the management of radioactive waste at LLNL. The implementation of this document will ensure that waste management activities at LLNL are conducted in compliance with the requirements of DOE Order 435.1, Radioactive Waste Management, and the Implementation Guide for DOE Manual 435.1-1, Radioactive Waste Management Manual. Technical justification is provided where methods for meeting the requirements of DOE Order 435.1 deviate from the DOE Manual 435.1-1 and Implementation Guide.

Perkins, B K

2009-06-03T23:59:59.000Z

36

Fluctuations in an Equilibrium Convective Ensemble. Part I: Theoretical Formulation  

Science Conference Proceedings (OSTI)

To provide a theoretical basis for stochastic parameterization of cumulus convection, the equilibrium fluctuations of a field of cumulus clouds under homogeneous large-scale forcing are derived statistically, using the Gibbs canonical ensemble ...

George C. Craig; Brenda G. Cohen

2006-08-01T23:59:59.000Z

37

A hub-based labeling algorithm for shortest paths in road networks  

Science Conference Proceedings (OSTI)

Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While ...

Ittai Abraham; Daniel Delling; Andrew V. Goldberg; Renato F. Werneck

2011-05-01T23:59:59.000Z

38

The viewshed problem: a theoretical analysis and a new algorithm ...  

E-Print Network (OSTI)

Keywords: viewshed analysis on terrains; projection of a triangle; ..... coded in JAVA and run on an Intel Core i7-2630QM CPU 2.00 GHz 8.00 GB RAM PC.

39

Modeling molecular polarizabilities with graph-theoretical concepts  

Science Conference Proceedings (OSTI)

A model study of the molecular polarizabilities of a wide heterogeneous class of organic compounds was carried out. The model of this property was based on graph-theoretical molecular connectivity and pseudoconnectivity basis indices, including the corresponding ... Keywords: complete graphs, core electrons, graph-theoretical connectivity indices, molecular polarizabilities

Lionello Pogliani

2004-12-01T23:59:59.000Z

40

A Radial Basis Function Method for Global Optimization  

Science Conference Proceedings (OSTI)

We introduce a method that aims to find the global minimum of a continuous nonconvex function on a compact subset of \\dRd. It is assumed that function evaluations are expensive and that no additional information is available. ... Keywords: Global optimization, P-algorithm, interpolation, radial basis functions

H.-M. Gutmann

2001-03-01T23:59:59.000Z

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


41

Ensemble of niching algorithms  

Science Conference Proceedings (OSTI)

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

E. L. Yu; P. N. Suganthan

2010-08-01T23:59:59.000Z

42

Basis-Spline Interpolation on the Sphere: Applications to Semi-Lagrangian Advection  

Science Conference Proceedings (OSTI)

An algorithm for the interpolation of data on a colatitude–longitude grid is presented. The method employs periodic tensor product cubic basis splines (B splines) and requires no special assumptions about function derivatives at the poles. The ...

P. A. Makar; S. R. Karpik

1996-01-01T23:59:59.000Z

43

2D Euclidean distance transform algorithms: A comparative survey  

Science Conference Proceedings (OSTI)

The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) ... Keywords: Dijkstra's algorithm, Distance transform, computational geometry, exact Euclidean distance map, performance evaluation, shape analysis

Ricardo Fabbri; Luciano Da F. Costa; Julio C. Torelli; Odemir M. Bruno

2008-02-01T23:59:59.000Z

44

Mixtures of truncated basis functions  

Science Conference Proceedings (OSTI)

In this paper we propose a framework, called mixtures of truncated basis functions (MoTBFs), for representing general hybrid Bayesian networks. The proposed framework generalizes both the mixture of truncated exponentials (MTEs) framework and the Mixture ... Keywords: Approximations, Hybrid Bayesian networks, Inference, Mixtures of truncated basis functions, Mixtures of truncated exponentials

Helge Langseth; Thomas D. Nielsen; Rafael Rum?´; Antonio Salmerón

2012-02-01T23:59:59.000Z

45

A Set Theoretic Approach to Dynamic Robot Localization and Mapping  

Science Conference Proceedings (OSTI)

This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theoretic approach to the problem is presented. Computationally efficient algorithms ... Keywords: SLAM, localization, mapping, set membership, uncertainty

M. Di Marco; A. Garulli; A. Giannitrapani; A. Vicino

2004-01-01T23:59:59.000Z

46

Los Alamos National Laboratory Fission Basis  

Science Conference Proceedings (OSTI)

This report is an overview of two main publications that provide a comprehensive review of the Los Alamos National Laboratory (LANL) Fission Basis. The first is the experimental paper, {sup F}ission Product Data Measured at Los Alamos for Fission Spectrum and Thermal Neutrons on {sup 239}Pu, {sup 235}U, {sup 238}U, [Selby, H. D., et al., Nucl. Data Sheets, Vol. 111 2010, pp. 2891-2922] and the second is the theoretical paper, Fission Product Yields from Fission Spectrum n+ {sup 239}Pu for ENDF/B-VII.1, [Chadwick, M. B., et al., Nucl. Data Sheets, Vol. 111, 2010, pp. 2923-2964]. One important note is that none of this work would have been possible without the great documentation of the experimental details and results by G.W. Knobeloch, G. Butler, C.I. Browne, B. Erdal, B. Bayhurst, R. Prestwood, V. Armijo, J. Hasty and many others. (authors)

Keksis, A.L.; Chadwick, M.B.; Selby, H.D.; Mac Innes, M.R.; Barr, D.W.; Meade, R.A.; Burns, C.J.; Wallstrom, T.C. [Los Alamos National Laboratory, NM 87545 (United States)

2011-07-01T23:59:59.000Z

47

Reconstruction algorithms for MRI  

E-Print Network (OSTI)

This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...

Bilgic?, Berkin

2013-01-01T23:59:59.000Z

48

Grover search algorithm  

E-Print Network (OSTI)

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

Borbely, Eva

2007-01-01T23:59:59.000Z

49

Quantum Algorithm Zoo  

Science Conference Proceedings (OSTI)

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

2013-11-11T23:59:59.000Z

50

ALGORITHM FOR ACCNT  

Energy Science and Technology Software Center (OSTI)

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

51

Influence of machine organization on algorithms  

SciTech Connect

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

Owens, J.L.

1973-05-01T23:59:59.000Z

52

Optimal ratio between phase basis and bit basis in QKD  

E-Print Network (OSTI)

In the original BB84 protocol, we use the bit basis and the phase basis with the equal probability. Lo et al (J. of Cryptology, 18, 133-165 (2005)) proposed to modify the ratio between two bases for increasing the final key generation rate in the asymptotic setting. In the present letter, in order to treat this problem the non-asymptotic setting, we optimize the ratio between the two bases with exponential constraints for Eve's information distinguishability and the final error probability.

Hayashi, Masahito

2008-01-01T23:59:59.000Z

53

Population Monte Carlo algorithms  

E-Print Network (OSTI)

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

Yukito IBA

2000-08-16T23:59:59.000Z

54

Theoretical Overview of Cosmic Microwave Background Anisotropy  

E-Print Network (OSTI)

The theoretical basis for the prediction of anisotropies in the cosmic microwave background is very well developed. Very low amplitude density and temperature perturbations produce small gravitational effects, leading to an anisotropy that is a combination of temperature fluctuations at the surface of last scattering and gravitational redshifts both at last scattering and along the path to the observer. All of the primary anisotropy can be handled by linear perturbation theory, which allows a very accurate calculation of the predicted anisotropy from different models of the Universe.

E. L. Wright

2003-05-29T23:59:59.000Z

55

Dark matter: Theoretical perspectives  

SciTech Connect

I both review and make the case for the current theoretical prejudice: a flat Universe whose dominant constituent is nonbaryonic dark matter, emphasizing that this is still a prejudice and not yet fact. The theoretical motivation for nonbaryonic dark matter is discussed in the context of current elementary-particle theory, stressing that: (1) there are no dark matter candidates within the standard model of particle physics; (2) there are several compelling candidates within attractive extensions of the standard model of particle physics; and (3) the motivation for these compelling candidates comes first and foremost from particle physics. The dark-matter problem is now a pressing issue in both cosmology and particle physics, and the detection of particle dark matter would provide evidence for ``new physics.`` The compelling candidates are: a very light axion ( 10{sup {minus}6} eV--10{sup {minus}4} eV); a light neutrino (20 eV--90 eV); and a heavy neutralino (10 GeV--2 TeV). The production of these particles in the early Universe and the prospects for their detection are also discussed. I briefly mention more exotic possibilities for the dark matter, including a nonzero cosmological constant, superheavy magnetic monopoles, and decaying neutrinos.

Turner, M.S. [Chicago Univ., IL (United States). Enrico Fermi Inst.]|[Fermi National Accelerator Lab., Batavia, IL (United States)

1993-01-01T23:59:59.000Z

56

Theoretical Physics in Cellular Biology  

E-Print Network (OSTI)

Theoretical Physics in Cellular Biology: Some Illustrative Case Studies Living matter obeys the laws of physics, and the principles and methods of theoretical physics ought to find useful application observation, I will describe a few specific instances where approaches inspired by theoretical physics allow

57

Facility worker technical basis document  

SciTech Connect

This report documents the technical basis for facility worker safety to support the Tank Farms Documented Safety Analysis and described the criteria and methodology for allocating controls to hazardous conditions with significant facility worker consequences and presents the results of the allocation.

EVANS, C.B.

2003-03-21T23:59:59.000Z

58

Theoretical nuclear physics  

SciTech Connect

This report discusses the following topics: Exact 1-loop vacuum polarization effects in 1 + 1 dimensional QHD; exact 1-fermion loop contributions in 1 + 1 dimensional solitons; exact scalar 1-loop contributions in 1 + 3 dimensions; exact vacuum calculations in a hyper-spherical basis; relativistic nuclear matter with self- consistent correlation energy; consistent RHA-RPA for finite nuclei; transverse response functions in the {triangle}-resonance region; hadronic matter in a nontopological soliton model; scalar and vector contributions to {bar p}p {yields} {bar {Lambda} {Lambda}} reaction; 0+ and 2+ strengths in pion double-charge exchange to double giant-dipole resonances; and nucleons in a hybrid sigma model including a quantized pion field.

Rost, E.; Shephard, J.R.

1992-08-01T23:59:59.000Z

59

Cryptographic Hash Algorithm Competition  

Science Conference Proceedings (OSTI)

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

2013-08-01T23:59:59.000Z

60

FACILITY WORKER TECHNICAL BASIS DOCUMENT  

Science Conference Proceedings (OSTI)

This technical basis document was developed to support RPP-13033, ''Tank Farms Documented Safety Analysis (DSA). It describes the criteria and methodology for allocating controls to hazardous conditions with significant facility worker (FW) consequence and presents the results of the allocation. The criteria and methodology for identifying controls that address FW safety are in accordance with DOE-STD-3009-94, ''Preparation Guide for US Department of Energy Nonreactor Nuclear Facility Documented Safety Analyses''.

SHULTZ, M.V.

2005-03-31T23:59:59.000Z

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


61

Hanford Generic Interim Safety Basis  

SciTech Connect

The purpose of this document is to identify WHC programs and requirements that are an integral part of the authorization basis for nuclear facilities that are generic to all WHC-managed facilities. The purpose of these programs is to implement the DOE Orders, as WHC becomes contractually obligated to implement them. The Hanford Generic ISB focuses on the institutional controls and safety requirements identified in DOE Order 5480.23, Nuclear Safety Analysis Reports.

Lavender, J.C.

1994-09-09T23:59:59.000Z

62

TCAP Aluminium Dissolution Flowsheet Basis  

Science Conference Proceedings (OSTI)

The Actinide Technology Section has proposed the use of an nitric acid HNO3 and potassium fluoride KF flowsheet for stripping palladium Pd from palladium-coated kieselguhr Pd/K and removing aluminum (Al) metal foam from the TCAP coils. The basis for the HNO3-KF flowsheet is drawn from many sources. A brief review of the sources will be presented. The basic flowsheet involves three process steps, each with its own chemistry.

PIERCE, ROBERTA.

2004-03-01T23:59:59.000Z

63

Theoretical basis for extrapolation of calibration data of PTC 6 throat tap nozzles  

SciTech Connect

Equations for the extrapolation of calibration data for ASME/PTC 6 throat tap nozzles are derived from boundary layer theory. Results match published coefficients with a maximum difference of +0.03 per cent. It is also shown that the effects of transition in the boundary layer extend to throat Reynolds numbers in excess of 10,000,000, far beyond the capacity of any known calibration laboratory. The present PTC 6 requirement that calibration data must be in the fully-turbulent range cannot be met with current facilities.

Keyser, D.R. (Naval Air Development Center, Warminster, PA (USA)); Murdock, J.W. (Drexel Univ., Philadelphia, PA (USA))

1990-01-01T23:59:59.000Z

64

Designing Effective Algorithm Visualizations  

E-Print Network (OSTI)

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

Sami Khuri

2001-01-01T23:59:59.000Z

65

Research in Theoretical Nuclear Physics  

SciTech Connect

A theoretical study of problems relevant to the hadron physics program at Jefferson Laboratory and at other laboratories around the world.

Capstick, Simon; Robson, Don

2005-03-18T23:59:59.000Z

66

Motif Discovery Using Evolutionary Algorithms  

Science Conference Proceedings (OSTI)

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

Linlin Shao; Yuehui Chen; Ajith Abraham

2009-12-01T23:59:59.000Z

67

Center for Theoretical and Computational Materials Science ...  

Science Conference Proceedings (OSTI)

NIST/MML Center for Theoretical and Computational Materials Science. Mission. ... Center for Theoretical and Computational Materials Science ...

2013-09-04T23:59:59.000Z

68

The reduced basis method for the electric field integral equation  

Science Conference Proceedings (OSTI)

We introduce the reduced basis method (RBM) as an efficient tool for parametrized scattering problems in computational electromagnetics for problems where field solutions are computed using a standard Boundary Element Method (BEM) for the parametrized electric field integral equation (EFIE). This combination enables an algorithmic cooperation which results in a two step procedure. The first step consists of a computationally intense assembling of the reduced basis, that needs to be effected only once. In the second step, we compute output functionals of the solution, such as the Radar Cross Section (RCS), independently of the dimension of the discretization space, for many different parameter values in a many-query context at very little cost. Parameters include the wavenumber, the angle of the incident plane wave and its polarization.

Fares, M., E-mail: fares@cerfacs.f [2 Avenue Gaspard Coriolis, 31057 Toulouse Cedex 01 (France); Hesthaven, J.S., E-mail: Jan_Hesthaven@Brown.ed [Division of Applied Mathematics, Brown University, Box F, Providence, RI 02912 (United States); Maday, Y., E-mail: maday@ann.jussieu.f [Laboratoire Jacques-Louis Lions, Universite Pierre et Marie Curie, Boite courrier 18, 75252 Paris Cedex 05 (France); Stamm, B., E-mail: stamm@math.berkeley.ed [Department of Mathematics, University of California, Berkeley, CA 94720 (United States)

2011-06-20T23:59:59.000Z

69

BASIS Equipment | ORNL Neutron Sciences  

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

Equipment Equipment BASIS Schematic Schematic of the SNS Backscattering Spectrometer. Helium dewer cooling a sample Helium dewer cooling a sample (bird's eye view). The heart of the work in a typical experiment is setting up the sample in the desired environment. A typical neutron sample ranging from a millimeter to a few centimeters is placed in a specialized cylindrical can and sealed. For liquids, the backscattering instrument often uses an annular can, created by placing a smaller can within a larger can and inserting the liquid sample between the two cans. This picture shows a helium dewer cooling the environment encompassing the sample can, which has been lowered into the beam from the top of the scattering tank. Crystals Crystals. The backscattering spectrometer is defined by the reflection of specific

70

Internal dosimetry technical basis manual  

Science Conference Proceedings (OSTI)

The internal dosimetry program at the Savannah River Site (SRS) consists of radiation protection programs and activities used to detect and evaluate intakes of radioactive material by radiation workers. Examples of such programs are: air monitoring; surface contamination monitoring; personal contamination surveys; radiobioassay; and dose assessment. The objectives of the internal dosimetry program are to demonstrate that the workplace is under control and that workers are not being exposed to radioactive material, and to detect and assess inadvertent intakes in the workplace. The Savannah River Site Internal Dosimetry Technical Basis Manual (TBM) is intended to provide a technical and philosophical discussion of the radiobioassay and dose assessment aspects of the internal dosimetry program. Detailed information on air, surface, and personal contamination surveillance programs is not given in this manual except for how these programs interface with routine and special bioassay programs.

Not Available

1990-12-20T23:59:59.000Z

71

Theoretical Biology and Biophysics, T-6: Theoretical, T: LANL...  

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

Leader (Acting) Ben McMahon Administration Jenny Esch Andie McLaughlin-Kysar Office Location TA-3, Bldg 410, Rm 164 Theoretical Biology and Biophysics, T-6 T-6 focuses on the...

72

Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts  

Science Conference Proceedings (OSTI)

The Schoof-Elkies-Atkin algorithm is the best known method for counting the number of points of an elliptic curve defined over a finite field of large characteristic. We use Abelian properties of division polynomials to design a fast theoretical and ... Keywords: SEA algorithm, elliptic curves, finite fields

P. Mihailescu; F. Morain; É. Schost

2007-07-01T23:59:59.000Z

73

Performance Evaluation of Adaptive Ramp-Metering Algorithms Using Microscopic Traffic Simulation Model  

E-Print Network (OSTI)

Performance Evaluation of Adaptive Ramp-Metering Algorithms Using Microscopic Traffic Simulation metering has undergone significant theoretical developments in recent years. However, the applicability been used in an evaluation study of three well-known adaptive ramp-metering algorithms: ALINEA, BOTTLE

Levinson, David M.

74

BASIS Set Exchange (BSE): Chemistry Basis Sets from the William R. Wiley Environmental Molecular Sciences Laboratory (EMSL) Basis Set Library  

DOE Data Explorer (OSTI)

The Basis Set Exchange (BSE) provides a web-based user interface for downloading and uploading Gaussian-type (GTO) basis sets, including effective core potentials (ECPs), from the EMSL Basis Set Library. It provides an improved user interface and capabilities over its predecessor, the EMSL Basis Set Order Form, for exploring the contents of the EMSL Basis Set Library. The popular Basis Set Order Form and underlying Basis Set Library were originally developed by Dr. David Feller and have been available from the EMSL webpages since 1994. BSE not only allows downloading of the more than 200 Basis sets in various formats; it allows users to annotate existing sets and to upload new sets. (Specialized Interface)

Feller, D; Schuchardt, Karen L.; Didier, Brett T.; Elsethagen, Todd; Sun, Lisong; Gurumoorthi, Vidhya; Chase, Jared; Li, Jun

75

Theoretical Studies in Chemical Kinetics  

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

Theoretical Studies in Chemical Kinetics ^ ^ iCi| Theoretical Studies in Chemical Kinetics ^ ^ iCi| under AEC Contract A T (30-1)-3780 " â–  ' Annual Report (1970) Principal In-vestigator: Martin Karpins Institution: Harvard University The research performed under this contract can best be sunmarized under several headings. (a) Alkali-Halideg Alkali-Halide (MX^ M*X*) Exchange Reactions. This project is being continued. A careful study of certain

76

Existing reactor expansion study basis  

SciTech Connect

The latest HAPO Five Year Program review, HW-59633, forecasts substantial increases in Pu production from the eight existing Hanford reactors over the next several years. These production increases would be attained by a combination of several methods which include increased reactor power levels resulting from higher process water flow rates and coolant bulk outlet temperatures, improved time operated efficiency, higher conversion ratios, and reduced transient reactivity losses. In order to provide a realistic basis for budgeting to meet these or other increased production goals, it is necessary that a study program be undertaken to determine in general terms the plant changes required to support these forecasted levels, to evaluate the economic and technical feasibility of achieving the process conditions, and to present an integrated program for achieving these objectives. This study program will necessarily consider the interrelated effects of a number of various facets of reactor and water plant process conditions, operational requirements, and proposed development programs. The purpose of this document is to present a plan for the execution of the proposed study. Included in this outline are a review of the basic study considerations, problem assignments and schedules, and manpower and cost estimates for the performance of the study.

Heacock, H.W.

1959-06-24T23:59:59.000Z

77

Advanced Fuel Cycle Cost Basis  

SciTech Connect

This report, commissioned by the U.S. Department of Energy (DOE), provides a comprehensive set of cost data supporting a cost analysis for the relative economic comparison of options for use in the Advanced Fuel Cycle Initiative (AFCI) Program. The report describes the AFCI cost basis development process, reference information on AFCI cost modules, a procedure for estimating fuel cycle costs, economic evaluation guidelines, and a discussion on the integration of cost data into economic computer models. This report contains reference cost data for 25 cost modules—23 fuel cycle cost modules and 2 reactor modules. The cost modules were developed in the areas of natural uranium mining and milling, conversion, enrichment, depleted uranium disposition, fuel fabrication, interim spent fuel storage, reprocessing, waste conditioning, spent nuclear fuel (SNF) packaging, long-term monitored retrievable storage, near surface disposal of low-level waste (LLW), geologic repository and other disposal concepts, and transportation processes for nuclear fuel, LLW, SNF, transuranic, and high-level waste.

D. E. Shropshire; K. A. Williams; W. B. Boore; J. D. Smith; B. W. Dixon; M. Dunzik-Gougar; R. D. Adams; D. Gombert; E. Schneider

2008-03-01T23:59:59.000Z

78

Advanced Fuel Cycle Cost Basis  

SciTech Connect

This report, commissioned by the U.S. Department of Energy (DOE), provides a comprehensive set of cost data supporting a cost analysis for the relative economic comparison of options for use in the Advanced Fuel Cycle Initiative (AFCI) Program. The report describes the AFCI cost basis development process, reference information on AFCI cost modules, a procedure for estimating fuel cycle costs, economic evaluation guidelines, and a discussion on the integration of cost data into economic computer models. This report contains reference cost data for 26 cost modules—24 fuel cycle cost modules and 2 reactor modules. The cost modules were developed in the areas of natural uranium mining and milling, conversion, enrichment, depleted uranium disposition, fuel fabrication, interim spent fuel storage, reprocessing, waste conditioning, spent nuclear fuel (SNF) packaging, long-term monitored retrievable storage, near surface disposal of low-level waste (LLW), geologic repository and other disposal concepts, and transportation processes for nuclear fuel, LLW, SNF, and high-level waste.

D. E. Shropshire; K. A. Williams; W. B. Boore; J. D. Smith; B. W. Dixon; M. Dunzik-Gougar; R. D. Adams; D. Gombert

2007-04-01T23:59:59.000Z

79

Advanced Fuel Cycle Cost Basis  

SciTech Connect

This report, commissioned by the U.S. Department of Energy (DOE), provides a comprehensive set of cost data supporting a cost analysis for the relative economic comparison of options for use in the Advanced Fuel Cycle Initiative (AFCI) Program. The report describes the AFCI cost basis development process, reference information on AFCI cost modules, a procedure for estimating fuel cycle costs, economic evaluation guidelines, and a discussion on the integration of cost data into economic computer models. This report contains reference cost data for 25 cost modules—23 fuel cycle cost modules and 2 reactor modules. The cost modules were developed in the areas of natural uranium mining and milling, conversion, enrichment, depleted uranium disposition, fuel fabrication, interim spent fuel storage, reprocessing, waste conditioning, spent nuclear fuel (SNF) packaging, long-term monitored retrievable storage, near surface disposal of low-level waste (LLW), geologic repository and other disposal concepts, and transportation processes for nuclear fuel, LLW, SNF, transuranic, and high-level waste.

D. E. Shropshire; K. A. Williams; W. B. Boore; J. D. Smith; B. W. Dixon; M. Dunzik-Gougar; R. D. Adams; D. Gombert; E. Schneider

2009-12-01T23:59:59.000Z

80

A Class of Semi-Lagrangian Integrated-Mass (SLM) Numerical Transport Algorithms  

Science Conference Proceedings (OSTI)

A class of conservative numerical transport algorithms is developed based on the concept of Lagrangian mass transport between fixed cells in which density distribution is estimated on the basis of local and adjacent gridpoint values. Upstream and ...

J. P. René Laprise; André Plante

1995-02-01T23:59:59.000Z

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


81

The Advantages and Disadvantages of Statistically Derived–Empirically Calibrated Passive Microwave Algorithms for Rainfall Estimation  

Science Conference Proceedings (OSTI)

This paper reviews the basis of passive microwave algorithms that derive rainfall rates directly from relationships between brightness temperatures and rainfall rates established by statistical relationships and empirical calibration. The ...

C. Kidd; D. Kniveton; E. C. Barrett

1998-05-01T23:59:59.000Z

82

Basis functions and parameter optimisation in high-order iterative learning control  

Science Conference Proceedings (OSTI)

In this paper a new parameter-optimal high-order Iterative Learning Control (ILC) algorithms is proposed to extend the work of Owens and Feng [Parameter optimisation in iterative learning control. International Journal of Control 14(11), 1059-1069]. ... Keywords: Basis functions, Iterative learning control, Parameter optimisation

J. HäTöNen; D. H. Owens; K. Feng

2006-02-01T23:59:59.000Z

83

Office of Nuclear Facility Basis & Facility Design  

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

Office of Nuclear Safety Basis & Facility Design(HS-31) Reports to the Office of Nuclear Safety About Us The Office of Nuclear Safety Basis & Facility Design establishes safety...

84

Basis of conversion factors for energy equivalents  

Science Conference Proceedings (OSTI)

... Basis of conversion factors for energy equivalents Conversion factors for energy equivalents are derived from the following relations: ...

85

Assignment #1: Developing Algorithms  

E-Print Network (OSTI)

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

Andrew R. Dalton; Andy Dalton (adalton

2007-01-01T23:59:59.000Z

86

Generalized multiscale radial basis function networks  

Science Conference Proceedings (OSTI)

A novel modelling framework is proposed for constructing parsimonious and flexible multiscale radial basis function networks (RBF). Unlike a conventional standard single scale RBF network, where all the basis functions have a common kernel width, the ... Keywords: Model term selection, Neural networks, Nonlinear system identification, Orthogonal least squares, Radial basis functions

Stephen A. Billings; Hua-Liang Wei; Michael A. Balikhin

2007-12-01T23:59:59.000Z

87

AN OPERATIONAL WATER AND ENERGY BALANCE ALGORITHM FOR PUERTO RICO Eric Harmsen  

E-Print Network (OSTI)

twenty-three hydro-climate variables, available to the public on a daily basis (http://pragwater.com/goes-puerto-rico-water-and-energyAN OPERATIONAL WATER AND ENERGY BALANCE ALGORITHM FOR PUERTO RICO Eric Harmsen Department.com In this study an operational water and energy balance algorithm for Puerto Rico (GOES- PRWEB) was developed

Gilbes, Fernando

88

Beyond Design Basis Events | Department of Energy  

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

Beyond Design Basis Events Beyond Design Basis Events Beyond Design Basis Events Beyond Design Basis Events Following the March 2011 Fukushima Daiichi nuclear plant accident in Japan, DOE embarked upon several initiatives to investigate the safety posture of its nuclear facilities relative to beyond design basis events (BDBEs). These initiatives included issuing Safety Bulletin 2011-01, Events Beyond Design Safety Basis Analysis, and conducting two DOE nuclear safety workshops. DOE also issued two reports documenting the results of these initiatives: Review of Requirements and Capabilities for Analyzing and Responding to BDBEs, August 2011, and Report to the Secretary of Energy on Beyond Design Basis Event Pilot Evaluations, Results and Recommendations for Improvements to Enhance Nuclear Safety at DOE Nuclear Facilities,

89

Neighbor List Collision-Driven Molecular Dynamics Simulation for Nonspherical Particles. I. Algorithmic Details II. Applications to Ellipses and Ellipsoids  

E-Print Network (OSTI)

In the first part of a series of two papers, we present in considerable detail a collision-driven molecular dynamics algorithm for a system of nonspherical particles, within a parallelepiped simulation domain, under both periodic or hard-wall boundary conditions. The algorithm extends previous event-driven molecular dynamics algorithms for spheres. We present a novel partial-update near-neighbor list (NNL) algorithm that is superior to previous algorithms at high densities, without compromising the correctness of the algorithm. This efficiency of the algorithm is further increased for systems of very aspherical particles by using bounding sphere complexes (BSC). In the second part of this series of papers we apply the algorithm presented in the first part of this series of papers to systems of hard ellipses and ellipsoids. The theoretical machinery needed to treat such particles, including the overlap potentials, is developed in full detail. We describe an algorithm for predicting the time of collision for tw...

Donev, A; Stillinger, F H; Donev, Aleksandar; Torquato, Salvatore; Stillinger, Frank H.

2004-01-01T23:59:59.000Z

90

Basis for a Rainfall Estimation Technique Using IR–VIS Cloud Classification and Parameters over the Life Cycle of Mesoscale Convective Systems  

Science Conference Proceedings (OSTI)

This paper discusses the basis for a new rainfall estimation method using geostationary infrared and visible data. The precipitation radar on board the Tropical Rainfall Measuring Mission satellite is used to train the algorithm presented (which ...

G. Delgado; Luiz A. T. Machado; Carlos F. Angelis; Marcus J. Bottino; Á. Redaño; J. Lorente; L. Gimeno; R. Nieto

2008-05-01T23:59:59.000Z

91

Supercomputer requirements for theoretical chemistry  

DOE Green Energy (OSTI)

Many problems important to the theoretical chemist would, if implemented in their full complexity, strain the capabilities of today's most powerful computers. Several such problems are now being implemented on the CRAY-1 computer at Los Alamos. Examples of these problems are taken from the fields of molecular electronic structure calculations, quantum reactive scattering calculations, and quantum optics. 12 figures.

Walker, R.B.; Hay, P.J.; Galbraith, H.W.

1980-01-01T23:59:59.000Z

92

Genetic algorithms and artificial life  

Science Conference Proceedings (OSTI)

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

Melanie Mitchell; Stephanie Forrest

1994-01-01T23:59:59.000Z

93

A Robust C-band Hydrometeor Identification Algorithm and Application to a Long Term Polarimetric Radar Data Set  

Science Conference Proceedings (OSTI)

A new ten category, polarimetric-based hydrometeor identification algorithm (HID) for C-band is developed from theoretical scattering simulations including wet snow, hail, and big drops /melting hail. The HID is applied to data from seven monsoon ...

Brenda Dolan; Steven A. Rutledge; S. Lim; V. Chandrasekar; M. Thurai

94

Algorithm Shootout: R versus RHMC  

E-Print Network (OSTI)

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

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

2005-09-30T23:59:59.000Z

95

Optimization Online - ALGORITHM & DOCUMENTATION: MINRES ...  

E-Print Network (OSTI)

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

96

INL FCF Basis Review Follow-up  

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

2: Evaluation Basis Earthquake Event The second Significant Issue related to the EBE event and included several elements, including input parameters to the analysis,...

97

Lawrence Livermore National Laborotory Safety Basis Assessment...  

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

and implementation of safety basis documentation and execution of the unreviewed safety question (USQ) process. SCOPE The scope of this assessment includes the plans,...

98

Lawrence Livermore National Laborotory Safety Basis Assessment...  

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

of the safety basis for LLNL nuclear facilities. It describes the method for categorizing nuclear facilities and summarizes the resulting requirements for the contents of the DSA....

99

Facility Representative Program: Nuclear Safety Basis Fundamentals...  

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

Qualification Information Qualification Standards DOE Order Self-Study Modules DOE Fundamentals Handbooks Nuclear Safety Basis Self-Study Guide Energy Online Courses Available...

100

Order acceptance using genetic algorithms  

Science Conference Proceedings (OSTI)

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

Walter O. Rom; Susan A. Slotnick

2009-06-01T23:59:59.000Z

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


101

A penalized fuzzy clustering algorithm  

Science Conference Proceedings (OSTI)

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

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

2006-12-01T23:59:59.000Z

102

Errors in graph embedding algorithms  

Science Conference Proceedings (OSTI)

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

Wendy Myrvold; William Kocay

2011-03-01T23:59:59.000Z

103

Theoretical Biophysics: Projects D.W. Heermann  

E-Print Network (OSTI)

Theoretical Biophysics: Projects D.W. Heermann Winter term 2010-2011 D.W. Heermann () Theoretical exam (30 min) Songling Li will assist you D.W. Heermann () Theoretical Biophysics: Projects Winter term references to the sources you used. Use Latex. NO LATE REPORT ACCEPTED. D.W. Heermann () Theoretical

Heermann, Dieter W.

104

NIST: Theoretical Dosimetry and Radiation-Transport ...  

Science Conference Proceedings (OSTI)

Theoretical Dosimetry and Radiation-Transport Calculations. Summary: The fundamental photon and charged particle interaction ...

2013-02-27T23:59:59.000Z

105

Property:ExplorationBasis | Open Energy Information  

Open Energy Info (EERE)

ExplorationBasis ExplorationBasis Jump to: navigation, search Property Name ExplorationBasis Property Type Text Description Exploration Basis Why was exploration work conducted in this area (e.g., USGS report of a geothermal resource, hot springs with geothemmetry indicating electrical generation capacity, etc.) Subproperties This property has the following 1 subproperty: M Mercury Vapor At Salt Wells Area (Henkle, Et Al., 2005) Pages using the property "ExplorationBasis" Showing 25 pages using this property. (previous 25) (next 25) 2 2-M Probe Survey At Coso Geothermal Area (1977) + Compare directly shallow temperature results with standard geothermal exploration techniques. 2-M Probe Survey At Coso Geothermal Area (1979) + Correct previously analyzed 2-m probe data

106

Design Basis Threat | National Nuclear Security Administration  

National Nuclear Security Administration (NNSA)

Design Basis Threat | National Nuclear Security Administration Design Basis Threat | National Nuclear Security Administration Our Mission Managing the Stockpile Preventing Proliferation Powering the Nuclear Navy Emergency Response Recapitalizing Our Infrastructure Continuing Management Reform Countering Nuclear Terrorism About Us Our Programs Our History Who We Are Our Leadership Our Locations Budget Our Operations Media Room Congressional Testimony Fact Sheets Newsletters Press Releases Speeches Events Social Media Video Gallery Photo Gallery NNSA Archive Federal Employment Apply for Our Jobs Our Jobs Working at NNSA Blog Design Basis Threat Home > About Us > Our Programs > Nuclear Security > Design Basis Threat Design Basis Threat NNSA has taken aggressive action to improve the security of its nuclear weapons material (often referred to as special nuclear material, or SNM)

107

A Flexible Reservation Algorithm for Advance Network Provisioning  

SciTech Connect

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

Balman, Mehmet; Chaniotakis, Evangelos; Shoshani, Arie; Sim, Alex

2010-04-12T23:59:59.000Z

108

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

Science Conference Proceedings (OSTI)

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

Alaeddin Malek; Maryam Yashtini

2010-01-01T23:59:59.000Z

109

Critical Review of Theoretical Models for Anomalous Effects (Cold Fusion) in Deuterated Metals  

E-Print Network (OSTI)

We briefly summarize the reported anomalous effects in deuterated metals at ambient temperature, commonly known as "Cold Fusion" (CF), with an emphasis on important experiments as well as the theoretical basis for the opposition to interpreting them as cold fusion. Then we critically examine more than 25 theoretical models for CF, including unusual nuclear and exotic chemical hypotheses. We conclude that they do not explain the data.

V. A. Chechin; V. A. Tsarev; M. Rabinowitz; Y. E. Kim

2003-03-22T23:59:59.000Z

110

Algorithmic information theory  

E-Print Network (OSTI)

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

Grunwald, Peter D

2008-01-01T23:59:59.000Z

111

Study of Proposed Internet Congestion Control Algorithms*  

Science Conference Proceedings (OSTI)

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

2013-04-01T23:59:59.000Z

112

A genetic algorithm approach in interface and surface structure optimization  

SciTech Connect

The thesis is divided into two parts. In the first part a global optimization method is developed for the interface and surface structures optimization. Two prototype systems are chosen to be studied. One is Si[001] symmetric tilted grain boundaries and the other is Ag/Au induced Si(111) surface. It is found that Genetic Algorithm is very efficient in finding lowest energy structures in both cases. Not only existing structures in the experiments can be reproduced, but also many new structures can be predicted using Genetic Algorithm. Thus it is shown that Genetic Algorithm is a extremely powerful tool for the material structures predictions. The second part of the thesis is devoted to the explanation of an experimental observation of thermal radiation from three-dimensional tungsten photonic crystal structures. The experimental results seems astounding and confusing, yet the theoretical models in the paper revealed the physics insight behind the phenomena and can well reproduced the experimental results.

Zhang, Jian

2010-05-16T23:59:59.000Z

113

Basis for UCNI | Department of Energy  

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

Basis for UCNI Basis for UCNI Basis for UCNI What documents contain the legal and policy foundations for the UCNI program? Section 148 of the Atomic Energy Act of 1954, as amended (42 U.S.C. 2011 et seq.), is the statutory basis for the UCNI program. 10 CFR Part 1017, Identification and Protection of Unclassified Controlled Nuclear Information specifies many detailed policies and requirements concerning the UCNI program. DOE O 471.1B, Identification and Protection of Unclassified Controlled Nuclear Information, specifies additional policies and requirements concerning the Department of Energy (DOE) UCNI program. UCNI General Guideline, GG-5, is a record of decisions made by the Director, OC, as to what general subject areas are UCNI. Note: GG-5 may only be used by the Director, OC, to make determinations as to whether

114

Basis for UCNI | Department of Energy  

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

and policy foundations for the UCNI program? Section 148 of the Atomic Energy Act of 1954, as amended (42 U.S.C. 2011 et seq.), is the statutory basis for the UCNI program. 10...

115

Multisensor data fusion algorithm development  

Science Conference Proceedings (OSTI)

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

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

1995-12-01T23:59:59.000Z

116

Fossil Maintenance Basis Optimization: Challenges and Strategies  

Science Conference Proceedings (OSTI)

This report covers many of the process challenges and strategies that were encountered and deployed during the implementation and execution of a preventive maintenance basis optimization (MBO) process at fossil generating stations. This MBO process was executed by several Electric Power Research Institutemember (EPRI-member) companies on a fleetwide basis as part of the members' plant reliability optimization (PRO) efforts. The PRO process covers many of the preventive maintenance (PM) programs at multip...

2010-05-27T23:59:59.000Z

117

Static polarizabilities of hydrogen in the B-spline basis set  

Science Conference Proceedings (OSTI)

The static polarizability of the 1s, 2p, and 3d states of the hydrogen atom has been calculated using the B-splines basis set method, and the portion of the polarizability without poles has been calculated using the B-splines Galerkin method. Excellent agreement with exact values has been obtained. The current algorithm improves the efficiency and accuracy over the finite perturbation method. In addition, closure rules are obtained for the static polarizability of these states.

Bhatti, Mohammad I.; Coleman, Kevin D.; Perger, Warren F. [Department of Physics and Geology, University of Texas-Pan American, Edinburg, Texas 78539-2999 (United States); Physics Department, Michigan Technological University, Houghton, Michigan 49931-1295 (United States)

2003-10-01T23:59:59.000Z

118

AN ENGINE OIL LIFE ALGORITHM.  

E-Print Network (OSTI)

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

Bommareddi, Anveshan

2009-01-01T23:59:59.000Z

119

Safety Basis Criteria & Review Approach Documents | Department of Energy  

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

Safety Basis Criteria & Review Approach Documents Safety Basis Criteria & Review Approach Documents Safety Basis Criteria & Review Approach Documents Documents Available for Download CRAD, Safety Basis - Idaho MF-628 Drum Treatment Facility CRAD, Safety Basis - Idaho Accelerated Retrieval Project Phase II CRAD, Safety Basis - Los Alamos National Laboratory TA 55 SST Facility CRAD, Safety Basis - Los Alamos National Laboratory Waste Characterization, Reduction, and Repackaging Facility CRAD, Safety Basis - Oak Ridge National Laboratory High Flux Isotope Reactor CRAD, Safety Basis - Oak Ridge National Laboratory High Flux Isotope Reactor Contractor ORR CRAD, Safety Basis - Oak Ridge National Laboratory TRU ALPHA LLWT Project CRAD, Safety Basis - Y-12 Enriched Uranium Operations Oxide Conversion Facility

120

Multilayer perceptrons and radial basis function neural network methods for the solution of differential equations: A survey  

Science Conference Proceedings (OSTI)

Since neural networks have universal approximation capabilities, therefore it is possible to postulate them as solutions for given differential equations that define unsupervised errors. In this paper, we present a wide survey and classification of different ... Keywords: Backpropagation algorithm, Differential equations, Multilayer perceptron, Neural network, Radial basis functions

Manoj Kumar; Neha Yadav

2011-11-01T23:59:59.000Z

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


121

Theoretical analysis of ARC constriction  

DOE Green Energy (OSTI)

The physics of the thermionic converter is governed by strong electrode-plasma interactions (emissions surface scattering, charge exchange) and weak interactions (diffusion, radiation) at the maximum interelectrode plasma radius. The physical processes are thus mostly convective in thin sheaths in front of the electrodes and mostly diffusive and radiative in the plasma bulk. The physical boundaries are open boundaries to particle transfer (electrons emitted or absorbed by the electrodes, all particles diffusing through some maximum plasma radius) and to convective, conductive and radiative heat transfer. In a first approximation the thermionic converter may be described by a one-dimensional classical transport theory. The two-dimensional effects may be significant as a result of the sheath sensitivity to radial plasma variations and of the strong sheath-plasma coupling. The current-voltage characteristic of the converter is thus the result of an integrated current density over the collector area for which the boundary conditions at each r determine the regime (ignited/unignited) of the local current density. A current redistribution strongly weighted at small radii (arc constriction) limits the converter performance and opens questions on constriction reduction possibilities. The questions addressed are the followng: (1) what are the main contributors to the loss of current at high voltage in the thermionic converter; and (2) is arc constriction observable theoretically and what are the conditions of its occurrence. The resulting theoretical problem is formulated and results are given. The converter electrical current is estimated directly from the electron and ion particle fluxes based on the spatial distribution of the electron/ion density n, temperatures T/sub e/, T/sub i/, electrical voltage V and on the knowledge of the transport coefficients. (WHK)

Stoenescu, M.L.; Brooks, A.W.; Smith, T.M.

1980-12-01T23:59:59.000Z

122

Evaluating learning algorithms and classifiers  

Science Conference Proceedings (OSTI)

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

Niklas Lavesson; Paul Davidsson

2007-04-01T23:59:59.000Z

123

FINANCIAL FORECASTING USING GENETIC ALGORITHMS  

E-Print Network (OSTI)

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

Boetticher, Gary D.

124

Basis for OUO | Department of Energy  

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

Services » Classification » Official Use Only Information » Services » Classification » Official Use Only Information » Basis for OUO Basis for OUO What documents contain the policy foundation for the OUO program? DOE O 471.3 Admin Chg 1, Identifying and Protecting Official Use Only Information. DOE M 471.3-1 Admin Chg 1, Manual for Identifying and Protecting Official Use Only Information. Training & Reference Materials Basis for OUO OUO Review Requirement Access to OUO Protection of OUO Questions about Making OUO Determinations - OUO and the FOIA Exemptions How is a Document Containing OUO Marked? Controlled Unclassified Information and E.O. 13556 Resources for OUO Enforcement Guidance Oversight Reporting Security Classification Classification Training Institute Official Use Only Information Unclassified Controlled Nuclear Information (UCNI)

125

INL FCF Basis Review Follow-up  

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

, 2011 , 2011 Independent Review Report Idaho National Laboratory Fuel Conditioning Facility Safety Basis Review Follow-up PURPOSE The purpose of this follow-up review was to verify how and to what extent Idaho National Laboratory (INL) addressed the Significant Issues that were identified in the April 2010 Independent Oversight report on the INL Fuel Conditioning Facility (FCF) safety basis review, as well as the consideration given to the recommendations that were made. Significant Issues were defined in that report as problems or concerns that affected the validity of the FCF safety basis documentation. The Office of Health, Safety and Security (HSS) fulfilled this objective by reviewing the draft Safety Analysis Report (SAR) for the FCF,

126

Bounds on the generalization ability of Bayesian Inference and Gibbs algorithms  

E-Print Network (OSTI)

Recent theoretical works applying the methods of statistical learning theory have put into relief the interest of old well known learning paradigms such as Bayesian inference and Gibbs algorithms. Sample complexity bounds have been given for such paradigms in the zero error case. This paper studies the behavior of these algorithms without this assumption. Results include uniform convergence of Gibbs algorithm towards Bayesian inference, rate of convergence of the empirical loss towards the generalization loss, convergence of the generalization error towards the optimal loss in the underlying class of functions.

Olivier Teytaud; Hélène Paugam-Moisy; Proceedings Of Icann; Olivier Teytaud

2001-01-01T23:59:59.000Z

127

Theoretical particle physics, Task A  

Science Conference Proceedings (OSTI)

This report briefly discusses the following topics: The Spin Structure of the Nucleon; Solitons and Discrete Symmetries; Baryon Chiral Perturbation Theory; Constituent Quarks as Collective Excitations; Kaon Condensation; Limits on Neutrino Masses; The 17 KeV Neutrino and Majoron Models; The Strong CP Problem; Renormalization of the CP Violating {Theta} Parameter; Weak Scale Baryogenesis; Chiral Charge in Finite Temperature QED; The Heavy Higgs Mass Bound; The Heavy Top Quark Bound; The Heavy Top Quark Condensate; The Heavy Top Quark Vacuum Instability; Phase Diagram of the Lattice Higgs-Yukawa Model; Anomalies and the Standard Model on the Lattice; Constraint Effective Potential in a Finite Box; Resonance Picture in a Finite Box; Fractal Dimension of Critical Clusters; Goldstone Bosons at Finite Temperature; Cluster Algorithms and Scaling in CP(N) Models; Rare Decay Modes of the Z{degrees} Vector Boson; Parity-Odd Spin-Dependent Structure Functions; Radiative Corrections, Top Mass and LEP Data; Supersymmetric Model with the Higgs as a Lepton; Chiral Change Oscillation in the Schwinger Model; Electric Dipole Moment of the Neutron; DOE Grand Challenge Program; and Lattice Quantum Electrodynamics.

Not Available

1991-07-01T23:59:59.000Z

128

A Theoretical and Empirical Study of a Noise-TolerantAlgorithm to Learn Geometric Patterns  

Science Conference Proceedings (OSTI)

Developing the ability to recognize a landmark from a visual image of a robot‘s current location is a fundamental problem in robotics. We describe a way in which the landmark matching problem can be mapped to that of learning a one-dimensional ... Keywords: landmark matching problem, noise-tolerant PAC learning, statistical query model

Sally A. Goldman; Stephen D. Scott

1999-10-01T23:59:59.000Z

129

Coupled-channel continuum eigenchannel basis  

E-Print Network (OSTI)

The goal of this paper is to calculate bound, resonant and scattering states in the coupled-channel formalism without relying on the boundary conditions at large distances. The coupled-channel solution is expanded in eigenchannel bases i.e. in eigenfunctions of diagonal Hamiltonians. Each eigenchannel basis may includes discrete and discretized continuum (real or complex energy) single particle states. The coupled-channel solutions are computed through diagonalization in these bases. The method is applied to a few two-channel problems. The exact bound spectrum of the Poeschl-Teller potential is well described by a basis of real energy continuum states. For the deuteron with the Reid potential the experimental energy and the $S$ and $D$ wave functions content are reproduced in the asymptotic limit of the energy cutoff. For the Noro-Taylor potential, beside the exact bound state energies the resonant state energy is also well reproduced by using the complex energy Berggren basis. It is found that the expansion of the coupled-channel wave functions in these eigenchannel bases require less computational effort than the use of any other basis. The solutions are stable and converge as the energy cutoff increases.

R. M. Id Betan

2013-11-18T23:59:59.000Z

130

The inversion algorithm for digital simulation  

Science Conference Proceedings (OSTI)

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

P. M. Maurer

2006-11-01T23:59:59.000Z

131

Hyperspectral detection algorithms: Use covariances or subspaces?  

E-Print Network (OSTI)

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

Manolakis, Dimitris G.

132

Natural algorithms and influence systems  

E-Print Network (OSTI)

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

Bernard Chazelle

2012-01-01T23:59:59.000Z

133

Information-Theoretic Analysis of an Energy Harvesting Communication System  

E-Print Network (OSTI)

In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consumption. Transmission is interrupted if there is not sufficient energy. We address communication with such random energy arrivals in an information-theoretic setting. Based on the classical additive white Gaussian noise (AWGN) channel model, we study the coding problem with random energy arrivals at the transmitter. We show that the capacity of the AWGN channel with stochastic energy arrivals is equal to the capacity with an average power constraint equal to the average recharge rate. We provide two different capacity achieving schemes: {\\it save-and-transmit} and {\\it best-effort-transmit}. Next, we consider the case where energy arrivals have time-varying average in a larger time scale. We derive the optimal offline power allocation for maximum average throughput and provide an algorithm that finds the optimal power allocation.

Ozel, Omur

2010-01-01T23:59:59.000Z

134

A polynomial projection algorithm for linear programming  

E-Print Network (OSTI)

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

135

The Speed of Shor's R-algorithm  

E-Print Network (OSTI)

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

136

Some Abstract Pivot Algorithms (REVISED)  

E-Print Network (OSTI)

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

Green, Curtis

137

Bayesian inference algorithm on Raw  

E-Print Network (OSTI)

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

Luong, Alda

2004-01-01T23:59:59.000Z

138

A combinatorial algorithm for Pfaffians  

Science Conference Proceedings (OSTI)

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

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

1999-07-01T23:59:59.000Z

139

NIST: Theory and theoretical input data  

Science Conference Proceedings (OSTI)

... electrodynamic (QED) effects such as self energy and vacuum polarization, and nuclear size and motion effects. The theory and theoretical data ...

140

2005 American Conference on Theoretical Chemistry  

Science Conference Proceedings (OSTI)

The materials uploaded are meant to serve as final report on the funds provided by DOE-BES to help sponsor the 2005 American Conference on Theoretical Chemistry.

Carter, Emily A

2006-11-19T23:59:59.000Z

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


141

Design and analysis of an adaptive object replication algorithm in distributed network systems  

Science Conference Proceedings (OSTI)

In this paper, we propose an adaptive object replication algorithm for distributed network systems, analyze its performance from both theoretical and experimental standpoints. We first present a mathematical cost model that considers all the costs associated ... Keywords: Allocation scheme, Communication cost, Competitive analysis, I/O cost, Object replication

Lin Wujuan; Bharadwaj Veeravalli

2008-06-01T23:59:59.000Z

142

Radioactive Waste Management BasisApril 2006  

Science Conference Proceedings (OSTI)

This Radioactive Waste Management Basis (RWMB) documents radioactive waste management practices adopted at Lawrence Livermore National Laboratory (LLNL) pursuant to Department of Energy (DOE) Order 435.1, Radioactive Waste Management. The purpose of this Radioactive Waste Management Basis is to describe the systematic approach for planning, executing, and evaluating the management of radioactive waste at LLNL. The implementation of this document will ensure that waste management activities at LLNL are conducted in compliance with the requirements of DOE Order 435.1, Radioactive Waste Management, and the Implementation Guide for DOE Manual 435.1-1, Radioactive Waste Management Manual. Technical justification is provided where methods for meeting the requirements of DOE Order 435.1 deviate from the DOE Manual 435.1-1 and Implementation Guide.

Perkins, B K

2011-08-31T23:59:59.000Z

143

Designing Educationally Effective Algorithm Visualizations  

E-Print Network (OSTI)

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

Steven Hansen; N. Hari Narayanan; Mary Hegarty

2002-01-01T23:59:59.000Z

144

Multithreaded Algorithms for Graph Coloring  

SciTech Connect

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

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

2012-10-21T23:59:59.000Z

145

Calculation of calorific values of coals from ultimate analyses: theoretical basis and geochemical implications. Final report. Part 8  

SciTech Connect

The various formulae for calculating calorific values for coals from ultimate analyses depend essentially on a propositon due to Dulong, that the heat of combustion of an organic compound is nearly equal to the heats of combustion of the elements in it, multiplied by their percentage content in the compound in question. This proposition assumes that the enthalpy of decomposition is negligible compared with the heat of combustion. The various published formulae, such as that due to Mott and Spooner, include empirical adjustments to allow for the fact that the enthalpy of formation or decomposition of no organic compound is zero (except rarely by chance). A new equation is proposed, which excludes empirical correction terms but includes a term explicitly related to the enthalpy of decomposition. As expected from the behavior of known compounds, this enthalpy varies with rank, but it also varies at the same level of rank with the geological history of the sample: rank is not the only source of variance in coal properties. The new equation is at least as effective in predicting calorific values for a set of 992 coals as equivalent equations derived for 6 subsets of the coals. On the whole, the distributions of differences between observed and calculated calorific values are skewed to only a small extent. About 86% of the differences lie between -300 and +300 Btu/lb (+- 700 kJ/kg). 10 references, 7 figures, 4 tables.

Given, P.H.; Weldon, D.; Zoeller, J.H.

1984-03-01T23:59:59.000Z

146

Ultrasonic Guided Wave Inspection of Tubing: Volume 2: Theoretical Basis for Ultrasonic Guided Waves as a Tube Inspection Tool  

Science Conference Proceedings (OSTI)

By reducing inspection time and providing the sensitivity necessary to ensure a reliable inspection, ultrasonic guided wave technology has the potential to reduce steam generator inspection costs considerably.

1997-07-17T23:59:59.000Z

147

Bessel-Zernike Discrete Variable Representation Basis  

SciTech Connect

The connection between the Bessel discrete variable basis expansion and a specific form of an orthogonal set of Jacobi polynomials is demonstrated. These so-called Zernike polynomials provide alternative series expansions of suitable functions over the unit interval. Expressing a Bessel function in a Zernike expansion provides a straightforward method of generating series identities. Furthermore, the Zernike polynomials may also be used to efficiently evaluate the Hankel transform for rapidly decaying functions or functions with finite support.

Cerjan, C J

2005-10-24T23:59:59.000Z

148

Structural Basis for Activation of Cholera Toxin  

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

Structural Basis for Activation Structural Basis for Activation of Cholera Toxin Structural Basis for Activation of Cholera Toxin Print Wednesday, 30 November 2005 00:00 Cholera is a serious disease that claims thousands of victims each year in third-world, war-torn, and disaster-stricken nations. The culprit is the bacterium Vibrio cholerae, which can be ingested through contaminated food or water and colonizes the mucous membrane of the human small intestine. There, it secretes cholera toxin (CT), a protein whose A1 subunit (CTA1) triggers a series of events culminating in the massive efflux of electrolytes and water into the intestinal cavity, causing the watery diarrhea characteristic of cholera that can lead to severe dehydration and death. Crystal structures of the CTA1 subunit in complex with its activator molecule (ARF6) reveal that binding of the ARF6 "switch" elicits dramatic changes in CTA1 loop regions, exposing the toxin's active site. The extensive CTA1-ARF6 interface mimics recognition of ARF6's normal cellular protein partners, which suggests that the toxin has evolved to exploit the molecular switch's promiscuous binding properties.

149

Business Case Slide 16: High-Volume: Casks - Basis  

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

Basis Previous Slide Next Slide Table of Contents High-Volume: Casks - Basis Basis Storage casks with high-density shielding can be directly loaded in reactor pools Eliminates a...

150

Compression algorithm for discrete light-cone quantization  

E-Print Network (OSTI)

We adapt the compression algorithm of Weinstein, Auerbach, and Chandra from eigenvectors of spin lattice Hamiltonians to eigenvectors of light-front field-theoretic Hamiltonians. The latter are approximated by the standard discrete light-cone quantization technique, which provides a matrix representation of the Hamiltonian eigenvalue problem. The eigenvectors are represented as singular value decompositions of two-dimensional arrays, indexed by transverse and longitudinal momenta, and compressed by truncation of the decomposition. The Hamiltonian is represented by a rank-four tensor that is decomposed as a sum of contributions factorized into direct products of separate matrices for transverse and longitudinal interactions. The algorithm is applied to a model theory, to illustrate its use.

Xiao Pu; Sophia S. Chabysheva; John R. Hiller

2013-08-22T23:59:59.000Z

151

ORISE: The Medical Basis for Radiation-Accident Preparedness...  

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

The Medical Basis for Radiation-Accident Preparedness: Medical Management Proceedings of the Fifth International REACTS Symposium on the Medical Basis for Radiation-Accident...

152

The Molecular Basis for Water Taste in Drosophila  

E-Print Network (OSTI)

odorant receptors: a molecular basis for odor recognition.J. , Weissman, J. , Julius, D. Molecular basis of infraredDarnell, J. (2000). Molecular Cell Biology, 4th edition.

Cameron, Peter

2010-01-01T23:59:59.000Z

153

Online Monitoring Technical Basis and Analysis Framework for...  

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

Online Monitoring Technical Basis and Analysis Framework for Emergency Diesel Generators-Interim Report for FY 2013 Online Monitoring Technical Basis and Analysis Framework for...

154

The message management asynchronous backtracking algorithm  

Science Conference Proceedings (OSTI)

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

Hong Jiang; Jose M. Vidal

2008-06-01T23:59:59.000Z

155

Combining Genetic Algorithms & Simulation to Search for ...  

Science Conference Proceedings (OSTI)

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

2013-10-24T23:59:59.000Z

156

The powerrank web link analysis algorithm  

Science Conference Proceedings (OSTI)

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

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

2004-05-01T23:59:59.000Z

157

A parallel descent algorithm for convex programming  

Science Conference Proceedings (OSTI)

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

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

1996-01-01T23:59:59.000Z

158

Formal verification of change making algorithms  

Science Conference Proceedings (OSTI)

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

Nadeem Abdul Hamid, Brook Bowers

2013-04-01T23:59:59.000Z

159

Central waste complex interim safety basis  

Science Conference Proceedings (OSTI)

This interim safety basis provides the necessary information to conclude that hazards at the Central Waste Complex are controlled and that current and planned activities at the CWC can be conducted safely. CWC is a multi-facility complex within the Solid Waste Management Complex that receives and stores most of the solid wastes generated and received at the Hanford Site. The solid wastes that will be handled at CWC include both currently stored and newly generated low-level waste, low-level mixed waste, contact-handled transuranic, and contact-handled TRU mixed waste.

Cain, F.G.

1995-05-15T23:59:59.000Z

160

Technical basis for internal dosimetry at Hanford  

SciTech Connect

The Hanford Internal Dosimetry Program, administered by Pacific Northwest Laboratory for the US Department of Energy, provides routine bioassay monitoring for employees who are potentially exposed to radionuclides in the workplace. This report presents the technical basis for routine bioassay monitoring and the assessment of internal dose at Hanford. The radionuclides of concern include tritium, corrosion products (/sup 58/Co, /sup 60/Co, /sup 54/Mn, and /sup 59/Fe), strontium, cesium, iodine, europium, uranium, plutonium, and americium. Sections on each of these radionuclides discuss the sources and characteristics; dosimetry; bioassay measurements and monitoring; dose measurement, assessment, and mitigation; and bioassay follow-up treatment. 64 refs., 42 figs., 118 tabs.

Sula, M.J.; Carbaugh, E.H.; Bihl, D.E.

1989-04-01T23:59:59.000Z

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


161

Technical basis for internal dosimetry at Hanford  

SciTech Connect

The Hanford Internal Dosimetry Program, administered by Pacific Northwest Laboratory for the US Department of Energy, provides routine bioassay monitoring for employees who are potentially exposed to radionuclides in the workplace. This report presents the technical basis for routine bioassay monitoring and the assessment of internal dose at Hanford. The radionuclides of concern include tritium, corrosion products ({sup 58}Co, {sup 60}Co, {sup 54}Mn, and {sup 59}Fe), strontium, cesium, iodine, europium, uranium, plutonium, and americium,. Sections on each of these radionuclides discuss the sources and characteristics; dosimetry; bioassay measurements and monitoring; dose measurement, assessment, and mitigation and bioassay follow-up treatment. 78 refs., 35 figs., 115 tabs.

Sula, M.J.; Carbaugh, E.H.; Bihl, D.E.

1991-07-01T23:59:59.000Z

162

Surety theoretics: The forest or the trees?  

Science Conference Proceedings (OSTI)

Periodically one needs to re-examine the objectives and the efforts associated with a field of study. In the case of surety which comprises, safety, security and reliability one needs to be sure that theoretical efforts support the needs of systems and design engineers in satisfying stakeholder requirements. The current focus in the surety areas does not appear to address the theoretical foundations needed by the systems engineer. Examination of papers and abstracts demonstrate significant effort along the lines of thermal hydraulics, chemistry, structural response, control theory, etc. which are analytical disciplines which provide support for a surety theoretic but do not constitute a theoretic. The representations currently employed, fault trees etc., define static representations of a system, not the dynamic representation characteristic of response in abnormal, hostile or under degrading conditions. Current methodologies would require a semi-infinite set of scenarios to be examined before a system could be certified as satisfying a surety requirement. The elements that are required of a surety theoretic must include: (1) a dynamic representation of the system; (2) the ability to automatically identify terminal states of the system; and (3) determine the probabilities of specified terminal states under dynamic conditions. This paper examines the requirements of a surety theoretic that will support the efforts of the design and development engineer. Speculations then follow on technologies that might provide the theoretical and support foundations needed by the systems engineering community to form a robust surety analysis and design environment.

Senglaub, M.

1997-10-30T23:59:59.000Z

163

Dictionary preconditioning for greedy algorithms  

E-Print Network (OSTI)

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

Karin Schnass; Pierre Vandergheynst

1994-01-01T23:59:59.000Z

164

Structural Basis for Activation of Cholera Toxin  

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

Structural Basis for Activation of Cholera Toxin Print Structural Basis for Activation of Cholera Toxin Print Cholera is a serious disease that claims thousands of victims each year in third-world, war-torn, and disaster-stricken nations. The culprit is the bacterium Vibrio cholerae, which can be ingested through contaminated food or water and colonizes the mucous membrane of the human small intestine. There, it secretes cholera toxin (CT), a protein whose A1 subunit (CTA1) triggers a series of events culminating in the massive efflux of electrolytes and water into the intestinal cavity, causing the watery diarrhea characteristic of cholera that can lead to severe dehydration and death. Crystal structures of the CTA1 subunit in complex with its activator molecule (ARF6) reveal that binding of the ARF6 "switch" elicits dramatic changes in CTA1 loop regions, exposing the toxin's active site. The extensive CTA1-ARF6 interface mimics recognition of ARF6's normal cellular protein partners, which suggests that the toxin has evolved to exploit the molecular switch's promiscuous binding properties.

165

Structural Basis for Activation of Cholera Toxin  

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

Structural Basis for Activation of Cholera Toxin Print Structural Basis for Activation of Cholera Toxin Print Cholera is a serious disease that claims thousands of victims each year in third-world, war-torn, and disaster-stricken nations. The culprit is the bacterium Vibrio cholerae, which can be ingested through contaminated food or water and colonizes the mucous membrane of the human small intestine. There, it secretes cholera toxin (CT), a protein whose A1 subunit (CTA1) triggers a series of events culminating in the massive efflux of electrolytes and water into the intestinal cavity, causing the watery diarrhea characteristic of cholera that can lead to severe dehydration and death. Crystal structures of the CTA1 subunit in complex with its activator molecule (ARF6) reveal that binding of the ARF6 "switch" elicits dramatic changes in CTA1 loop regions, exposing the toxin's active site. The extensive CTA1-ARF6 interface mimics recognition of ARF6's normal cellular protein partners, which suggests that the toxin has evolved to exploit the molecular switch's promiscuous binding properties.

166

Structural Basis for Activation of Cholera Toxin  

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

Structural Basis for Activation of Cholera Toxin Print Structural Basis for Activation of Cholera Toxin Print Cholera is a serious disease that claims thousands of victims each year in third-world, war-torn, and disaster-stricken nations. The culprit is the bacterium Vibrio cholerae, which can be ingested through contaminated food or water and colonizes the mucous membrane of the human small intestine. There, it secretes cholera toxin (CT), a protein whose A1 subunit (CTA1) triggers a series of events culminating in the massive efflux of electrolytes and water into the intestinal cavity, causing the watery diarrhea characteristic of cholera that can lead to severe dehydration and death. Crystal structures of the CTA1 subunit in complex with its activator molecule (ARF6) reveal that binding of the ARF6 "switch" elicits dramatic changes in CTA1 loop regions, exposing the toxin's active site. The extensive CTA1-ARF6 interface mimics recognition of ARF6's normal cellular protein partners, which suggests that the toxin has evolved to exploit the molecular switch's promiscuous binding properties.

167

Theoretical evaluation of R22 and R502 alternatives  

SciTech Connect

The study was conducted using a semi-theoretical model, CYCLE-11, with a pure cross-flow representation of heat transfer in the evaporator and condenser. The Carnahan-Starling-DeSantis equation of state was used for calculating thermodynamic properties. Transport properties were not involved in the simulations. Simulations were conducted for drop-in'' performance, for performance in a modified system to assess the fluids' potentials, and for performance in a modified system equipped with a liquid-line/suction-line heat exchanger. The results - presented on a relative basis to R22 and R502 performance - include the volumetric capacity, coefficient of performance, pressure increase across the compressor, and compressor discharge pressure and temperature.

Domanski, P.A.; Didion, D.A. (National Inst. of Standards and Technology (NEL), Gaithersburg, MD (United States). Building Environment Div.)

1993-01-01T23:59:59.000Z

168

Theoretical evaluation of R22 and R502 alternatives  

SciTech Connect

The study was conducted using a semi-theoretical model, CYCLE-11, with a pure cross-flow representation of heat transfer in the evaporator and condenser. The Carnahan-Starling-DeSantis equation of state was used for calculating thermodynamic properties. Transport properties were not involved in the simulations. Simulations were conducted for drop-in'' performance, for performance in a modified system to assess the fluids' potentials, and for performance in a modified system equipped with a liquid-line/suction-line heat exchanger. The results - presented on a relative basis to R22 and R502 performance - include the volumetric capacity, coefficient of performance, pressure increase across the compressor, and compressor discharge pressure and temperature.

Domanski, P.A.; Didion, D.A. (National Inst. of Standards and Technology (NEL), Gaithersburg, MD (United States). Building Environment Div.)

1993-01-01T23:59:59.000Z

169

An approximate algorithm for the flux from a rectangular volume source  

SciTech Connect

An exact semi-analytic formula for the flux from a rectangular surface source with a slab shield has been derived and the required function table has been calculated. This formula is the basis for an algorithm which gives a good approximation for the flux from a rectangular volume source. No other hand calculation method for this source geometry is available in the literature.

Wallace, O.J.

1994-11-09T23:59:59.000Z

170

Application of RBF Network Based on Immune Algorithm to Predicting of Wastewater Treatment  

Science Conference Proceedings (OSTI)

Wastewater treatment is a nonlinear, time-varing and time- delay process. It is difficult to establish exact mathematic model. A novel radial basis function (RBF) neural network model based on immune algorithm (IA) is presented in this paper. It combines ...

Hongtao Ye; Fei Luo; Yuge Xu

2009-05-01T23:59:59.000Z

171

Sample-based collection and adjustment algorithm for metadata extraction parameter of flexible format document  

Science Conference Proceedings (OSTI)

We propose an algorithm for automatically generating metadata extraction parameters. It first enumerates candidates on the basis of metadata occurrence in training documents, and then examines these candidates to avoid side effects and to maximize effectiveness. ... Keywords: keyword extraction, layout characteristics, logical structure analysis, metadata extraction

Toshiko Matsumoto; Mitsuharu Oba; Takashi Onoyama

2010-06-01T23:59:59.000Z

172

Support vector machines versus back propagation algorithm for oil price prediction  

Science Conference Proceedings (OSTI)

The importance of crude oil in the world economy has made it imperative that efficient models be designed for predicting future prices. Neural networks can be used as prediction models, thus, in this paper we investigate and compare the use of a support ... Keywords: back propagation algorithm, crude oil, neural networks, price prediction, radial basis function, support vector machines

Adnan Khashman; Nnamdi I. Nwulu

2011-05-01T23:59:59.000Z

173

Assessing Beyond Design Basis Seismic Events and Implications on Seismic  

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

Assessing Beyond Design Basis Seismic Events and Implications on Assessing Beyond Design Basis Seismic Events and Implications on Seismic Risk Assessing Beyond Design Basis Seismic Events and Implications on Seismic Risk September 19, 2012 Presenter: Jeffrey Kimball, Technical Specialist (Seismologist) Defense Nuclear Facilities Safety Board Topics Covered: Department of Energy Approach to Natural Phenomena Hazards Analysis and Design (Seismic) Design Basis and Beyond Design Basis Seismic Events Seismic Risk Implications - Key Parameters and Insights Conclusions Assessing Beyond Design Basis Seismic Events and Implications on Seismic Risk More Documents & Publications DOE's Approach to Nuclear Facility Safety Analysis and Management Results from Beyond Design Basis Event Pilots Idaho National Laboratory Advanced Test Reactor Probabilistic Risk

174

Implementation of the Iterative Proportion Fitting Algorithm for Geostatistical Facies Modeling  

SciTech Connect

In geostatistics, most stochastic algorithm for simulation of categorical variables such as facies or rock types require a conditional probability distribution. The multivariate probability distribution of all the grouped locations including the unsampled location permits calculation of the conditional probability directly based on its definition. In this article, the iterative proportion fitting (IPF) algorithm is implemented to infer this multivariate probability. Using the IPF algorithm, the multivariate probability is obtained by iterative modification to an initial estimated multivariate probability using lower order bivariate probabilities as constraints. The imposed bivariate marginal probabilities are inferred from profiles along drill holes or wells. In the IPF process, a sparse matrix is used to calculate the marginal probabilities from the multivariate probability, which makes the iterative fitting more tractable and practical. This algorithm can be extended to higher order marginal probability constraints as used in multiple point statistics. The theoretical framework is developed and illustrated with estimation and simulation example.

Li Yupeng, E-mail: yupeng@ualberta.ca; Deutsch, Clayton V. [University of Alberta (Canada)

2012-06-15T23:59:59.000Z

175

Theoretical foundations for the study of sociomateriality  

Science Conference Proceedings (OSTI)

This paper compares two alternative theoretical foundations upon which the study of sociomateriality can be built: agential realism and critical realism. It begins by providing a brief overview of the sociomaterial perspective on organizational practices ...

Paul M. Leonardi

2013-04-01T23:59:59.000Z

176

Theoretical efficiency of solar thermoelectric energy generators  

E-Print Network (OSTI)

This paper investigates the theoretical efficiency of solar thermoelectric generators (STEGs). A model is established including thermal concentration in addition to optical concentration. Based on the model, the maximum ...

Chen, Gang

177

Radioactive Waste Management BasisSept 2001  

SciTech Connect

This Radioactive Waste Management Basis (RWMB) documents radioactive waste management practices adopted at Lawrence Livermore National Laboratory (LLNL) pursuant to Department of Energy (DOE) Order 435.1, Radioactive Waste Management. The purpose of this RWMB is to describe the systematic approach for planning, executing, and evaluating the management of radioactive waste at LLNL. The implementation of this document will ensure that waste management activities at LLNL are conducted in compliance with the requirements of DOE Order 435.1, Radioactive Waste Management, and the Implementation Guide for DOE manual 435.1-1, Radioactive Waste Management Manual. Technical justification is provided where methods for meeeting the requirements of DOE Order 435.1 deviate from the DOE Manual 435.1-1 and Implementation Guide.

Goodwin, S S

2011-08-31T23:59:59.000Z

178

Review and Approval of Nuclear Facility Safety Basis and Safety Design Basis Documents  

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

SENSITIVE DOE-STD-1104-2009 May 2009 Superseding DOE-STD-1104-96 DOE STANDARD REVIEW AND APPROVAL OF NUCLEAR FACILITY SAFETY BASIS AND SAFETY DESIGN BASIS DOCUMENTS U.S. Department of Energy AREA SAFT Washington, DC 20585 DISTRIBUTION STATEMENT A. Approved for public release; distribution is unlimited. DOE-STD-1104-2009 ii Available on the Department of Energy Technical Standards web page at http://www.hss.energy.gov/nuclearsafety/ns/techstds/ DOE-STD-1104-2009 iii CONTENTS FOREWORD .................................................................................................................................. v INTRODUCTION ..........................................................................................................................

179

Data streams: algorithms and applications  

Science Conference Proceedings (OSTI)

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

S. Muthukrishnan

2005-08-01T23:59:59.000Z

180

Adaptive protection algorithm and system  

Science Conference Proceedings (OSTI)

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

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

2009-04-28T23:59:59.000Z

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


181

Experimental optimization by evolutionary algorithms  

Science Conference Proceedings (OSTI)

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

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

2010-07-01T23:59:59.000Z

182

Robust Algorithms for Object Localization  

Science Conference Proceedings (OSTI)

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

Aaron Wallack; Dinesh Manocha

1998-05-01T23:59:59.000Z

183

Technical Basis for Water Chemistry Control of IGSCC in Boiling ...  

Science Conference Proceedings (OSTI)

... Degradation of Materials in Nuclear Power Systems – Water Reactors ... However, even the utilization of near theoretical conductivity water cannot prevent ...

184

Why is Boris Algorithm So Good?  

SciTech Connect

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

et al, Hong Qin

2013-03-03T23:59:59.000Z

185

The concept of primes and the algorithm for counting the greatest common divisor in Ancient China  

E-Print Network (OSTI)

When people mention the number theoretical achievements in Ancient China, the famous Chinese Remainder Theorem always springs to mind. But, two more of them--the concept of primes and the algorithm for counting the greatest common divisor, are rarely spoken. Some scholars even think that Ancient China has not the concept of primes. The aim of this paper is to show that the concept of primes in Ancient China can be traced back to the time of Confuciusor (about 500 B.C.) or more ago. This implies that the concept of primes in Ancient China is much earlier than the concept of primes in Euclid's \\emph{Elements}(about 300 B.C.) of Ancient Greece. We also shows that the algorithm for counting the greatest common divisor in Ancient China is essentially the Euclidean algorithm or the binary gcd algorithm. Donald E. Knuth said that "the binary gcd algorithm was discovered by J. Stein in 1961". Nevertheless, Knuth was wrong. The ancient Chinese algorithm is clearly much earlier than J. Stein's algorithm.

Zhang, Shaohua

2009-01-01T23:59:59.000Z

186

Parallelizable Bayesian Tomography Algorithms with Rapid, Guaranteed Convergence  

E-Print Network (OSTI)

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

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

2000-01-01T23:59:59.000Z

187

A review of procedures to evolve quantum algorithms  

Science Conference Proceedings (OSTI)

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

Adrian Gepp; Phil Stocks

2009-06-01T23:59:59.000Z

188

Climate Change 2001: The Scientific Basis  

Office of Scientific and Technical Information (OSTI)

Climate Change 2001: Climate Change 2001: Working Group I: The Scientific Basis Get Javascript Other reports in this collection 4. Atmospheric Chemistry and Greenhouse Gases Contents Executive Summary 4.1 Introduction 4.1.1 Sources of Greenhouse Gases 4.1.2 Atmospheric Chemistry and Feedbacks 4.1.3 Trace Gas Budgets and Trends 4.1.4 Atmospheric Lifetimes and Time-Scales 4.2 Trace Gases: Current Observations, Trends and Budgets 4.2.1 Non-CO2 Kyoto Gases 4.2.1.1 Methane (CH4) 4.2.1.2 Nitrous oxide (N2O) 4.2.1.3 Hydrofluorocarbons (HFCs) 4.2.1.4 Perfluorocarbons (PFCs) and sulphur hexafluoride (SF6) 4.2.2 Montreal Protocol Gases and Stratospheric Ozone (O3) 4.2.3 Reactive Gases 4.2.3.1 Carbon monoxide (CO) and hydrogen (H2) 4.2.3.2 Volatile organic compounds (VOC) 4.2.3.3 Nitrogen oxides (NOx)

189

Fun with sub-linear time algorithms  

Science Conference Proceedings (OSTI)

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

Luca Trevisan

2007-06-01T23:59:59.000Z

190

The WSR-88D Rainfall Algorithm  

Science Conference Proceedings (OSTI)

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

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

1998-06-01T23:59:59.000Z

191

The bidimensionality theory and its algorithmic applications  

E-Print Network (OSTI)

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

Hajiaghayi, MohammadTaghi

2005-01-01T23:59:59.000Z

192

An algorithm for minimization of quantum cost  

E-Print Network (OSTI)

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

Anindita Banerjee; Anirban Pathak

2009-10-12T23:59:59.000Z

193

Advanced Encryption Standard Algorithm Validation List  

Science Conference Proceedings (OSTI)

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

194

Technical Basis for U. S. Department of Energy Nuclear Safety...  

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

Technical Basis for U. S. Department of Energy Nuclear Safety Policy, DOE Policy 420.1, 711 Technical Basis for U. S. Department of Energy Nuclear Safety Policy, DOE Policy 420.1,...

195

Business Case Slide 27: High-Value: Semiconductors - Basis for...  

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

Semiconductors - Basis for Use Basis for use DUO2 has good electronic properties for semi-conductor applications Have made and tested a diode and transistor which appear superior...

196

Authorization basis status report (miscellaneous TWRS facilities, tanks and components)  

SciTech Connect

This report presents the results of a systematic evaluation conducted to identify miscellaneous TWRS facilities, tanks and components with potential needed authorization basis upgrades. It provides the Authorization Basis upgrade plan for those miscellaneous TWRS facilities, tanks and components identified.

Stickney, R.G.

1998-04-29T23:59:59.000Z

197

On extremal cases of Hopcroft's algorithm  

Science Conference Proceedings (OSTI)

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

G. Castiglione; A. Restivo; M. Sciortino

2010-08-01T23:59:59.000Z

198

Optimizing genetic algorithm for motif discovery  

Science Conference Proceedings (OSTI)

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

Hongwei Huo; Zhenhua Zhao; Vojislav Stojkovic; Lifang Liu

2010-12-01T23:59:59.000Z

199

Opposition-based artificial bee colony algorithm  

Science Conference Proceedings (OSTI)

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

Mohammed El-Abd

2011-07-01T23:59:59.000Z

200

Applying Adaptive Evolutionary Algorithms to Hard Problems  

E-Print Network (OSTI)

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

Emmerich, Michael

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


201

Project Hanford nuclear facilities list and authorization basis information  

SciTech Connect

Rev. 4 documents and updates the Nuclear Facilities list and associated Authorization Basis (AB) information for applicable Project Hanford facilities.

EVANS, C.B.

1999-03-03T23:59:59.000Z

202

Towards a Number Theoretic Discrete Hilbert Transform  

E-Print Network (OSTI)

This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2. Specifically, the expression for a 16-point transform is provided and results of a few representative signals are provided. The inverse transform is the inverse of the forward 16-point matrix. But at this time the inverse transform is not identical to the forward transform and, therefore, our proposed number theoretic transform must be taken as a provisional result.

Kandregula, Renuka

2009-01-01T23:59:59.000Z

203

NREL: Energy Sciences - Theoretical Materials Science  

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

Computational Materials Science Solid-State Theory Materials Science Hydrogen Technology & Fuel Cells Process Technology & Advanced Concepts Research Staff Computational Science Printable Version Theoretical Materials Science Learn about our research staff including staff profiles, publications, and contact information. Using modern computational techniques, the Theoretical Materials Science Group, within NREL's Chemical and Materials Science Center, applies quantum mechanics to complex materials, yielding quantitative predictions to guide and interact with experimental explorations. Current research focuses on the following efforts: Design new photovoltaic materials that can improve solar cell efficiency and reduce its cost. Explain the underlying physics of new

204

A Cautionary Tale of Two Basis Sets and Graphene  

Science Conference Proceedings (OSTI)

Density functional theory is a leading approach for simulating materials. However, the basis set used in calculations can directly affect our understanding of a material. By comparing two basis sets for graphene, this highlights an important subtle point ... Keywords: Density functional theory, basis set, graphene, electronic structure, computational materials science, scientific computing

Derek Stewart

2012-03-01T23:59:59.000Z

205

Skew-Radial Basis Function Expansions for Empirical Modeling  

Science Conference Proceedings (OSTI)

We propose a skew-radial basis function (sRBF) expansion for the empirical model fitting problem. sRBFs employ a standard radial term, which is now made asymmetric by modulating, or skewing it with another function. The additional parameters in the skewing ... Keywords: data fitting, data interpolation, function approximation, manifold learning, radial basis function, skew-radial basis function

Arta A. Jamshidi; Michael J. Kirby

2009-11-01T23:59:59.000Z

206

Minimal Realizations of Linear Systems: The "Shortest Basis" Approach  

E-Print Network (OSTI)

Given a discrete-time linear system C, a shortest basis for C is a set of linearly independent generators for C with the least possible lengths. A basis B is a shortest basis if and only if it has the predictable span ...

Forney, G. David, Jr.

207

The Rational Hybrid Monte Carlo Algorithm  

E-Print Network (OSTI)

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

M. A. Clark

2006-10-06T23:59:59.000Z

208

Theoretical analysis of inverse weibull distribution  

Science Conference Proceedings (OSTI)

In this study we present the theoretical analysis of Inverse weibull distribution. This paper presents the flexibility of the Inverse weibull distribution that approaches to different distributions. Here we compare the relevant parameters such as shape, ... Keywords: graphically analysis, inverse weibull distribution, simulation analysis

M. Shuaib Khan; G. R. Pasha; Ahmed Hesham Pasha

2008-02-01T23:59:59.000Z

209

Theoretical Studies in Elementary Particle Physics  

SciTech Connect

This final report summarizes work at Penn State University from June 1, 1990 to April 30, 2012. The work was in theoretical elementary particle physics. Many new results in perturbative QCD, in string theory, and in related areas were obtained, with a substantial impact on the experimental program.

Collins, John C.; Roiban, Radu S

2013-04-01T23:59:59.000Z

210

Basis Pursuit based algorithm for intra-voxel recovering information in Alonso Ramirez-Manzanares and Mariano Rivera  

E-Print Network (OSTI)

´irez-Manzanares and Mariano Rivera Centro de Investigaci´on en Matem´aticas A.C. Apdo. Postal 402, Guanajuato, Gto. C.P. 3600

Rivera, Mariano

211

Combining radial basis function neural network and genetic algorithm to improve HDD driver IC chip scale package assembly yield  

Science Conference Proceedings (OSTI)

In recent years, the future trend of micro HDD driver IC for large capacity micro HDD is to become lighter, thinner, shorter and smaller. Among all the options available for micro HDD driver IC's assembly, warpage is an important issue related to micro ... Keywords: Assembly yield, Driver IC, GA, RBFN, Warpage

M. L. Huang; Y. H. Hung

2008-01-01T23:59:59.000Z

212

Dynamic Algorithm for Space Weather Forecasting System  

E-Print Network (OSTI)

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

Fischer, Luke D.

2010-05-01T23:59:59.000Z

213

Beyond Design Basis Events Analysis and Response Information | Department  

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

Beyond Design Basis Events Analysis Beyond Design Basis Events Analysis and Response Information Beyond Design Basis Events Analysis and Response Information September 19-20, 2012 Beyond Design Basis Events Analysis and Response Information DOE's Safety Bulletin No. 2011-01, Events Beyond Design Safety Basis Analysis, March 2011 DOE's Nuclear Safety Workshop Newsletter, June 2011 2011 Nuclear Safety Workshop Presentations, June 2011 Transmittal Memorandum, Report on Review of Requirements and Capabilities for Analyzing and Responding to Beyond Design Basis Events, September 2011 Review of Requirements and Capabilities for Analyzing and Responding to Beyond Design Basis Events, August 2011 NRC Report - Recommendations for Enhancing Reactor Safety in the 21st Century; The Near-Term Task Force Review of Insights from the

214

CRAD, Engineering Design and Safety Basis - December 22, 2009 | Department  

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

Engineering Design and Safety Basis - December 22, 2009 Engineering Design and Safety Basis - December 22, 2009 CRAD, Engineering Design and Safety Basis - December 22, 2009 December 22, 2009 Engineering Design and Safety Basis Inspection Criteria, Inspection Activities, and Lines of Inquiry (HSS CRAD 64-19, Rev. 0) The engineering design and safety basis inspection will evaluate the effectiveness of programs and processes for the design and safety basis of selected safety structures, systems, and components (SSCs) of a nuclear facility. The nuclear facility may be an existing facility, a major modification to an existing facility, or a new facility under construction. Accordingly, the safety basis for the facility, for example, a documented safety analysis (DSA) or a preliminary documented safety analysis (PDSA),

215

CRAD, Engineering Design and Safety Basis - December 22, 2009 | Department  

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

Engineering Design and Safety Basis - December 22, 2009 Engineering Design and Safety Basis - December 22, 2009 CRAD, Engineering Design and Safety Basis - December 22, 2009 December 22, 2009 Engineering Design and Safety Basis Inspection Criteria, Inspection Activities, and Lines of Inquiry (HSS CRAD 64-19, Rev. 0) The engineering design and safety basis inspection will evaluate the effectiveness of programs and processes for the design and safety basis of selected safety structures, systems, and components (SSCs) of a nuclear facility. The nuclear facility may be an existing facility, a major modification to an existing facility, or a new facility under construction. Accordingly, the safety basis for the facility, for example, a documented safety analysis (DSA) or a preliminary documented safety analysis (PDSA),

216

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at Hanford. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with 10 CFR 835, DOELAP, DOE-RL, ORP, PNSO, and Hanford contractor requirements. The dosimetry system is operated by PNNL’s Hanford External Dosimetry Program (HEDP) which provides dosimetry services to all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee (HPDAC) which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since its inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. The first revision to be released through PNNL’s Electronic Records & Information Capture Architecture (ERICA) database was designated Revision 0. Revision numbers that are whole numbers reflect major revisions typically involving significant changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document. Maintenance and distribution of controlled hard copies of the manual by PNNL was discontinued beginning with Revision 0.2. Revision Log: Rev. 0 (2/25/2005) Major revision and expansion. Rev. 0.1 (3/12/2007) Updated Chapters 5, 6 and 9 to reflect change in default ring calibration factor used in HEDP dose calculation software. Factor changed from 1.5 to 2.0 beginning January 1, 2007. Pages on which changes were made are as follows: 5.23, 5.69, 5.78, 5.80, 5.82, 6.3, 6.5, 6.29, and 9.2. Rev 0.2 (8/28/2009) Updated Chapters 3, 5, 6, 8 and 9. Chapters 6 and 8 were significantly expanded. References in the Preface and Chapters 1, 2, 4, and 7 were updated to reflect updates to DOE documents. Approved by HPDAC on 6/2/2009. Rev 1.0 (1/1/2010) Major revision. Updated all chapters to reflect the Hanford site wide implementation on January 1, 2010 of new DOE requirements for occupational radiation protection. The new requirements are given in the June 8, 2007 amendment to 10 CFR 835 Occupational Radiation Protection (Federal Register, June 8, 2007. Title 10 Part 835. U.S., Code of Federal Regulations, Vol. 72, No. 110, 31904-31941). Revision 1.0 to the manual replaces ICRP 26 dosimetry concepts and terminology with ICRP 60 dosimetry concepts and terminology and replaces external dose conversion factors from ICRP 51 with those from ICRP 74 for use in measurement of operational quantities with dosimeters. Descriptions of dose algorithms and dosimeter response characteristics, and field performance were updated to reflect changes in the neutron quality factors used in the measurement of operational quantities.

Rathbone, Bruce A.

2010-01-01T23:59:59.000Z

217

An algorithm for map enumeration  

E-Print Network (OSTI)

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

Virgil U. Pierce

2006-10-19T23:59:59.000Z

218

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

Science Conference Proceedings (OSTI)

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

219

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

Science Conference Proceedings (OSTI)

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

2012-10-09T23:59:59.000Z

220

The Pandora Particle Flow Algorithm  

E-Print Network (OSTI)

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

J. S. Marshall; M. A. Thomson

2013-08-21T23:59:59.000Z

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


221

Implications of Theoretical Ideas Regarding Cold Fusion  

E-Print Network (OSTI)

A lot of theoretical ideas have been floated to explain the so called cold fusion phenomenon. I look at a large subset of these and study further physical implications of the concepts involved. I suggest that these can be tested by other independent physical means. Because of the significance of these the experimentalists are urged to look for these signatures. The results in turn will be important for a better understanding and hence control of the cold fusion phenomenon.

Afsar Abbas

1995-03-29T23:59:59.000Z

222

SRS FTF Section 3116 Basis for Determination | Department of Energy  

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

FTF Section 3116 Basis for Determination FTF Section 3116 Basis for Determination SRS FTF Section 3116 Basis for Determination Basis for Section 3116 Determination for Closure of F-Tank Farm at the Savannah River Site. In accordance with NDAA Section 3116, certain waste from reprocessing of spent nuclear fuel is not high-level waste if the Secretary of Energy, in consultation with the NRC, determines that the criteria in NDAA Section 3116(a) are met. This FTF 3116 Basis Document shows that those criteria are satisfied, to support a determination that the Secretary may make pursuant to NDAA Section 3116. This FTF 3116 Basis Document concerns the stabilized residuals in waste tanks and ancillary structures, those waste tanks, and the ancillary structures (including integral equipment) at the SRS FTF at the time of closure.

223

Results from Beyond Design Basis Event Pilots | Department of Energy  

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

Results from Beyond Design Basis Event Pilots Results from Beyond Design Basis Event Pilots Results from Beyond Design Basis Event Pilots September 19, 2012 Presenter: Mike Hillman, Program Manager, Office of Health, Safety and Security, US Department of Energy Topics covered: Update DOE safety analysis and emergency management requirements/guidance and perform pilot applications Perform system walkdowns and evaluations at several Cat 1 and 2 DOE nuclear facilities to assess potential susceptibilities to natural phenomena hazards and external BDBEs Conduct emergency drills and exercises at DOE sites with nuclear facilities, focusing on BDBEs Results from Beyond Design Basis Event Pilots More Documents & Publications Development of Guidance for Analysis of Beyond Design Basis Events Report to the Secretary of Energy on Beyond Design Basis Event Pilot

224

Evaluation of Authorization Basis Management Systems and Processes...  

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

related to authorization basis was identified in the 1996 Office of Oversight safety management evaluation of the Pantex Plant. The Defense Nuclear Facilities Safety Board (DNFSB)...

225

CRAD, Safety Basis - Y-12 Enriched Uranium Operations Oxide Conversion...  

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

Y-12 Enriched Uranium Operations Oxide Conversion Facility CRAD, Safety Basis - Y-12 Enriched Uranium Operations Oxide Conversion Facility January 2005 A section of Appendix C to...

226

Review of Safety Basis Development for the Savannah River Site...  

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

Department of Energy Subject: Review of Safety Basis Development for the Savannah River Site Salt Waste Processing Facility - Inspection Criteria, Approach, and Line: HS: Rev:...

227

Microsoft Word - Final_SRS_FTF_WD_Basis_March_2012  

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

TED Total Effective Dose TEDE Total Effective Dose Equivalent TER Technical Evaluation Report TNX Training and Experimental Test Facility U.S. United States Basis for Section...

228

CRAD, Review of Safety Basis Development- May 6, 2013  

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

Review of Safety Basis Development for the Los Alamos National Laboratory Transuranic Waste Facility (HSS CRAD 45-59, Rev. 0)

229

Independent Oversight Review of Hanford Tank Farms Safety Basis...  

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

Hanford Tank Farms Safety Basis Amendment for Double-Shell Tank Ventilation System Upgrades November 2011 Office of Safety and Emergency Management Evaluations Office of...

230

Parallel Algorithms for Image Processing on OMC  

Science Conference Proceedings (OSTI)

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

Mary Mehrnoosh Eshaghian

1991-07-01T23:59:59.000Z

231

Theoretical, Methodological, and Empirical Approaches to Cost Savings: A Compendium  

Science Conference Proceedings (OSTI)

This publication summarizes and contains the original documentation for understanding why the U.S. Department of Energy's (DOE's) privatization approach provides cost savings and the different approaches that could be used in calculating cost savings for the Tank Waste Remediation System (TWRS) Phase I contract. The initial section summarizes the approaches in the different papers. The appendices are the individual source papers which have been reviewed by individuals outside of the Pacific Northwest National Laboratory and the TWRS Program. Appendix A provides a theoretical basis for and estimate of the level of savings that can be" obtained from a fixed-priced contract with performance risk maintained by the contractor. Appendix B provides the methodology for determining cost savings when comparing a fixed-priced contractor with a Management and Operations (M&O) contractor (cost-plus contractor). Appendix C summarizes the economic model used to calculate cost savings and provides hypothetical output from preliminary calculations. Appendix D provides the summary of the approach for the DOE-Richland Operations Office (RL) estimate of the M&O contractor to perform the same work as BNFL Inc. Appendix E contains information on cost growth and per metric ton of glass costs for high-level waste at two other DOE sites, West Valley and Savannah River. Appendix F addresses a risk allocation analysis of the BNFL proposal that indicates,that the current approach is still better than the alternative.

M Weimar

1998-12-10T23:59:59.000Z

232

Efficient Algorithms for Modeling Reacting Flows  

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

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

233

Dictionary of Algorithms and Data Structures  

Science Conference Proceedings (OSTI)

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

2013-11-08T23:59:59.000Z

234

A NONSTANDARD SIMPLEX ALGORITHM FOR LINEAR ...  

E-Print Network (OSTI)

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

235

Dictionary of Algorithms and Data Structures  

Science Conference Proceedings (OSTI)

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

2013-08-23T23:59:59.000Z

236

IMPROVED ALGORITHMS FOR CONVEX MINIMIZATION IN ...  

E-Print Network (OSTI)

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

237

Evaluation of On-ramp Control Algorithms  

E-Print Network (OSTI)

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

Jin, Wenlong; Zhang, Michael

2001-01-01T23:59:59.000Z

238

Available Technologies: Algorithm for Flexible Bandwidth ...  

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

239

MEMORANDUM OF UNDERSTANDING Between The Numerical Algorithms...  

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

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

240

Student's algorithm solves real-world problem  

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

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

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


241

BIASED RANDOM-KEY GENETIC ALGORITHMS WITH ...  

E-Print Network (OSTI)

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

242

Solar and Moon Position Algorithm (SAMPA)  

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

243

B. The Multi-objective Genetic Algorithm  

E-Print Network (OSTI)

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

244

Imaging algorithms for geophysical applications of impedance tomography  

SciTech Connect

The methods of impedance tomography may be employed to obtain images of subsurface electrical and conductivity variations. For practical reasons, voltages and currents are usually applied at locations on the ground surface or down a limited number of boreholes, but almost never over the entire surface of the region being investigated. The geophysical inversion process can be facilitated by constructing algorithms adopted to these particular geometries and to the lack of complete surface data. In this paper we assume that the fluctuations in conductivity are small compared to the background value. The imaging of these fluctuations is carried out exactly within the constraints imposed by the problem geometry. Several possible arrangements of injection and monitoring electrodes are considered. In two dimensions include: Cross-line geometry, current input along one line (borehole) and measurements along a separate parallel line. Single-line geometry, injection and monitoring using the same borehole. Surface reflection geometry, all input and measurement along the ground surface. Theoretical and practical limitations on the image quality produced by the algorithms are discussed. They are applied to several sets of simulated data, and the images produced are displayed and analyzed.

Witten, A.J. (Oak Ridge National Lab., TN (United States)); Molyneux, J.E. (Widener Univ., Dept. of Mechanical Engineering, Chester, PA (United States))

1992-06-02T23:59:59.000Z

245

Prediction of Critical Desalination Parameters Using Radial Basis Functions Networks  

Science Conference Proceedings (OSTI)

Prediction of critical desalination parameters (recovery and salt rejection) of two distinct processes based on real operational data is presented. The proposed method utilizes the radial basis function network using data clustering and histogram equalization. ... Keywords: neural network, radial basis, reverse osmosis

Mutaz M. Jafar; Ali Zilouchian

2002-06-01T23:59:59.000Z

246

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm  

Science Conference Proceedings (OSTI)

The Schoof-Elkies-Atkin algorithm is the best known algorithm for counting the number of points of an elliptic curve defined over a finite field of large characteristic. Several practical and asymptotical improvements for the phase called eigenvalue ... Keywords: SEA algorithm, elliptic curves, point counting

P. Gaudry; F. Morain

2006-07-01T23:59:59.000Z

247

CRAD, Facility Safety - Nuclear Facility Safety Basis | Department of  

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

CRAD, Facility Safety - Nuclear Facility Safety Basis CRAD, Facility Safety - Nuclear Facility Safety Basis CRAD, Facility Safety - Nuclear Facility Safety Basis A section of Appendix C to DOE G 226.1-2 "Federal Line Management Oversight of Department of Energy Nuclear Facilities." Consists of Criteria Review and Approach Documents (CRADs) that can be used for assessment of a contractor's Nuclear Facility Safety Basis. CRADs provide a recommended approach and the types of information to gather to assess elements of a DOE contractor's programs. CRAD, Facility Safety - Nuclear Facility Safety Basis More Documents & Publications CRAD, Facility Safety - Unreviewed Safety Question Requirements Site Visit Report, Livermore Site Office - February 2011 FAQS Job Task Analyses - Nuclear Safety Specialist

248

CRAD, Safety Basis - Los Alamos National Laboratory Waste Characterization,  

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

Basis - Los Alamos National Laboratory Waste Basis - Los Alamos National Laboratory Waste Characterization, Reduction, and Repackaging Facility CRAD, Safety Basis - Los Alamos National Laboratory Waste Characterization, Reduction, and Repackaging Facility A section of Appendix C to DOE G 226.1-2 "Federal Line Management Oversight of Department of Energy Nuclear Facilities." Consists of Criteria Review and Approach Documents (CRADs) used for an assessment of the Safety Basis portion of an Operational Readiness Review at the Los Alamos National Laboratory Waste Characterization, Reduction, and Repackaging Facility. CRADs provide a recommended approach and the types of information to gather to assess elements of a DOE contractor's programs. CRAD, Safety Basis - Los Alamos National Laboratory Waste Characterization,

249

Exploring continuum structures with a pseudo-state basis  

SciTech Connect

The ability of a recently developed square-integrable discrete basis to represent the properties of the continuum of a two-body system is investigated. The basis is obtained performing a simple analytic local scale transformation to the harmonic oscillator basis. Scattering phase-shifts and the electric transition probabilities B(E1) and B(E2) have been evaluated for several potentials using the proposed basis. Both quantities are found to be in excellent agreement with the exact values calculated from the true scattering states. The basis has been applied to describe the projectile continuum in the {sup 6}He scattering by {sup 12}C and {sup 208}Pb targets at 240 MeV/nucleon and the {sup 11}Be scattering by {sup 12}C at 67 MeV/nucleon. The calculated breakup differential cross sections are found to be in very good agreement with the available experimental data for these reactions.

Lay, J. A.; Moro, A. M.; Arias, J. M.; Gomez-Camacho, J. [Departamento de FAMN, Facultad de Fisica, Universidad de Sevilla, Apdo. 1065, E-41080 Sevilla (Spain); Departamento de FAMN, Facultad de Fisica, Universidad de Sevilla, Apdo. 1065, E-41080 Sevilla, Spain and Centro Nacional de Aceleradores, Avda. Thomas A. Edison, E-41092, Sevilla (Spain)

2010-08-15T23:59:59.000Z

250

[Experimental and theoretical high energy physics program  

Science Conference Proceedings (OSTI)

Experimental and theoretical high-energy physics research at Purdue is summarized in a number of reports. Subjects treated include the following: the CLEO experiment for the study of heavy flavor physics; gas microstrip detectors; particle astrophysics; affine Kac{endash}Moody algebra; nonperturbative mass bounds on scalar and fermion systems due to triviality and vacuum stability constraints; resonance neutrino oscillations; e{sup +}e{sup {minus}} collisions at CERN; {bar p}{endash}p collisions at FNAL; accelerator physics at Fermilab; development work for the SDC detector at SSC; TOPAZ; D-zero physics; physics beyond the standard model; and the Collider Detector at Fermilab. (RWR)

Finley, J.; Gaidos, J.A.; Loeffler, F.J.; McIlwain, R.L.; Miller, D.H.; Palfrey, T.R.; Shibata, E.I.; Shipsey, I.P.

1993-04-01T23:59:59.000Z

251

The double-beta decay: Theoretical challenges  

Science Conference Proceedings (OSTI)

Neutrinoless double beta decay is a unique process that could reveal physics beyond the Standard Model of particle physics namely, if observed, it would prove that neutrinos are Majorana particles. In addition, it could provide information regarding the neutrino masses and their hierarchy, provided that reliable nuclear matrix elements can be obtained. The two neutrino double beta decay is an associate process that is allowed by the Standard Model, and it was observed for about ten nuclei. The present contribution gives a brief review of the theoretical challenges associated with these two process, emphasizing the reliable calculation of the associated nuclear matrix elements.

Horoi, Mihai [Department of Physics, Central Michigan University, Mount Pleasant, Michigan, 48859 (United States)

2012-11-20T23:59:59.000Z

252

Songs and the analysis of algorithms  

Science Conference Proceedings (OSTI)

In teaching a course that includes the analysis of algorithms, songs can be used as teaching examples. Multiple examples can be done at one time, or in one homework set, without the background explanation required to analyze real algorithms. Many components ...

Darrah Chavey

1996-03-01T23:59:59.000Z

253

Communication and Computation in Distributed CSP Algorithms  

E-Print Network (OSTI)

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

Krishnamachari, Bhaskar

254

Computer Vision Algorithms on Reconfigurable Logic Arrays  

Science Conference Proceedings (OSTI)

Abstract¿Computer vision algorithms are natural candidates for high performance computing systems. Algorithms in computer vision are characterized by complex and repetitive operations on large amounts of data involving a variety of data interactions ... Keywords: Reconfigurable computing, computer vision, image processing, image segmentation, neural networks, fingerprint matching.

Nalini K. Ratha; Anil K. Jain

1999-01-01T23:59:59.000Z

255

A new algorithm for gas network simulation  

Science Conference Proceedings (OSTI)

The simulation of natural gas networks has a growing importance for operators of networks. In this paper a new simulation algorithm based on the node potential analysis is presented. The approach is to evaluate analogies between electrical circuits and ... Keywords: algorithms, gas, modeling, networks, nonlinearities, simulation

Jens Rüdiger; Jurij Schiebelbein; Rainhart Lunderstädt; Joachim Horn

2006-02-01T23:59:59.000Z

256

Quantum Algorithm to Solve Satisfiability Problems  

E-Print Network (OSTI)

A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit Exact Cover problems. The time cost of this algorithm on general SAT problems is discussed.

Wenjin Mao

2004-11-29T23:59:59.000Z

257

Dual extragradient algorithms extended to equilibrium problems  

Science Conference Proceedings (OSTI)

In this paper we propose two iterative schemes for solving equilibrium problems which are called dual extragradient algorithms. In contrast with the primal extragradient methods in Quoc et al. (Optimization 57(6):749---776, 2008) which require ... Keywords: Complexity, Dual extragradient algorithm, Equilibrium problem, Gap function, Nash-Cournot equilibria

Tran D. Quoc; Pham N. Anh; Le D. Muu

2012-01-01T23:59:59.000Z

258

A novel algorithm for dynamic task scheduling  

Science Conference Proceedings (OSTI)

This paper deals with the problem of dynamic task scheduling in grid environment of multi-processors. First, this paper formulates task scheduling as an optimization problem and then optimizes with a novel hybrid optimization algorithm. The proposed ... Keywords: Bacteria foraging optimization, Genetic algorithms, Grid computing, Task scheduling

Sasmita Kumari Nayak; Sasmita Kumari Padhy; Siba Prasada Panigrahi

2012-05-01T23:59:59.000Z

259

Bat algorithm: literature review and applications  

Science Conference Proceedings (OSTI)

Bat algorithm BA is a bio-inspired algorithm developed by Xin-She Yang in 2010 and BA has been found to be very efficient. As a result, the literature has expanded significantly in the last three years. This paper provides a timely review of the bat ...

Xin-She Yang, Xingshi He

2013-07-01T23:59:59.000Z

260

Nonlinear piecewise polynomial approximation: Theory and Algorithms  

E-Print Network (OSTI)

algorithms for compression and quick rendering of Digital Terrain Elevation Data (DTED) maps and implement results, we develop efficient practical algorithms for compression and quick rendering of Digital Terrain approximation 23 2.3. Slim B-spaces 32 2.4. Skinny B-spaces 42 2.5. Fat B-spaces: The link to Besov spaces 46 2

Karaivanov, Borislav

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


261

Jumping ant routing algorithm for sensor networks  

Science Conference Proceedings (OSTI)

Enterprises that may rely on critical equipments which are constantly moving around, for example, hospitals - need to ensure they can know the current location of vital but mobile assets. Besides, the sensor node on each device should inform us whether ... Keywords: ARAMA (Ant Routing Algorithm for Mobile Ad-hoc Networks), Ad-hoc, JARA (Jumping Ant Routing Algorithm), MANET

Wei-Ming Chen; Chung-Sheng Li; Fu-Yu Chiang; Han-Chieh Chao

2007-10-01T23:59:59.000Z

262

Hierarchical geometric models for visible surface algorithms  

Science Conference Proceedings (OSTI)

The geometric structure inherent in the definition of the shapes of three-dimensional objects and environments is used not just to define their relative motion and placement, but also to assist in solving many other problems of systems for producing ... Keywords: geometric models, hidden surface algorithms, hierarchical data structures, visible surface algorithms

James H. Clark

1976-10-01T23:59:59.000Z

263

Hybrid algorithms for adaptive array systems  

Science Conference Proceedings (OSTI)

In recent years, mobile communications have caused an explosive growth to the number of wireless users. This growth has triggered an enormous demand not only for capacity but also for better coverage and quality of services with priority on interference ... Keywords: adaptive arrays, beamforming, least mean squares algorithm, mobile communications, sample matrix inversion algorithm, smart antennas

D. Papadimitriou; I. O. Vardiambasis

2005-03-01T23:59:59.000Z

264

Domestic load scheduling using genetic algorithms  

Science Conference Proceedings (OSTI)

An approach using a genetic algorithm to optimize the scheduling of domestic electric loads, according to technical and user-defined constraints and input signals, is presented and illustrative results are shown. The aim is minimizing the end-user's ... Keywords: automated energy management, domestic load scheduling, electric loads, genetic algorithms

Ana Soares; Állvaro Gomes; Carlos Henggeler Antunes; Hugo Cardoso

2013-04-01T23:59:59.000Z

265

Multithread parallelization of Lepp-bisection algorithms  

Science Conference Proceedings (OSTI)

Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated ... Keywords: Finite element method, Lepp-bisection algorithm, Longest edge bisection, Parallel multithread refinement, Triangulation refinement

Maria-Cecilia Rivara; Pedro Rodriguez; Rafael Montenegro; Gaston Jorquera

2012-04-01T23:59:59.000Z

266

Generalized stack algorithms for decoding convolutional codes  

Science Conference Proceedings (OSTI)

A new class of generalized stack algorithms for decoding convolutional codes is presented. It is based on the Zigangirov-Jelinek (Z-J) algorithm but, instead of extending just the top node of the stack at all times, a number of the most likely paths ...

D. Haccoun; M. Ferguson

1975-11-01T23:59:59.000Z

267

Video search: are algorithms all we need?  

Science Conference Proceedings (OSTI)

This panel will debate various approaches to improving video search, and explore how professional cataloguing, crowd sourced metadata, and improvements in search algorithms will evolve over the next ten years. Panelists will explore the needs of large ... Keywords: algorithms, archives, design, search, video

Jeff Ubois; Jamie Davidson; Marko Grobelnik; Paul Over; Hans Westerhof

2010-04-01T23:59:59.000Z

268

An energy complexity model for algorithms  

Science Conference Proceedings (OSTI)

Energy consumption has emerged as a first class computing resource for both server systems and personal computing devices. The growing importance of energy has led to rethink in hardware design, hypervisors, operating systems and compilers. Algorithm ... Keywords: energy efficient algorithms, parallel disk i/o model

Swapnoneel Roy; Atri Rudra; Akshat Verma

2013-01-01T23:59:59.000Z

269

Quantum Algorithms for Learning and Testing Juntas  

Science Conference Proceedings (OSTI)

In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n ... Keywords: 03.67.-a, 03.67.Lx, Juntas, computational learning theory, lower bounds, quantum computation, quantum property testing, quantum query algorithms

Alp At?c?; Rocco A. Servedio

2007-10-01T23:59:59.000Z

270

LES algorithm for turbulent reactive flows simulation  

Science Conference Proceedings (OSTI)

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

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

2010-10-01T23:59:59.000Z

271

A novel mating approach for genetic algorithms  

Science Conference Proceedings (OSTI)

Genetic algorithms typically use crossover, which relies on mating a set of selected parents. As part of crossover, random mating is often carried out. A novel approach to parent mating is presented in this work. Our novel approach can be applied in ... Keywords: Genetic algorithms, mating index, mating strategies, premature convergence, self-adaptive mating

Severino F. Galán; Ole J. Mengshoel; Rafael Pinter

2013-05-01T23:59:59.000Z

272

Algorithms for improved performance in cryptographic protocols.  

SciTech Connect

Public key cryptographic algorithms provide data authentication and non-repudiation for electronic transmissions. The mathematical nature of the algorithms, however, means they require a significant amount of computation, and encrypted messages and digital signatures possess high bandwidth. Accordingly, there are many environments (e.g. wireless, ad-hoc, remote sensing networks) where public-key requirements are prohibitive and cannot be used. The use of elliptic curves in public-key computations has provided a means by which computations and bandwidth can be somewhat reduced. We report here on the research conducted in an LDRD aimed to find even more efficient algorithms and to make public-key cryptography available to a wider range of computing environments. We improved upon several algorithms, including one for which a patent has been applied. Further we discovered some new problems and relations on which future cryptographic algorithms may be based.

Schroeppel, Richard Crabtree; Beaver, Cheryl Lynn

2003-11-01T23:59:59.000Z

273

1-Safe Algorithms for Symmetric Site Configurations  

E-Print Network (OSTI)

In order to provide database availability in the presence of node and site failures, traditional 1-safe algorithms disallow primary and hot standby replicas to be located at the same site. This means that the failure of a single primary node must be handled like a failure of the entire primary site. Furthermore, this excludes symmetric site configurations, where the primary replicas are located at the site closest to the accessing clients. In this paper, we present three novel 1-safe algorithms that allow the above restrictions to be removed. The relative performance of these and the traditional algorithms are evaluated by means of simulation studies. Our main conclusion is that the restrictions of the traditional algorithms can be removed without significantly increasing the processing overhead, during normal operation. From an evaluation based on performance, availability, and transaction durability, the novel dependency tracking algorithm provides the best overall solution. 1 Intro...

Rune Humborstad; Maitrayi Sabaratnam; Svein-olaf Hvasshovd; Ystein Torbjrnsen

1997-01-01T23:59:59.000Z

274

Theoretical Division annual report, FY 1975. [LASL  

SciTech Connect

This report presents an overview of the activities in the Theoretical Division and a summary of research highlights during FY 1975. It is intended to inform a wide audience about the theoretical work of the LASL and, therefore, contains introductory material which places recent advances in a broader context. The report is organized into two special interest reports: reactor safety research and the Advanced Research Committee, and 11 reports from the T-Division group leaders on the work of their respective groups. Main interests and responsibilities are outlined including the relationship of the group's work to the work of other T-Division groups and other divisions at the Laboratory. The description of research highlights for FY 1975 explains in a fairly simple, straightforward manner the major recent advances and their significance. Each group report is followed by a publication list for FY 1975 (330 references) and a list of talks given outside the Laboratory (140 references). 29 figures. (auth)

Carruthers, P.A.

1976-02-01T23:59:59.000Z

275

The Seventeen Theoretical Constructs of Information Searching and Information Retrieval  

E-Print Network (OSTI)

The Seventeen Theoretical Constructs of Information Searching and Information Retrieval Bernard J- retical constructs for the fields of information searching and information retrieval to emphasize and information retrieval using intellectual perspective and theoretical orientation. The intellectual

Petrick, Irene J.

276

Jet Observables Without Jet Algorithms  

E-Print Network (OSTI)

We introduce a new class of event shapes to characterize the jet-like structure of an event. Like traditional event shapes, our observables are infrared/collinear safe and involve a sum over all hadrons in an event, but like a jet clustering algorithm, they incorporate a jet radius parameter and a transverse momentum cut. Three of the ubiquitous jet-based observables---jet multiplicity, summed scalar transverse momentum, and missing transverse momentum---have event shape counterparts that are closely correlated with their jet-based cousins. Due to their "local" computational structure, these jet-like event shapes could potentially be used for trigger-level event selection at the LHC. Intriguingly, the jet multiplicity event shape typically takes on non-integer values, highlighting the inherent ambiguity in defining jets. By inverting jet multiplicity, we show how to characterize the transverse momentum of the n-th hardest jet without actually finding the constituents of that jet. Since many physics applications do require knowledge about the jet constituents, we also build a hybrid event shape that incorporates (local) jet clustering information. As a straightforward application of our general technique, we derive an event-shape version of jet trimming, allowing event-wide jet grooming without explicit jet identification. Finally, we briefly mention possible applications of our method for jet substructure studies.

Daniele Bertolini; Tucker Chan; Jesse Thaler

2013-10-28T23:59:59.000Z

277

Covariant basis induced by parity for the $(j,0)\\oplus (0,j)$ representation  

E-Print Network (OSTI)

In this work, we build a covariant basis for operators acting on the $(j,0)\\oplus(0,j)$ Lorentz group representations. The construction is based on an analysis of the covariant properties of the parity operator, which for these representations transforms as the completely temporal component of a symmetrical tensor of rank $2j$. The covariant properties of parity involve the Jordan algebra of anti commutators of the Lorentz group generators which unlike the Lie algebra is not universal. We make the construction explicit for $j=1/2,1$ and 3/2, reproducing well-known results for the $j=1/2$ case. We provide an algorithm for the corresponding calculations for arbitrary $j$. This covariant basis provides an inventory of all the possible interaction terms for gauge and non-gauge theories of fields for these representations. In particular, it supplies a single second rank antisymmetric structure, which in the Poincar\\'e projector formalism implies a single Pauli term arising from gauge interactions and a single (free) parameter $g$, the gyromagnetic factor, which characterizes all multipoles of these fields regardless of the spin value.

Selim Gómez-Ávila; M. Napsuciale

2013-07-17T23:59:59.000Z

278

Microsoft Word - Final_SRS_FTF_WD_Basis_March_2012  

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

2-001 2-001 Revision 0 Basis for Section 3116 Determination for Closure of F-Tank Farm at the Savannah River Site March 2012 Basis for Section 3116 Determination DOE/SRS-WD-2012-001 for Closure of F-Tank Farm Revision 0 at the Savannah River Site March 2012 Page ii REVISION SUMMARY REV. # DESCRIPTION DATE OF ISSUE 0 Initial Issue March 2012 Basis for Section 3116 Determination DOE/SRS-WD-2012-001 for Closure of F-Tank Farm Revision 0 at the Savannah River Site March 2012 Page iii TABLE OF CONTENTS Page REVISION SUMMARY ................................................................................................................................. ii LIST OF TABLES ........................................................................................................................................ vi

279

Spent Nuclear Fuel (SNF) Project Safety Basis Implementation Strategy  

Science Conference Proceedings (OSTI)

The objective of the Safety Basis Implementation is to ensure that implementation of activities is accomplished in order to support readiness to move spent fuel from K West Basin. Activities may be performed directly by the Safety Basis Implementation Team or they may be performed by other organizations and tracked by the Team. This strategy will focus on five key elements, (1) Administration of Safety Basis Implementation (general items), (2) Implementing documents, (3) Implementing equipment (including verification of operability), (4) Training, (5) SNF Project Technical Requirements (STRS) database system.

TRAWINSKI, B.J.

2000-02-08T23:59:59.000Z

280

Some analytic models of passive solar building performance: a theoretical approach to the design of energy-conserving buildings  

DOE Green Energy (OSTI)

This paper describes an application of the fundamental methods of physics to solve a problem of environmental and economic interest: the description of the thermal performance of passive solar buildings. Such a description is of great practical interest to building designers; however, this paper is not intended to be of use to architects and engineers in its present form. Its intention is to provide a theoretical basis for understanding passive solar buildings; further effort is needed to develop rules of solar engineering.

Goldstein, D.B.

1978-11-01T23:59:59.000Z

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


281

Game Theoretic Methods for the Smart Grid  

E-Print Network (OSTI)

The future smart grid is envisioned as a large-scale cyber-physical system encompassing advanced power, communications, control, and computing technologies. In order to accommodate these technologies, it will have to build on solid mathematical tools that can ensure an efficient and robust operation of such heterogeneous and large-scale cyber-physical systems. In this context, this paper is an overview on the potential of applying game theory for addressing relevant and timely open problems in three emerging areas that pertain to the smart grid: micro-grid systems, demand-side management, and communications. In each area, the state-of-the-art contributions are gathered and a systematic treatment, using game theory, of some of the most relevant problems for future power systems is provided. Future opportunities for adopting game theoretic methodologies in the transition from legacy systems toward smart and intelligent grids are also discussed. In a nutshell, this article provides a comprehensive account of the...

Saad, Walid; Poor, H Vincent; Ba?ar, Tamer

2012-01-01T23:59:59.000Z

282

Theoretical and Experimental Evaluation of Chemical Reactivity  

E-Print Network (OSTI)

Reactive chemicals are presented widely in the chemical and petrochemical process industry. Their chemical reactivity hazards have posed a significant challenge to the industries of manufacturing, storage and transportation. The accidents due to reactive chemicals have caused tremendous loss of properties and lives, and damages to the environment. In this research, three classes of reactive chemicals (unsaturated hydrocarbons, self-reacting chemicals, energetic materials) were evaluated through theoretical and experimental methods. Methylcyclopentadiene (MCP) and Hydroxylamine (HA) are selected as representatives of unsaturated hydrocarbons and self-reacting chemicals, respectively. Chemical reactivity of MCP, including isomerization, dimerization, and oxidation, is investigated by computational chemistry methods and empirical thermodynamic–energy correlation. Density functional and ab initio methods are used to search the initial thermal decomposition steps of HA, including unimolecular and bimolecular pathways. In addition, solvent effects are also examined using water cluster methods and Polarizable Continuum Models (PCM) for aqueous solution of HA. The thermal stability of a basic energetic material, Nitroethane, is investigated through both theoretical and experimental methods. Density functional methods are employed to explore the initial decomposition pathways, followed by developing detailed reaction networks. Experiments with a batch reactor and in situ GC are designed to analyze the distribution of reaction products and verify reaction mechanisms. Overall kinetic model is also built from calorimetric experiments using an Automated Pressure Tracking Adiabatic Calorimeter (APTAC). Finally, a general evaluation approach is developed for a wide range of reactive chemicals. An index of thermal risk is proposed as a preliminary risk assessment to screen reactive chemicals. Correlations are also developed between reactivity parameters, such as onset temperature, activation energy, and adiabatic time to maximum rate based on a limited number, 37 sets, of Differential Scanning Calorimeter (DSC) data. The research shows broad applications in developing reaction mechanisms at the molecular level. The methodology of reaction modeling in combination with molecular modeling can also be used to study other reactive chemical systems.

Wang, Qingsheng

2010-08-01T23:59:59.000Z

283

Perspective on Beyond Design Basis Event Analysis and Response | Department  

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

Perspective on Beyond Design Basis Event Analysis and Response Perspective on Beyond Design Basis Event Analysis and Response Perspective on Beyond Design Basis Event Analysis and Response September 20, 2012 Presenter: John Schwenker, Nuclear Safety Manager for Liquid Operations, Savannah River Remediation, LLC, Savannah River Site Topics Covered: Waste Tanks can contain up to 1.3 Millions Gallons of highly radioactive waste (sludge, salt, supernate). Type III/IIIA Waste Tank Structures and berms are PC-3 Qualified. Tanks may fail in a Beyond Design Basis Seismic Event. Waste could flow above ground to streams and rivers. Unmitigated Tank Explosion exceeds offsite Evaluation Guidelines Hydrogen gas can be trapped in the sludge and saltcake structure. Seismic Event can cause a prompt release of trapped hydrogen. It is not physically practical to install a ventilation system that

284

Development of Guidance for Analysis of Beyond Design Basis Events |  

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

Development of Guidance for Analysis of Beyond Design Basis Events Development of Guidance for Analysis of Beyond Design Basis Events Development of Guidance for Analysis of Beyond Design Basis Events Wednesday, September 19 Presenter: Dr. James O'Brien, Director, Office of Nuclear Safety, Office of Health, Safety and Security, US Department of Energy Topics covered: Types of DOE Facilities â—¦ Research Reactors; â—¦ Weapons disassembly, maintenance, and testing facilities; â—¦ Nuclear material storage facilities; â—¦ Processing facilities; and waste disposal facilities. Safety Analysis Framework â—¦ DOE Nuclear Safety Policy â—¦ Nuclear Safety Rule â—¦ Nuclear Safety Analysis Standards â—¦ Documented Safety Analysis Guide Development of Guidance for Analysis of Beyond Design Basis Events More Documents & Publications DOE's Approach to Nuclear Facility Safety Analysis and Management

285

CRAD, Safety Basis - Idaho Accelerated Retrieval Project Phase...  

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

Idaho Accelerated Retrieval Project Phase II CRAD, Safety Basis - Idaho Accelerated Retrieval Project Phase II February 2006 A section of Appendix C to DOE G 226.1-2 "Federal Line...

286

CRAD, Review of Safety Basis Development- October 11, 2012  

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

Review of Safety Basis Development for the Y-12 National Security Complex Uranium Processing Facility Inspection Criteria, Approach, and Lines of Inquiry (HSS CRAD 45-55, Rev. 0)

287

Has my algorithm succeeded? an evaluator for human pose estimators  

Science Conference Proceedings (OSTI)

Most current vision algorithms deliver their output 'as is', without indicating whether it is correct or not. In this paper we propose evaluator algorithms that predict if a vision algorithm has succeeded. We illustrate this idea for the case ...

Nataraj Jammalamadaka; Andrew Zisserman; Marcin Eichner; Vittorio Ferrari; C. V. Jawahar

2012-10-01T23:59:59.000Z

288

Improvement of Surface Longwave Flux Algorithms Used in CERES Processing  

Science Conference Proceedings (OSTI)

An improvement was developed and tested for surface longwave flux algorithms used in the Clouds and the Earth’s Radiant Energy System processing based on lessons learned during the validation of global results of those algorithms. The algorithms ...

Shashi K. Gupta; David P. Kratz; Paul W. Stackhouse Jr.; Anne C. Wilber; Taiping Zhang; Victor E. Sothcott

2010-07-01T23:59:59.000Z

289

Accessibility of Analysis of Algorithms: from programming to problem solving  

Science Conference Proceedings (OSTI)

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

Karina V Assiter

2005-12-01T23:59:59.000Z

290

Using Genetic Algorithms to Optimize ACS-TSP  

Science Conference Proceedings (OSTI)

We propose the addition of Genetic Algorithms to Ant Colony System (ACS) applied to improve performance. Two modifications are proposed and tested. The first algorithm is a hybrid between ACS-TSP and a Genetic Algorithm that encodes experimental variables ...

Marcin L. Pilat; Tony White

2002-09-01T23:59:59.000Z

291

Asynchronous Event-Driven Particle Algorithms  

Science Conference Proceedings (OSTI)

We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel stochastic molecular-dynamics algorithm that builds on the Direct Simulation Monte Carlo (DSMC). We explain how to effectively combine event-driven and classical time-driven handling, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

Donev, A

2007-08-30T23:59:59.000Z

292

Asynchronous Event-Driven Particle Algorithms  

Science Conference Proceedings (OSTI)

We present in a unifying way the main components of three examples of asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel event-driven algorithm for Direct Simulation Monte Carlo (DSMC). Finally, we describe how to combine MD with DSMC in an event-driven framework, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

Donev, A

2007-02-28T23:59:59.000Z

293

Quantum Algorithms for Quantum Field Theories  

E-Print Network (OSTI)

Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.

Stephen P. Jordan; Keith S. M. Lee; John Preskill

2011-11-15T23:59:59.000Z

294

Quantum Algorithms for Quantum Field Theories  

E-Print Network (OSTI)

Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm.

Jordan, Stephen P; Preskill, John

2011-01-01T23:59:59.000Z

295

Efficient Software Implementation for Finite Field Multiplication in Normal Basis  

E-Print Network (OSTI)

Abstract. Finite field arithmetic is becoming increasingly important in today's computer systems, particularly for implementing cryptographic operations. Among various arithmetic operations, finite field multiplication is of particular interest since it is a major building block for elliptic curve cryptosystems. In this paper, we present new techniques for efficient software implementation of binary field multiplication in normal basis. Our techniques are more efficient in terms of both speed and memory compared with alternative approaches. 1 Introduction Finite field arithmetic is becoming increasingly important in today's computer systems, particularly for implementing cryptographic operations. Among the more common finite fields in cryptography are odd-characteristic finite fields of degree 1 and even-characteristic finite fields of degree greater than 1. The latter is conventionally known as GF (2m) arithmetic or binary field arithmetic. GF (2m) arithmetic is further classified according to the choice of basis for representing elements of the finite field; two common choices are polynomial basis and normal basis. Fast implementation techniques for GF (2m) arithmetic have been studied intensively in the past twenty years. Among various arithmetic operations, GF (2m) multiplication has attracted most of the attention since it is a major building block for implementing elliptic curve cryptosystems. Depending on the choice of basis, the mathematical formula for a GF (2m) multiplication can be quite different, thus making major differences in practical implementation. Currently, it seems that normal basis representation (especially optimal normal basis) offers the best performance in hardware [9-11], while in software polynomial basis representation is more efficient [2, 3, 8].

Peng Ning; Yiqun Lisa Yin

2001-01-01T23:59:59.000Z

296

Technical Basis Document for PFP Area Monitoring Dosimetry Program  

Science Conference Proceedings (OSTI)

This document describes the phantom dosimetry used for the PFP Area Monitoring program and establishes the basis for the Plutonium Finishing Plant's (PFP) area monitoring dosimetry program in accordance with the following requirements: Title 10, Code of Federal Regulations (CFR), part 835, ''Occupational Radiation Protection'' Part 835.403; Hanford Site Radiological Control Manual (HSRCM-1), Part 514; HNF-PRO-382, Area Dosimetry Program; and PNL-MA-842, Hanford External Dosimetry Technical Basis Manual.

COOPER, J.R.

2000-04-17T23:59:59.000Z

297

Authorization basis supporting documentation for plutonium finishing plant  

Science Conference Proceedings (OSTI)

The identification and definition of the authorization basis for the Plutonium Finishing Plant (PFP) facility and operations are essential for compliance to DOE Order 5480.21, Unreviewed Safety Questions. The authorization basis, as defined in the Order, consists of those aspects of the facility design basis, i.e., the structures, systems and components (SSCS) and the operational requirements that are considered to be important to the safety of operations and are relied upon by DOE to authorize operation of the facility. These facility design features and their function in various accident scenarios are described in WHC-SD-CP-SAR-021, Plutonium Finishing Plant Final Safety Analysis Report (FSAR), Chapter 9, `Accident Analysis.` Figure 1 depicts the relationship of the Authorization Basis to its components and other information contained in safety documentation supporting the Authorization Basis. The PFP SSCs that are important to safety, collectively referred to as the `Safety Envelope` are discussed in various chapters of the FSAR and in WHC-SD-CP-OSR-010, Plutonium Finishing Plant Operational Safety Requirements. Other documents such as Criticality Safety Evaluation Reports (CSERS) address and support some portions of the Authorization Basis and Safety Envelope.

King, J.P., Fluor Daniel Hanford

1997-03-05T23:59:59.000Z

298

Theoretical Model for Nanoporous Carbon Supercapacitors  

Science Conference Proceedings (OSTI)

The unprecedented anomalous increase in capacitance of nanoporous carbon supercapacitors at pore sizes smaller than 1 nm [Science 2006, 313, 1760.] challenges the long-held presumption that pores smaller than the size of solvated electrolyte ions do not contribute to energy storage. We propose a heuristic model to replace the commonly used model for an electric double-layer capacitor (EDLC) on the basis of an electric double-cylinder capacitor (EDCC) for mesopores (2 {50 nm pore size), which becomes an electric wire-in-cylinder capacitor (EWCC) for micropores (supercapacitor properties to be correlated with pore size, specific surface area, Debye length, electrolyte concentration and dielectric constant, and solute ion size. The new model not only explains the experimental data, but also offers a practical direction for the optimization of the properties of carbon supercapacitors through experiments.

Sumpter, Bobby G [ORNL; Meunier, Vincent [ORNL; Huang, Jingsong [ORNL

2008-01-01T23:59:59.000Z

299

Probing the Pareto frontier for basis pursuit solutions  

E-Print Network (OSTI)

and a single parameter determines a curve that traces the optimal trade-off between the least-squares ... In the presence of noisy or imperfect data, however, it is undesirable to exactly fit the ...... Algorithm 2 is a distillation of this procedure.

300

Strongly Polynomial Primal-Dual Algorithms for Concave Cost ...  

E-Print Network (OSTI)

Feb 13, 2012 ... This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the ...

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


301

Strongly Polynomial Primal-Dual Algorithms for Concave Cost ...  

E-Print Network (OSTI)

Feb 13, 2012 ... Concave Cost Combinatorial Optimization Problems? ... algorithm for a concave cost problem whenever such an algorithm exists for the fixed-.

302

An Approximation Algorithm for Constructing Error Detecting Prefix ...  

E-Print Network (OSTI)

Sep 2, 2006 ... Washington, DC, USA, june 2001. A The Modified BRCI Algorithm. Before describing the modified BRCI algorithm, we shall discuss some ...

303

Spectral Bounds for Sparse PCA: Exact and Greedy Algorithms  

E-Print Network (OSTI)

computational costs and promote better generalization in learning algorithms. .... of an algorithm is to plot its variance curve ˜v(k) and compare it with the optimal ...

304

Window Memoization In Software As Applied To Image Processing Algorithms.  

E-Print Network (OSTI)

??A new local image processing algorithm, the Tahir algorithm, is an adaptation to the standard low-pass filter. Its design is for images that have the… (more)

Jaffer, Tahir

2010-01-01T23:59:59.000Z

305

Tracking Algorithm for Multi- Dimensional Array Transposition  

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

He, SC2002 1 MPI and OpenMP Paradigms on Cluster of SMP Architectures: the Vacancy Tracking Algorithm for Multi- Dimensional Array Transposition Yun (Helen) He and Chris Ding...

306

CONVERGENCE OF FIXED-POINT CONTINUATION ALGORITHMS ...  

E-Print Network (OSTI)

Jun 18, 2009 ... solving the nuclear norm minimization problem [33]. By incorporating .... more information on the theory and algorithms for compressed sensing. The matrix rank ..... is called the unrecoverable energy (see [36]). Furthermore ...

307

Student's algorithm solves real-world problem  

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

Student's algorithm solves real-world problem Student's algorithm solves real-world problem Supercomputing Challenge: student's algorithm solves real-world problem Students learn how to use powerful computers to analyze, model, and solve real-world problems. April 3, 2012 Jordon Medlock of Albuquerque's Manzano High School won the 2012 Lab-sponsored Supercomputing Challenge Jordon Medlock of Albuquerque's Manzano High School won the 2012 Lab-sponsored Supercomputing Challenge by creating a computer algorithm that automates the process of counting and analyzing plaques, substances in the blood such as fat and cholesterol found in persons diagnosed with Alzheimer's disease. Contact Kurt Steinhaus (505) 665-7370 Email "The mission of the Supercomputing Challenge is to teach students how to use powerful computers to analyze, model, and solve real-world problems,"

308

Evaluating Heuristic Optimization Phase Order Search Algorithms  

Science Conference Proceedings (OSTI)

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

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

2007-03-01T23:59:59.000Z

309

The systems biology simulation core algorithm  

E-Print Network (OSTI)

Keller et al. : The systems biology simulation core algo-rithm. BMC Systems Biology 2013 7:55. Page 16 of 16 SubmitMacilwain C: Systems biology: evolving into the mainstream.

2013-01-01T23:59:59.000Z

310

Evaluation of On-ramp Control Algorithms  

E-Print Network (OSTI)

net- works and development of a Fuzzy Logic Ramp Meteringmetering algorithm - high level design, Final Report, Prepared by NETset the new metering rate The most important function of net

Zhang, Michael; Kim, Taewan; Nie, Xiaojian; Jin, Wenlong; Chu, Lianyu; Recker, Will

2001-01-01T23:59:59.000Z

311

An algorithmic approach to social networks  

E-Print Network (OSTI)

Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze ...

Liben-Nowell, David

2005-01-01T23:59:59.000Z

312

EOF-Based Linear Prediction Algorithm: Theory  

Science Conference Proceedings (OSTI)

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

Kwang-Y. Kim; Gerald R. North

1998-11-01T23:59:59.000Z

313

An exact tree projection algorithm for wavelets  

E-Print Network (OSTI)

approach has its roots in the minimal cost-complexity pruning algorithm for .... is obtained by identifying the set ? ? Tk on which y has maximum energy. ... To maximize efficiency, optimal subtrees are in fact only found for all cardinalities which.

314

Algorithmic randomness, quantum physics, and incompleteness  

Science Conference Proceedings (OSTI)

Is randomness in quantum mechanics “algorithmically random”? Is there any relation between Heisenberg's uncertainty relation and Gödel's incompleteness? Can quantum randomness be used to trespass the Turing's barrier? Can ...

Cristian S. Calude

2004-09-01T23:59:59.000Z

315

DIRECT SEARCH ALGORITHMS OVER RIEMANNIAN MANIFOLDS ...  

E-Print Network (OSTI)

... method for function mini- mization over Rn. (See [18] for a detailed treatment of the algorithm). At each iteration,. ?LA-UR-06-7416. †email: dreisigm@lanl.gov.

316

Advanced CHP Control Algorithms: Scope Specification  

SciTech Connect

The primary objective of this multiyear project is to develop algorithms for combined heat and power systems to ensure optimal performance, increase reliability, and lead to the goal of clean, efficient, reliable and affordable next generation energy systems.

Katipamula, Srinivas; Brambley, Michael R.

2006-04-28T23:59:59.000Z

317

A hardware accelerator for speech recognition algorithms  

Science Conference Proceedings (OSTI)

This paper describes two custom architectures tailored to a speech recognition beam search algorithm. Both architectures have been simulated using real data and the results of the simulation are presented. The paper also describes the design process ...

T. S. Anantharaman; R. Bisiani

1986-06-01T23:59:59.000Z

318

A Nonlinear Programming Algorithm for Solving Semidefinite ...  

E-Print Network (OSTI)

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

319

subspace accelerated matrix splitting algorithms for bound ...  

E-Print Network (OSTI)

Their algorithm uses a projected gradient search in the first phase ..... eration is generally superior to a projected gradient iteration in terms of identifying an optimal ..... Once the subspace step has been computed, we enter Step 3 and compute.

320

Edge Detection Algorithm for SST Images  

Science Conference Proceedings (OSTI)

An algorithm to detect fronts in satellite-derived sea surface temperature fields is presented. Although edge detection is the main focus, the problem of cloud detection is also addressed since unidentified clouds can lead to erroneous edge ...

Jean-François Cayula; Peter Cornillon

1992-02-01T23:59:59.000Z

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


321

Visualization in Medicine: Theory, Algorithms, and Applications  

Science Conference Proceedings (OSTI)

Visualization in Medicine is the first book on visualization and its application to problems in medical diagnosis, education, and treatment. The book describes the algorithms, the applications and their validation (how reliable are the results?), ... Keywords: Computer Graphics

Bernhard Preim; Dirk Bartz

2007-06-01T23:59:59.000Z

322

Solar Position Algorithm (SPA) - Energy Innovation Portal  

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

323

Exact Algorithms for Combinatorial Optimization Problems with ...  

E-Print Network (OSTI)

Fuchs [10] showed that the problem of finding a minimum-power connected network with ... receiving node, in the latter all nodes except the source are addressed. ..... As an alternative, one could use an algorithm for general submodular ...

324

Exactness of the original Grover search algorithm  

Science Conference Proceedings (OSTI)

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

Diao Zijian [Mathematics Department, Ohio University Eastern Campus, St. Clairsville, Ohio 43950 (United States)

2010-10-15T23:59:59.000Z

325

IMPLICATIONS OF THEORETICAL IDEAS REGARDING COLD FUSION  

E-Print Network (OSTI)

A lot of theoretical ideas have been floated to explain the so called cold fusion phenomenon. I look at a large subset of these and study further physical implications of the concepts involved. I suggest that these can be tested by other independent physical means. Because of the significance of these the experimentalists are urged to look for these signatures. The results in turn will be important for a better understanding and hence control of the cold fusion phenomenon. 1 Since the initial claims, counterclaims and confusion of 1989 the field of ” cold fusion ” has settled down as a reasonably well pursued field all over the world as evidenced by several recent conferences and publications [1-7]. Perhaps not surprisingly it has turned out to be a tough field experimentally as much as the results viewed globally are quite sporadic and the optimum conditions are still unknown. However the bottomline is that whether conventional cold fusion or not excess heat and/or neutron and/or He 4 etc are

unknown authors

1995-01-01T23:59:59.000Z

326

Direct photons ~basis for characterizing heavy ion collisions~  

E-Print Network (OSTI)

After years of experimental and theoretical efforts, direct photons become a strong and reliable tool to establish the basic characteristics of a hot and dense matter produced in heavy ion collisions. The recent direct photon measurements are reviewed and a future prospect is given.

Takao Sakaguchi

2008-05-30T23:59:59.000Z

327

Training a Large Scale Classifier with the Quantum Adiabatic Algorithm  

E-Print Network (OSTI)

In a previous publication we proposed discrete global optimization as a method to train a strong binary classifier constructed as a thresholded sum over weak classifiers. Our motivation was to cast the training of a classifier into a format amenable to solution by the quantum adiabatic algorithm. Applying adiabatic quantum computing (AQC) promises to yield solutions that are superior to those which can be achieved with classical heuristic solvers. Interestingly we found that by using heuristic solvers to obtain approximate solutions we could already gain an advantage over the standard method AdaBoost. In this communication we generalize the baseline method to large scale classifier training. By large scale we mean that either the cardinality of the dictionary of candidate weak classifiers or the number of weak learners used in the strong classifier exceed the number of variables that can be handled effectively in a single global optimization. For such situations we propose an iterative and piecewise approach in which a subset of weak classifiers is selected in each iteration via global optimization. The strong classifier is then constructed by concatenating the subsets of weak classifiers. We show in numerical studies that the generalized method again successfully competes with AdaBoost. We also provide theoretical arguments as to why the proposed optimization method, which does not only minimize the empirical loss but also adds L0-norm regularization, is superior to versions of boosting that only minimize the empirical loss. By conducting a Quantum Monte Carlo simulation we gather evidence that the quantum adiabatic algorithm is able to handle a generic training problem efficiently.

Hartmut Neven; Vasil S. Denchev; Geordie Rose; William G. Macready

2009-12-04T23:59:59.000Z

328

CRAD, Safety Basis - Oak Ridge National Laboratory High Flux Isotope  

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

Reactor Contractor ORR Reactor Contractor ORR CRAD, Safety Basis - Oak Ridge National Laboratory High Flux Isotope Reactor Contractor ORR February 2007 A section of Appendix C to DOE G 226.1-2 "Federal Line Management Oversight of Department of Energy Nuclear Facilities." Consists of Criteria Review and Approach Documents (CRADs) used for a February 2007 assessment of the Safety Basis portion of an Operational Readiness Review of the Oak Ridge National Laboratory High Flux Isotope Reactor. CRADs provide a recommended approach and the types of information to gather to assess elements of a DOE contractor's programs. CRAD, Safety Basis - Oak Ridge National Laboratory High Flux Isotope Reactor Contractor ORR More Documents & Publications CRAD, Engineering - Oak Ridge National Laboratory High Flux Isotope Reactor

329

BASIS: Backscattering Spectrometer at SNS | ORNL Neutron Sciences  

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

Backscattering Spectrometer Backscattering Spectrometer View inside the BAIS tank View inside the BASIS tank. BASIS is a near-backscattering, crystal-analyzer spectrometer that provides very fine energy resolution, as low as 3.0 to 3.5 µeV at the elastic peak (depending on sample size). This requires a long initial guide section of 84 m from moderator to sample in order to achieve the timing resolution necessary for obtaining the desired energy resolution. BASIS provides an excellent dynamic range near the elastic peak of about plus and minus 100 µeV in the standard high-intensity operation regime, which, if needed, could be extended to plus and minus 200 µeV and beyond. The spectrometer is optimized for quasielastic scattering but provides about 0.1% resolution in energy transfers up to ~40 meV; the inelastic excitations need to be

330

Theoretical cosmic Type Ia supernova rates  

E-Print Network (OSTI)

The aim of this work is the computation of the cosmic Type Ia supernova rates at very high redshifts (z>2). We adopt various progenitor models in order to predict the number of explosions in different scenarios for galaxy formation and to check whether it is possible to select the best delay time distribution model, on the basis of the available observations of Type Ia supernovae. We also computed the Type Ia supernova rate in typical elliptical galaxies of different initial luminous masses and the total amount of iron produced by Type Ia supernovae in each case. It emerges that: it is not easy to select the best delay time distribution scenario from the observational data and this is because the cosmic star formation rate dominates over the distribution function of the delay times; the monolithic collapse scenario predicts an increasing trend of the SN Ia rate at high redshifts whereas the predicted rate in the hierarchical scheme drops dramatically at high redshift; for the elliptical galaxies we note that the predicted maximum of the Type Ia supernova rate depends on the initial galactic mass. The maximum occurs earlier (at about 0.3 Gyr) in the most massive ellipticals, as a consequence of downsizing in star formation. We find that different delay time distributions predict different relations between the Type Ia supernova rate per unit mass at the present time and the color of the parent galaxies and that bluer ellipticals present higher supernova Type Ia rates at the present time.

R. Valiante; F. Matteucci; S. Recchi; F. Calura

2008-07-15T23:59:59.000Z

331

SAFETY BASIS DESIGN DEVELOPMENT CHALLENGES IMECE2007-42747  

SciTech Connect

'Designing in Safety' is a desired part of the development of any new potentially hazardous system, process, or facility. It is a required part of nuclear safety activities as specified in the U.S. Department of Energy (DOE) Order 420.B, Facility Safety. This order addresses the design of nuclear related facilities developed under federal regulation IOCFR830, Nuclear Safety Management. IOCFR830 requires that safety basis documentation be provided to identify how nuclear safety is being adequately addressed as a condition for system operation (e.g., the safety basis). To support the development of the safety basis, a safety analysis is performed. Although the concept of developing a design that addresses 'Safety is simple, the execution can be complex and challenging. This paper addresses those complexities and challenges for the design activity of a system to treat sludge, a corrosion product of spent nuclear fuel, at DOE's Hanford Site in Washington State. The system being developed is referred to as the Sludge Treatment Project (STP). This paper describes the portion of the safety analysis that addresses the selection of design basis events using the experience gained from the STP and the development of design requirements for safety features associated with those events. Specifically, the paper describes the safety design process and the application of the process for two types of potential design basis accidents associated with the operation of the system, (1) flashing spray leaks and (2) splash and splatter leaks. Also presented are the technical challenges that are being addressed to develop effective safety features to deal with these design basis accidents.

RYAN GW

2007-09-24T23:59:59.000Z

332

Fluid Dynamics and Solid Mechanics, T-3: Theoretical, T: LANL Inside  

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

Leader Leader Mark Schraad Deputy Group Leader Marianne Francois Administration Crystal Martinez Beverly Corrales Office Location MS B216 TA-3, Bldg 200, Rm 215 Fluid Dynamics and Solid Mechanics, T-3 Conducts basic and applied research in theoretical continuum dynamics, modern hydrodynamic theory, materials modeling, global climate modeling, numerical algorithm development, and large-scale computational simulations. There is an emphasis on developing advanced numerical methods for continuum dynamics at all flow velocities and strain rates, and coupling these methods to constitutive models for solid material response and other physical processes such as turbulence, chemical reactions, combustion, phase change, heat and mass transfer, and plasma behavior. The Fluid Dynamics Group's portfolio of research activities represents fundamental

333

The Functional Requirements and Design Basis for Information Barriers  

SciTech Connect

This report summarizes the results of the Information Barrier Working Group workshop held at Sandia National Laboratory in Albuquerque, NM, February 2-4, 1999. This workshop was convened to establish the functional requirements associated with warhead radiation signature information barriers, to identify the major design elements of any such system or approach, and to identify a design basis for each of these major elements. Such information forms the general design basis to be used in designing, fabricating, and evaluating the complete integrated systems developed for specific purposes.

Fuller, James L.

2012-05-01T23:59:59.000Z

334

Advanced Fuel Cycle Economic Tools, Algorithms, and Methodologies  

SciTech Connect

The Advanced Fuel Cycle Initiative (AFCI) Systems Analysis supports engineering economic analyses and trade-studies, and requires a requisite reference cost basis to support adequate analysis rigor. In this regard, the AFCI program has created a reference set of economic documentation. The documentation consists of the “Advanced Fuel Cycle (AFC) Cost Basis” report (Shropshire, et al. 2007), “AFCI Economic Analysis” report, and the “AFCI Economic Tools, Algorithms, and Methodologies Report.” Together, these documents provide the reference cost basis, cost modeling basis, and methodologies needed to support AFCI economic analysis. The application of the reference cost data in the cost and econometric systems analysis models will be supported by this report. These methodologies include: the energy/environment/economic evaluation of nuclear technology penetration in the energy market—domestic and internationally—and impacts on AFCI facility deployment, uranium resource modeling to inform the front-end fuel cycle costs, facility first-of-a-kind to nth-of-a-kind learning with application to deployment of AFCI facilities, cost tradeoffs to meet nuclear non-proliferation requirements, and international nuclear facility supply/demand analysis. The economic analysis will be performed using two cost models. VISION.ECON will be used to evaluate and compare costs under dynamic conditions, consistent with the cases and analysis performed by the AFCI Systems Analysis team. Generation IV Excel Calculations of Nuclear Systems (G4-ECONS) will provide static (snapshot-in-time) cost analysis and will provide a check on the dynamic results. In future analysis, additional AFCI measures may be developed to show the value of AFCI in closing the fuel cycle. Comparisons can show AFCI in terms of reduced global proliferation (e.g., reduction in enrichment), greater sustainability through preservation of a natural resource (e.g., reduction in uranium ore depletion), value from weaning the U.S. from energy imports (e.g., measures of energy self-sufficiency), and minimization of future high level waste (HLW) repositories world-wide.

David E. Shropshire

2009-05-01T23:59:59.000Z

335

Automatic recommendation of classification algorithms based on data set characteristics  

Science Conference Proceedings (OSTI)

Choosing appropriate classification algorithms for a given data set is very important and useful in practice but also is full of challenges. In this paper, a method of recommending classification algorithms is proposed. Firstly the feature vectors of ... Keywords: Algorithm performance, Classification, Classification algorithm automatic recommendation, Data set characteristics extraction, k-Nearest Neighbors

Qinbao Song; Guangtao Wang; Chao Wang

2012-07-01T23:59:59.000Z

336

An evolutive algorithm for wind farm optimal design  

Science Conference Proceedings (OSTI)

An evolutive algorithm for the optimal design of wind farms is presented. The algorithm objective is to optimize the profits given an investment on a wind farm. Net present value will be used as a figure of the revenue. To work out this figure, several ... Keywords: Evolutive algorithm, Genetic algorithm, Optimization, Wind farms

José Castro Mora; José M. Calero Barón; Jesús M. Riquelme Santos; Manuel Burgos Payán

2007-10-01T23:59:59.000Z

337

An Experimental Method for the Active Learning of Greedy Algorithms  

Science Conference Proceedings (OSTI)

Greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve. We present a didactic method aimed at promoting active learning of greedy algorithms. The method is focused on the concept ... Keywords: Computer science education, active learning, greedy algorithms, misconceptions, usability, visualization

J. Ángel Velázquez-Iturbide

2013-11-01T23:59:59.000Z

338

An iterative distributed algorithm for multi-constraint multicast routing  

Science Conference Proceedings (OSTI)

In this paper, we propose a group computation based distributed algorithm for solving the problem of multi-constraint multicast routing. This algorithm is fully distributed and can generate within acceptable time and message complexities a multicast ... Keywords: Distributed algorithm, Heuristic algorithm, Multicast, Multicast routing tree, Multiple constraints, NP-hardness, QoS, Routing protocol

Tzu-Lun Huang; D. T. Lee

2006-11-01T23:59:59.000Z

339

Automated Configuration of Algorithms for Solving Hard Computational Problems  

E-Print Network (OSTI)

Automated Configuration of Algorithms for Solving Hard Computational Problems by Frank Hutter Dipl-performing algorithms for many hard problems are highly parameterized. Selecting the best heuristics and tuning studies the automation of this important part of algorithm design: the configuration of discrete algorithm

Hutter, Frank

340

A Game-Theoretical Dynamic Model for Electricity Markets  

E-Print Network (OSTI)

Oct 6, 2010 ... A Game-Theoretical Dynamic Model for Electricity Markets ... forecast horizon, bidding frequency, and some other factors on the price signals.

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


341

A Theoretical Rationalization of a Goal-Oriented Systems ...  

Science Conference Proceedings (OSTI)

Page 1. NBS-GCR-79-163 A Theoretical Rationalization of a Goal-Oriented Systems Approach to Building Fire Safety February 28. 1979 ...

2008-12-02T23:59:59.000Z

342

Influence of Different Parameters on Theoretical Flame Temperature ...  

Science Conference Proceedings (OSTI)

One of the main parameters to measure the thermal state in Corex melter gasifier is the theoretical flame temperature (TFT) before tuyere, which is important to ...

343

Theoretical and experimental simulation of passive vacuum solar flash desalination.  

E-Print Network (OSTI)

??Experimental and theoretical simulations of a novel sustainable desalination process have been carried out. The simulated process consists of pumping seawater through a solar heater… (more)

Abutayeh, Mohammad

2010-01-01T23:59:59.000Z

344

Influence of the Pulverized Coal Ash on Theoretical Flame ...  

Science Conference Proceedings (OSTI)

Moreover, the modified formula for calculating of theoretical flame temperature before tuyere is established. The effect of the ratio of reduced SiO2 in raceway ...

345

Theoretical and Experimental Study of Spatial Effects in 3He ...  

Science Conference Proceedings (OSTI)

Abstract Scope, Tungsten is candidate for the divertor in ITER. As such it is currently under investigations using both experimental and theoretical approaches.

346

A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix  

Science Conference Proceedings (OSTI)

In this paper, a novel identification of mixing matrix using genetic algorithm (GA) is proposed to deal with the blind sparse source separation (BSS) problem. A preprocessing filters the most of minor mixtures at first, and then represents the remainder ... Keywords: blind source separation (BSS), genetic algorithm (GA), sparse representation, under-determined

Tsung-Ying Sun; Chan-Cheng Liu; Sheng-Ta Hsieh; Shang-Jeng Tsai; Kan-Yuan Li

2007-02-01T23:59:59.000Z

347

A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix  

Science Conference Proceedings (OSTI)

In this paper, a novel identification of mixing matrix using genetic algorithm (GA) is proposed to deal with the blind sparse source separation (BSS) problem. A preprocessing filters the most of minor mixtures at first, and then represents the remainder ... Keywords: blind source separation (BSS), genetic algorithm (GA), sparse representation, under-determined

Tsung-Ying Sun; Chan-Cheng Liu; Sheng-Ta Hsieh; Shang-Jeng Tsai; Kan-Yuan Li

2007-01-01T23:59:59.000Z

348

Temporal Reference Algorithms versus Spatial Reference Algorithms forSmart Antennas  

Science Conference Proceedings (OSTI)

This paper compares algorithms from three different classes of adaptation schemes for smart antennas – the switched beam approach, a Temporal-Reference (TR) technique based on Direct Matrix Inversion or Least Squares adaptation, and a Spatial-Reference ... Keywords: adaptation algorithms, angular spread, comparison, mutual coupling, smart antennas

Josef Fuhl; Ernst Bonek

1999-05-01T23:59:59.000Z

349

Using a Genetic Algorithm to Tune a Bounded Weak Echo Region Detection Algorithm  

Science Conference Proceedings (OSTI)

Weather detection algorithms often rely on a simple rule base that is based on several features. Fuzzy logic can be used in the rule base, and the membership functions of the fuzzy sets can be tuned using a search or optimization algorithm that ...

V. Lakshmanan

2000-02-01T23:59:59.000Z

350

Hierarchical Structure for function approximation using radial basis function  

Science Conference Proceedings (OSTI)

The hierarchial network proposed (Multi-RBFNN), is composed of complete Radial Basis Function Neural Networks (RBFNNs) that are in charge of a reduced set of input variables with the property of which every Sub-RBFNN can take charge of a set of input ... Keywords: function approximation, hierarchical architectures, input variable selection, radial bases functions

A. Awad; H. Pomares; I. Rojas; L. J. Herrera; A. Guillen; O. Valenzuela

2005-12-01T23:59:59.000Z

351

Canister Storage Building (CSB) Design Basis Accident Analysis Documentation  

Science Conference Proceedings (OSTI)

This document provided the detailed accident analysis to support HNF-3553, Spent Nuclear Fuel Project Final Safety Analysis Report, Annex A, ''Canister Storage Building Final Safety Analysis Report''. All assumptions, parameters, and models used to provide the analysis of the design basis accidents are documented to support the conclusions in the Canister Storage Building Final Safety Analysis Report.

CROWE, R.D.; PIEPHO, M.G.

2000-03-23T23:59:59.000Z

352

Solar Power Tower Design Basis Document, Revision 0  

DOE Green Energy (OSTI)

This report contains the design basis for a generic molten-salt solar power tower. A solar power tower uses a field of tracking mirrors (heliostats) that redirect sunlight on to a centrally located receiver mounted on top a tower, which absorbs the concentrated sunlight. Molten nitrate salt, pumped from a tank at ground level, absorbs the sunlight, heating it up to 565 C. The heated salt flows back to ground level into another tank where it is stored, then pumped through a steam generator to produce steam and make electricity. This report establishes a set of criteria upon which the next generation of solar power towers will be designed. The report contains detailed criteria for each of the major systems: Collector System, Receiver System, Thermal Storage System, Steam Generator System, Master Control System, and Electric Heat Tracing System. The Electric Power Generation System and Balance of Plant discussions are limited to interface requirements. This design basis builds on the extensive experience gained from the Solar Two project and includes potential design innovations that will improve reliability and lower technical risk. This design basis document is a living document and contains several areas that require trade-studies and design analysis to fully complete the design basis. Project- and site-specific conditions and requirements will also resolve open To Be Determined issues.

ZAVOICO,ALEXIS B.

2001-07-01T23:59:59.000Z

353

Category theoretic aspects of chain-valued frames: Part I: Categorical and presheaf theoretic foundations  

Science Conference Proceedings (OSTI)

This paper is Part I of a two-part series dealing with category theoretic aspects of chain-valued frames. A new categorical motivation for lattice-valued frames is given from presheaves, and then, under the assumption that L be a complete chain, it is ... Keywords: L-topological spaces, Anti-stratified/stratified spaces, Characteristic/Martin/stratification functors, Cocompleteness, Completeness, Factorization structures, Image/preimage operators, Iota/omega functors, L-Frm, L-Loc, L-Top, L-frames, Spectrum functors, Universal/co-universal spaces, Upper/lower forgetful functors, Upper/lower free functors

A. Pultr; S. E. Rodabaugh

2008-03-01T23:59:59.000Z

354

Theoretical Description of the Fission Process  

Science Conference Proceedings (OSTI)

Advanced theoretical methods and high-performance computers may finally unlock the secrets of nuclear fission, a fundamental nuclear decay that is of great relevance to society. In this work, we studied the phenomenon of spontaneous fission using the symmetry-unrestricted nuclear density functional theory (DFT). Our results show that many observed properties of fissioning nuclei can be explained in terms of pathways in multidimensional collective space corresponding to different geometries of fission products. From the calculated collective potential and collective mass, we estimated spontaneous fission half-lives, and good agreement with experimental data was found. We also predicted a new phenomenon of trimodal spontaneous fission for some transfermium isotopes. Our calculations demonstrate that fission barriers of excited superheavy nuclei vary rapidly with particle number, pointing to the importance of shell effects even at large excitation energies. The results are consistent with recent experiments where superheavy elements were created by bombarding an actinide target with 48-calcium; yet even at high excitation energies, sizable fission barriers remained. Not only does this reveal clues about the conditions for creating new elements, it also provides a wider context for understanding other types of fission. Understanding of the fission process is crucial for many areas of science and technology. Fission governs existence of many transuranium elements, including the predicted long-lived superheavy species. In nuclear astrophysics, fission influences the formation of heavy elements on the final stages of the r-process in a very high neutron density environment. Fission applications are numerous. Improved understanding of the fission process will enable scientists to enhance the safety and reliability of the nation’s nuclear stockpile and nuclear reactors. The deployment of a fleet of safe and efficient advanced reactors, which will also minimize radiotoxic waste and be proliferation-resistant, is a goal for the advanced nuclear fuel cycles program. While in the past the design, construction, and operation of reactors were supported through empirical trials, this new phase in nuclear energy production is expected to heavily rely on advanced modeling and simulation capabilities.

Witold Nazarewicz

2009-10-25T23:59:59.000Z

355

Theoretical Studies of Hydrogen Storage Alloys.  

DOE Green Energy (OSTI)

Theoretical calculations were carried out to search for lightweight alloys that can be used to reversibly store hydrogen in mobile applications, such as automobiles. Our primary focus was on magnesium based alloys. While MgH{sub 2} is in many respects a promising hydrogen storage material, there are two serious problems which need to be solved in order to make it useful: (i) the binding energy of the hydrogen atoms in the hydride is too large, causing the release temperature to be too high, and (ii) the diffusion of hydrogen through the hydride is so slow that loading of hydrogen into the metal takes much too long. In the first year of the project, we found that the addition of ca. 15% of aluminum decreases the binding energy to the hydrogen to the target value of 0.25 eV which corresponds to release of 1 bar hydrogen gas at 100 degrees C. Also, the addition of ca. 15% of transition metal atoms, such as Ti or V, reduces the formation energy of interstitial H-atoms making the diffusion of H-atoms through the hydride more than ten orders of magnitude faster at room temperature. In the second year of the project, several calculations of alloys of magnesium with various other transition metals were carried out and systematic trends in stability, hydrogen binding energy and diffusivity established. Some calculations of ternary alloys and their hydrides were also carried out, for example of Mg{sub 6}AlTiH{sub 16}. It was found that the binding energy reduction due to the addition of aluminum and increased diffusivity due to the addition of a transition metal are both effective at the same time. This material would in principle work well for hydrogen storage but it is, unfortunately, unstable with respect to phase separation. A search was made for a ternary alloy of this type where both the alloy and the corresponding hydride are stable. Promising results were obtained by including Zn in the alloy.

Jonsson, Hannes

2012-03-22T23:59:59.000Z

356

A Business Intelligence Model to Predict Bankruptcy using Financial Domain Ontology with Association Rule Mining Algorithm  

E-Print Network (OSTI)

Today in every organization financial analysis provides the basis for understanding and evaluating the results of business operations and delivering how well a business is doing. This means that the organizations can control the operational activities primarily related to corporate finance. One way that doing this is by analysis of bankruptcy prediction. This paper develops an ontological model from financial information of an organization by analyzing the Semantics of the financial statement of a business. One of the best bankruptcy prediction models is Altman Z-score model. Altman Z-score method uses financial rations to predict bankruptcy. From the financial ontological model the relation between financial data is discovered by using data mining algorithm. By combining financial domain ontological model with association rule mining algorithm and Zscore model a new business intelligence model is developed to predict the bankruptcy.

Martin, A; Venkatesan, Dr V Prasanna

2011-01-01T23:59:59.000Z

357

Algorithms for Marketing-Mix Optimization  

E-Print Network (OSTI)

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

Gudmundsson, Joachim; Smid, Michiel

2009-01-01T23:59:59.000Z

358

Algorithms for Gene Clustering Analysis on Genomes  

E-Print Network (OSTI)

The increased availability of data in biological databases provides many opportunities for understanding biological processes through these data. As recent attention has shifted from sequence analysis to higher-level analysis of genes across multiple genomes, there is a need to develop efficient algorithms for these large-scale applications that can help us understand the functions of genes. The overall objective of my research was to develop improved methods which can automatically assign groups of functionally related genes in large-scale data sets by applying new gene clustering algorithms. Proposed gene clustering algorithms that can help us understand gene function and genome evolution include new algorithms for protein family classification, a window-based strategy for gene clustering on chromosomes, and an exhaustive strategy that allows all clusters of small size to be enumerated. I investigate the problems of gene clustering in multiple genomes, and define gene clustering problems using mathematical methodology and solve the problems by developing efficient and effective algorithms. For protein family classification, I developed two supervised classification algorithms that can assign proteins to existing protein families in public databases and, by taking into account similarities between the unclassified proteins, allows for progressive construction of new families from proteins that cannot be assigned. This approach is useful for rapid assignment of protein sequences from genome sequencing projects to protein families. A comparative analysis of the method to other previously developed methods shows that the algorithm has a higher accuracy rate and lower mis-classification rate when compared to algorithms that are based on the use of multiple sequence alignments and hidden Markov models. The proposed algorithm performs well even on families with very few proteins and on families with low sequence similarity. Apart from the analysis of individual sequences, identifying genomic regions that descended from a common ancestor helps us study gene function and genome evolution. In distantly related genomes, clusters of homologous gene pairs serve as evidence used in function prediction, operon detection, etc. Thus, reliable identification of gene clusters is critical to functional annotation and analysis of genes. I developed an efficient gene clustering algorithm that can be applied on hundreds of genomes at the same time. This approach allows for large-scale study of evolutionary relationships of gene clusters and study of operon formation and destruction. By placing a stricter limit on the maximum cluster size, I developed another algorithm that uses a different formulation based on constraining the overall size of a cluster and statistical estimates that allow direct comparisons of clusters of different size. A comparative analysis of proposed algorithms shows that more biological insight can be obtained by analyzing gene clusters across hundreds of genomes, which can help us understand operon occurrences, gene orientations and gene rearrangements.

Yi, Gang Man

2011-05-01T23:59:59.000Z

359

The Cambridge Jet algorithm: features and applications  

E-Print Network (OSTI)

Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition values of y_cut for this clustering scheme, which allows to resolve any event to a definite number of jets in the final state. We discuss some particularities of the Cambridge clustering method and compare its performance to the Durham clustering scheme for Monte Carlo generated e+e- annihilation events.

Stan Bentvelsen; Irmtraud Meyer

1998-03-12T23:59:59.000Z

360

Graph algorithms in the titan toolkit.  

Science Conference Proceedings (OSTI)

Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

McLendon, William Clarence, III; Wylie, Brian Neil

2009-10-01T23:59:59.000Z

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


361

Topics in Mode Conversion Theory and the Group Theoretical Foundations of Path Integrals  

E-Print Network (OSTI)

This dissertation reports research about the phase space perspective for solving wave problems, with particular emphasis on the phenomenon of mode conversion in multicomponent wave systems, and the mathematics which underlie the phase space perspective. Part I of this dissertation gives a review of the phase space theory of resonant mode conversion. We describe how the WKB approximation is related to geometrical structures in phase space, and how in particular ray-tracing algorithms can be used to construct the WKB solution. We also present new higher order corrections to the local solution for the mode conversion problem which allow better asymptotic matching to the WKB solutions. The phase space tools used in Part I rely on the Weyl symbol calculus, which gives a way to relate operators to functions on phase space. In Part II of this dissertation, we explore the mathematical foundations of the theory of symbols. We go on to present the group theoretical formulation of symbols, as developed recently by Zobin. This defines the symbol of an operator in terms of a double Fourier transform on a non-commutative group. We then show how the path integral arises when calculating the symbol of a function of an operator. We conclude with a survey of ideas for future research and describe several potential applications of this group theoretical perspective to problems in mode conversion.

A. S. Richardson

2009-01-12T23:59:59.000Z

362

A theoretical approach for dynamic modelling of sustainable development  

Science Conference Proceedings (OSTI)

This article presents a theoretical model for a dynamic system based on sustainable development. Due to the relatively absence of theoretical studies and practical issues in the area of sustainable development, Romania aspires to the principles of sustainable ... Keywords: economic development, economic system, economic welfare, natural environment, resources scarcity, sustainable development

Corina-Maria Ene; Anda Gheorghiu; Anca Gheorghiu

2011-02-01T23:59:59.000Z

363

Graph-Theoretic Techniques for Web Content Mining  

Science Conference Proceedings (OSTI)

Describing exciting new opportunities for utilizing robust graph representations of data with common machine learning algorithms, this book demonstrates and investigates these novel techniques through the domain of web content mining.

Adam Schenker; Horst Bunke; Mark Last; Abraham Kandel

2005-05-01T23:59:59.000Z

364

An information theoretic approach for tracker performance evaluation  

E-Print Network (OSTI)

Automated tracking of vehicles and people is essential for the effective utilization of imagery in wide area surveillance applications. In order to determine the best tracking algorithm and parameters for a given application, ...

Kao, Edward K.

365

THEORETICAL ASPECTS OF NONLEPTONIC HYPERON DECAYS  

SciTech Connect

Recent experimental results on nonleptonic hyperon decays are studied on the basis of a doublet approximation for strong and weak interactions, with the implied suggestion that this higher symmetry may be more easlly discernable in such reactions in which K-panticles do not occur explicitly. The doublet approximation is characterized by a doublet spin I which is equal to 1/2, 1, 0 for baryons, pi , K, respectively, and by a K spin. It is not necessary to assume that the strong K interactions are weak compared to the strong pi interactions. For the mentioned reactions it is necessary to assume that the strong interactions which do not conserve I play a minor role compared to those which conserve I. The following refinement of the nonleptonic DELTA T = 1/2 rule is proposed. (T = isotopic spin.) The weak nonleptonic interactions consist of two parts H/sup (0)/, H/sup (1)/ with DELTA I = 0, 1, respectively. In the doublet approximation H/sup (o)/ and H/sup (1)/ separately conserve parity in the presence of all strong pi and K interactions. H/sup (o)/ and H/sup (1)/ together do not conserve parity, however. In addition to DELTA I = 1, H/sup )1)/ should in general satisfy a further constraint, but there are classes of graphs for which DELTA I = 1 is sufficient. Current x current structures for H/sup (o)/ and H/sup (1)/ are examined. Resul ts of an earlier paper can be viewed as a special case of the DELTA I = 0, 1 rule. The same is true for results obtained by Feldman, Matthews, and Salam and by Woifenstein. The considerations of these authors can be extended to wider classes of graphs. Odd relative helicity and the relation between rates for LAMBDA -- p + pi -, SIGMA + -- p + pi /sup o/ are consequences of the DELTA I = 0, 1 rule only. So is the prediction that XI decay is strongly P nonconserving. The parity properties of H/sup (o)/ H/sup (1)/ are sufficient conditions. It is a delicate question whether they are necessary. For a subset of graphs they are not necessary, but this set seems arbitrary. If it is assumed that the parity conditions are necessary, the schizon scheme is ruled out. It is noted that the nonleptonic weak interactions may be generated by the strong interactions in terms of the following prescription. H/sup (1)/ is generated by assuming that the pi (K) fields have small K( pi ) components. An H/sup (o)/ is generated by assuming that the doublets N/sup 1/(N/sup 2/) have small N/sub 2/(N/sub 1/) components; likewise for N/sub 3/ and N/sub 4/. Further, it is observed thai one can construct a non- electromagnetic DELTA T =3/2 interaction which is small in the sense that it only contributes to K/sub pi //sub 2+/ to the extent t hat the doublet approximation is not valid. (auth)

Pais, A.

1961-04-01T23:59:59.000Z

366

Biological Basis for Radiation Adaptive Responses that Protect Against  

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

Basis for Radiation Adaptive Responses that Protect Against Basis for Radiation Adaptive Responses that Protect Against Bronchial Epithelial Cell Transformation Wenshu Chen Lovelace Respiratory Research Institute Abstract The major hypothesis in this project is that low-dose, low linear-energy-transfer (LET) radiation stimulates an adaptive response that protects cells from neoplastic transformation involving modulation of paracrine factors (e.g., cytokines), cell survival/death signaling pathways, and reprogramming of the epigenome. To test this hypothesis, a validated, sensitive in vitro transformation model and a media transfer method were used to study the mechanisms of low-LET gamma radiation activated natural protection (ANP) against chemical carcinogen-induced bronchial cell transformation. Immortalized human bronchial epithelial cell

367

Preparation of Safety Basis Documents for Transuranic (TRU) Waste Facilities  

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

5506-2007 5506-2007 April 2007 DOE STANDARD Preparation of Safety Basis Documents for Transuranic (TRU) Waste Facilities U.S. Department of Energy Washington, D.C. 20585 AREA-SAFT DISTRIBUTION STATEMENT A. Approved for public release; distribution is unlimited. DOE-STD-5506-2007 ii Available on the Department of Energy Technical Standards Program Web Site at Http://tis.eh.doe.gov/techstds/ DOE-STD-5506-2007 iii Foreword This Standard provides analytical assumptions and methods, as well as hazard controls to be used when developing Safety Basis (SB) documents for transuranic (TRU) waste facilities in the U.S. Department of Energy (DOE) Complex. It also provides supplemental technical

368

Technical Basis for DOE Policy 420.1  

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

HS-0006 HS-0006 TECHNICAL BASIS FOR U.S. DEPARTMENT OF ENERGY NUCLEAR SAFETY POLICY, DOE POLICY 420.1 U.S. DEPARTMENT OF ENERGY OFFICE OF HEALTH, SAFETY AND SECURITY OFFICE OF NUCLEAR SAFETY JULY 2011 i Executive Summary This document provides the technical basis for the Department of Energy (DOE) Policy (P) 420.1, Nuclear Safety Policy, dated 2-8-2011. It includes an analysis of the revised Policy to determine whether it provides the necessary and sufficient high-level expectations that will lead DOE to establish and implement appropriate requirements to assure protection of the public, workers, and the environment from the hazards of DOE's operation of nuclear facilities. In developing the revised Policy and performing this analysis, DOE reviewed the current Nuclear

369

Basis for NGNP Reactor Design Down-Selection  

Science Conference Proceedings (OSTI)

The purpose of this paper is to identify the extent of technology development, design and licensing maturity anticipated to be required to credibly identify differences that could make a technical choice practical between the prismatic and pebble bed reactor designs. This paper does not address a business decision based on the economics, business model and resulting business case since these will vary based on the reactor application. The selection of the type of reactor, the module ratings, the number of modules, the configuration of the balance of plant and other design selections will be made on the basis of optimizing the Business Case for the application. These are not decisions that can be made on a generic basis.

L.E. Demick

2010-08-01T23:59:59.000Z

370

Basis for NGNP Reactor Design Down-Selection  

SciTech Connect

The purpose of this paper is to identify the extent of technology development, design and licensing maturity anticipated to be required to credibly identify differences that could make a technical choice practical between the prismatic and pebble bed reactor designs. This paper does not address a business decision based on the economics, business model and resulting business case since these will vary based on the reactor application. The selection of the type of reactor, the module ratings, the number of modules, the configuration of the balance of plant and other design selections will be made on the basis of optimizing the Business Case for the application. These are not decisions that can be made on a generic basis.

L.E. Demick

2011-11-01T23:59:59.000Z

371

VC-dimension and shortest path algorithms  

Science Conference Proceedings (OSTI)

We explore the relationship between VC-dimension and graph algorithm design. In particular, we show that set systems induced by sets of vertices on shortest paths have VC-dimension at most two. This allows us to use a result from learning theory to improve ...

Ittai Abraham; Daniel Delling; Amos Fiat; Andrew V. Goldberg; Renato F. Werneck

2011-07-01T23:59:59.000Z

372

Algorithms for dynamic multicast key distribution  

Science Conference Proceedings (OSTI)

We study the problem of multicast key distribution for group security. Secure group communication systems typically rely on a group key, which is a secret shared among the members of the group. This key is used to provide privacy by encrypting all group ... Keywords: Dynamic key distribution, experimental algorithms, multicast

Justin Goshi; Richard E. Ladner

2007-02-01T23:59:59.000Z

373

Comparative Benchmarks of full QCD Algorithms  

E-Print Network (OSTI)

We report performance benchmarks for several algorithms that we have used to simulate the Schr"odinger functional with two flavors of dynamical quarks. They include hybrid and polynomial hybrid Monte Carlo with preconditioning. An appendix describes a method to deal with autocorrelations for nonlinear functions of primary observables as they are met here due to reweighting.

Roberto Frezzotti; Martin Hasenbusch; Jochen Heitger; Karl Jansen; Ulli Wolff

2000-09-20T23:59:59.000Z

374

Asynchronous Event-Driven Particle Algorithms  

Science Conference Proceedings (OSTI)

We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics, is well known. We also present a recently ... Keywords: Asynchronous, event-driven, kinetic Monte Carlo, molecular dynamics, particle systems

Aleksandar Donev

2009-04-01T23:59:59.000Z

375

Verifying concurrent memory reclamation algorithms with grace  

Science Conference Proceedings (OSTI)

Memory management is one of the most complex aspects of modern concurrent algorithms, and various techniques proposed for it--such as hazard pointers, read-copy-update and epoch-based reclamation--have proved very challenging for formal reasoning. In ...

Alexey Gotsman; Noam Rinetzky; Hongseok Yang

2013-03-01T23:59:59.000Z

376

Some Theory for Generalized Boosting Algorithms  

Science Conference Proceedings (OSTI)

We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. We consider the population version of the boosting algorithm and prove ...

Peter J. Bickel; Ya'acov Ritov; Alon Zakai

2006-12-01T23:59:59.000Z

377

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network (OSTI)

. This volume will constitute Deliverable D10. The editorial process is still underway, and publication volume. Contents of forthcoming LNCS Volume 1. D. Bader and B. Moret: Issues in experimental parallel of topics in experimental algorithmics. The report of the seminar Basic Research in Computer Science, www

Brodal, Gerth Stølting

378

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network (OSTI)

. This volume will constitute Deliverable D10. The editorial process is still underway, and publication volume. Contents of forthcoming LNCS Volume 1. D. Bader and B. Moret: Issues in experimental parallel of topics in experimental algorithmics. The report of the seminar # Basic Research in Computer Science, www

Brodal, Gerth Stølting

379

Negative selection algorithms without generating detectors  

Science Conference Proceedings (OSTI)

Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of the negative examples, and these detectors are then matched against ... Keywords: artificial immune systems, consistent learning, negative selection

Maciej Li?kiewicz; Johannes Textor

2010-07-01T23:59:59.000Z

380

A scalable lock-free stack algorithm  

E-Print Network (OSTI)

The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blocking, and the elimination trees are non-blocking but not linearizable. Neither is used in practice since they perform well only at exceptionally high loads. The literature also describes a simple lock-free linearizable stack algorithm that works at low loads but does not scale as the load increases. The question of designing a stack algorithm that is non-blocking, linearizable, and scales well throughout the concurrency range, has thus remained open. This paper presents such a concurrent stack algorithm. It is based on the following simple observation: that a single elimination array used as a backoff scheme for a simple lock-free stack is lock-free, linearizable, and scalable. As our empirical results show, the resulting eliminationbackoff stack performs as well as the simple stack at low loads, and increasingly outperforms all other methods (lock-based and non-blocking) as concurrency increases. We believe its simplicity and scalability make it a viable practical alternative to existing constructions for implementing concurrent stacks.

Danny Hendler; Nir Shavit; Lena Yerushalmi

2004-01-01T23:59:59.000Z

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


381

New algorithms research for first year students  

Science Conference Proceedings (OSTI)

Motivated first-year undergraduate students should be exposed to some of the processes of research and some of the latest results. This brings them into the university culture quickly and encourages them to feel part of the development of the computer ... Keywords: CS1/2, approximation algorithms, haskell, research-led teaching, undergraduate research/capstones

Anthony Wirth; Michael Bertolacci

2006-06-01T23:59:59.000Z

382

“Energy-conserving” plasma simulation algorithms  

Science Conference Proceedings (OSTI)

Lewis has found algorithms for many-particle plasma simulation models in which there exists an exact energy constant in the limit of small time step. The requirements for energy consevation are examined here and relaxed from those given by Lewis, in ...

A. Bruce Langdon

1973-02-01T23:59:59.000Z

383

Algorithmic parameterization of mixed treatment comparisons  

Science Conference Proceedings (OSTI)

Mixed Treatment Comparisons (MTCs) enable the simultaneous meta-analysis (data pooling) of networks of clinical trials comparing ¿2 alternative treatments. Inconsistency models are critical in MTC to assess the overall consistency between evidence sources. ... Keywords: Algorithm, Evidence consistency, Indirect comparisons, Mixed treatment comparison, Model generation, Network meta-analysis

Gert Valkenhoef; Tommi Tervonen; Bert Brock; Hans Hillege

2012-09-01T23:59:59.000Z

384

An algorithm for underdetermined mixing matrix estimation  

Science Conference Proceedings (OSTI)

This paper considers the problem of mixing matrix estimation in underdetermined blind source separation (UBSS). We propose a simple and effective detection algorithm which detects the time-frequency (TF) points occupied by only a single source for each ... Keywords: Mixing matrix estimation, Robust clustering, Sparse component analysis, Underdetermined blind source separation

Tianbao Dong; Yingke Lei; Jingshu Yang

2013-03-01T23:59:59.000Z

385

Groundwater Remediation Strategy Using Global Optimization Algorithms  

E-Print Network (OSTI)

. DOI: 10.1061/ ASCE 0733-9496 2002 128:6 431 CE Database keywords: Ground water; Remedial action; Algorithms; Ground-water management. Introduction The contamination of groundwater is a widespread problem al. 1992 , Jonoski et al. 1997 ; and Willis and Yeh 1987 . However, the fact that the optimization

Neumaier, Arnold

386

Versatile communication algorithms for data analysis  

Science Conference Proceedings (OSTI)

Large-scale parallel data analysis, where global information from a variety of problem domains is resolved in a distributed memory space, relies on communication. Three communication algorithms motivated by data analysis workloads--merge based reduction, ... Keywords: communication for large-scale parallel data analysis

Tom Peterka; Robert Ross

2012-09-01T23:59:59.000Z

387

Expressing graph algorithms using generalized active messages  

Science Conference Proceedings (OSTI)

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

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

2013-08-01T23:59:59.000Z

388

CRT RSA algorithm protected against fault attacks  

Science Conference Proceedings (OSTI)

Embedded devices performing RSA signatures are subject to Fault Attacks, particularly when the Chinese Remainder Theorem is used. In most cases, the modular exponentiation and the Garner recombination algorithms are targeted. To thwart Fault Attacks, ... Keywords: RSA, chinese remainder theorem, fault attacks, modular exponentiation, simple power analysis, smart card

Arnaud Boscher; Robert Naciri; Emmanuel Prouff

2007-05-01T23:59:59.000Z

389

A Quantum Genetic Algorithm for Operon Prediction  

Science Conference Proceedings (OSTI)

Operon is a fundamental unit of transcription which is usually used to understand gene regulations and functions in entire genomes. Detecting operon experimentally is difficult and time-consuming, thus many bioinformatics algorithms have been proposed ... Keywords: quantum theory, intergenic distance, metabolic pathway, COG

Li-Yeh Chuang; Yi-Cheng Chiang; Cheng-Hong Yang

2012-03-01T23:59:59.000Z

390

A spreadsheet algorithm for stagewise solvent extraction  

SciTech Connect

Part of the novelty is the way in which the problem is organized in the spreadsheet. In addition, to facilitate spreadsheet setup, a new calculational procedure has been developed. The resulting Spreadsheet Algorithm for Stagewise Solvent Extraction (SASSE) can be used with either IBM or Macintosh personal computers as a simple yet powerful tool for analyzing solvent extraction flowsheets.

Leonard, R.A.; Regalbuto, M.C.

1993-01-01T23:59:59.000Z

391

Problems of future GMDH algorithms development  

Science Conference Proceedings (OSTI)

Theories and algorithms developed for pattern recognition can be applied to random processes forecasting and for solution of all another interpolation type problems of artificial intelligence. For this purpose input data sample in the form of time series ... Keywords: approximation, computer software, error analysis, filtering, neural network

A. G. Ivakhnenko; E. A. Savchenko; G. A. Ivakhnenko

2003-10-01T23:59:59.000Z

392

Fast Deterministic Distributed Algorithms for Sparse Spanners  

E-Print Network (OSTI)

in o(n # ) time for any constant # > 0. More precisely, in the Linial's free model a.k.a LOCAL model spanners, time complexity, Linial's free model, deterministic and randomized algorithms 1 Introduction 1 of the spanner. The distributed model of computation we will be concerned with is the Linial's free model [Lin87

393

Quantum Algorithms for Graph Problems -- A Survey  

E-Print Network (OSTI)

In this survey we give an overview about important methods to construct quantum algorithms and quantum lower bounds for graph problems. We show how to use these methods, and we give a summary about the quantum complexity of the most important graph problems. At the end of our paper, we give some interesting questions in this research area.

Sebastian Dörn

2006-01-01T23:59:59.000Z

394

Quantum Statistical Testing of a QRNG Algorithm  

Science Conference Proceedings (OSTI)

We present the algorithmic design of a quantum random number generator, the subsequent synthesis of a physical design and its verification using quantum statistical testing. We also describe how quantum statistical testing can be used to diagnose channel noise in QKD protocols.

Humble, Travis S [ORNL; Pooser, Raphael C [ORNL; Britt, Keith A [ORNL

2013-01-01T23:59:59.000Z

395

Modified expectation maximization algorithm for MRI segmentation  

Science Conference Proceedings (OSTI)

Magnetic Resonance Image segmentation is a fundamental task in a wide variety of computed-based medical applications that support therapy, diagnostic and medical applications. In this work, spatial information is included for estimating paramaters of ... Keywords: expectation maximization algorithm, finite mixture models, magnetic resonance imaging segmentation, spatial information

Ramiro Donoso; Alejandro Veloz; Héctor Allende

2010-11-01T23:59:59.000Z

396

Xl: an efficient network routing algorithm  

Science Conference Proceedings (OSTI)

In this paper, we present a new link-state routing algorithm called Approximate Link state (XL) aimed at increasing routing efficiency by suppressing updates from parts of the network. We prove that three simple criteria for update propagation are sufficient ... Keywords: link-state, routing protocol

Kirill Levchenko; Geoffrey M. Voelker; Ramamohan Paturi; Stefan Savage

2008-08-01T23:59:59.000Z

397

A Comparative Study of Palmprint Recognition Algorithms  

Science Conference Proceedings (OSTI)

Palmprint images contain rich unique features for reliable human identification, which makes it a very competitive topic in biometric research. A great many different low resolution palmprint recognition algorithms have been developed, which can be roughly ... Keywords: Biometrics, feature extraction, palmprint recognition, performance evaluation, person identification

David Zhang; Wangmeng Zuo; Feng Yue

2012-01-01T23:59:59.000Z

398

First-Generation Monitoring System for ADA: Design Basis  

Science Conference Proceedings (OSTI)

The vision of the EPRI ADA Program (Program 124) is to create the technology basis for the distribution system of the future by transforming traditional single-function distribution systems into multifunctional power and information exchange systems with increased reliability, improved performance (lower system losses), better economics, better power quality, and more customer service options. Achieving this vision will require capturing the benefits of new capabilities in power electronics, information ...

2006-12-18T23:59:59.000Z

399

Engineering basis for selection of positron source material  

Science Conference Proceedings (OSTI)

This note describes the engineering basis for the selection of the positron source material. It assumes the approximate physics parameters have already been chosen (i.e. a high Z material of 6 radiation lengths thickness). As part of this study a basic heat transfer analysis of the target was performed and is discussed. It is concluded that Ta-10W is the most likely material to meet required physics parameters and not fail structurally.

Feerick, B.

1983-10-10T23:59:59.000Z

400

Burnup Credit — Technical Basis for Spent-Fuel Burnup Verification  

Science Conference Proceedings (OSTI)

Present regulatory practices provide as much burnup credit flexibility as can be currently expected. Further progress is achievable by incorporating the negative reactivity effects of a subset of neutron-absorbing fission-product isotopes, and by optimizing the procedural approach for establishing the burnup characteristics of the spent fuel to be loaded in burnup-credit-designed storage and transportation systems. This report describes progress toward developing a technical basis for a cost-effective bu...

2003-12-02T23:59:59.000Z

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


401

Evolution of Safety Basis Documentation for the Fernald Site  

SciTech Connect

The objective of the Department of Energy's (DOE) Fernald Closure Project (FCP), in suburban Cincinnati, Ohio, is to safely complete the environmental restoration of the Fernald site by 2006. Over 200 out of 220 total structures, at this DOE plant site which processed uranium ore concentrates into high-purity uranium metal products, have been safely demolished, including eight of the nine major production plants. Documented Safety Analyses (DSAs) for these facilities have gone through a process of simplification, from individual operating Safety Analysis Reports (SARs) to a single site-wide Authorization Basis containing nuclear facility Bases for Interim Operations (BIOs) to individual project Auditable Safety Records (ASRs). The final stage in DSA simplification consists of project-specific Integrated Health and Safety Plans (I-HASPs) and Nuclear Health and Safety Plans (N-HASPs) that address all aspects of safety, from the worker in the field to the safety basis requirements preserving the facility/activity hazard categorization. This paper addresses the evolution of Safety Basis Documentation (SBD), as DSAs, from production through site closure.

Brown, T.; Kohler, S.; Fisk, P.; Krach, F.; Klein, B.

2004-03-01T23:59:59.000Z

402

Algorithms to Automate LCLS Undulator Tuning  

Science Conference Proceedings (OSTI)

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

Wolf, Zachary

2010-12-03T23:59:59.000Z

403

Cardinal exponential splines: Part I—Theory and filtering algorithms  

E-Print Network (OSTI)

Abstract—Causal exponentials play a fundamental role in classical system theory. Starting from those elementary building blocks, we propose a complete and self-contained signal processing formulation of exponential splines defined on a uniform grid. We specify the corresponding B-spline basis functions and investigate their reproduction properties (Green function and exponential polynomials); we also characterize their stability (Riesz bounds). We show that the exponential B-spline framework allows an exact implementation of continuous-time signal processing operators including convolution, differential operators, and modulation, by simple processing in the discrete B-spline domain. We derive efficient filtering algorithms for multiresolution signal extrapolation and approximation, extending earlier results for polynomial splines. Finally, we present a new asymptotic error formula that predicts the magnitude and the th-order decay of the P-approximation error as a function of the knot spacing. Index Terms—Continuous-time signal processing, convolution, differential operators, Green functions, interpolation, modulation, multiresolution approximation, splines. I.

Michael Unser; Thierry Blu

2005-01-01T23:59:59.000Z

404

Theoretical Studies of Low Frequency Instabilities in the Ionosphere. Final Report  

DOE Green Energy (OSTI)

The objective of the current project is to provide a theoretical basis for better understanding of numerous radar and rocket observations of density irregularities and related effects in the lower equatorial and high-latitude ionospheres. The research focused on: (1) continuing efforts to develop a theory of nonlinear saturation of the Farley-Buneman instability; (2) revision of the kinetic theory of electron-thermal instability at low altitudes; (3) studying the effects of strong anomalous electron heating in the high-latitude electrojet; (4) analytical and numerical studies of the combined Farley-Bunemadion-thermal instabilities in the E-region ionosphere; (5) studying the effect of dust charging in Polar Mesospheric Clouds. Revision of the kinetic theory of electron thermal instability at low altitudes.

Dimant, Y. S.

2003-08-20T23:59:59.000Z

405

Theoretical evaluation of R22 and R502 alternatives. Final report  

SciTech Connect

The study was conducted using a semi-theoretical model, CYCLE-11, with a pure cross-flow representation of heat transfer in the evaporator and condenser. The Carnahan-Starling-DeSantis equation of state was used for calculating thermodynamic properties. Transport properties were not involved in the simulations. Simulations were conducted for ``drop-in`` performance, for performance in a modified system to assess the fluids` potentials, and for performance in a modified system equipped with a liquid-line/suction-line heat exchanger. The results - presented on a relative basis to R22 and R502 performance - include the volumetric capacity, coefficient of performance, pressure increase across the compressor, and compressor discharge pressure and temperature.

Domanski, P.A.; Didion, D.A. [National Inst. of Standards and Technology (NEL), Gaithersburg, MD (United States). Building Environment Div.

1993-01-01T23:59:59.000Z

406

The Storm Cell Identification and Tracking Algorithm: An Enhanced WSR-88D Algorithm  

Science Conference Proceedings (OSTI)

Accurate storm identification and tracking are basic and essential parts of radar and severe weather warning operations in today’s operational meteorological community. Improvements over the original WSR-88D storm series algorithm have been made ...

J. T. Johnson; Pamela L. MacKeen; Arthur Witt; E. De Wayne Mitchell; Gregory J. Stumpf; Michael D. Eilts; Kevin W. Thomas

1998-06-01T23:59:59.000Z

407

Business Case Slide 8: High-Volume: Repository - Basis for Use  

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

Volume: Repository - Basis for Use Basis for use DUO2 in or near cask should be a geochemical barrier Establish reducing conditions Inhibit spent fuel dissolution Keep...

408

ACO Algorithm for MKP Using Various Heuristic Information  

Science Conference Proceedings (OSTI)

The ant colony optimization (ACO) algorithms are being applied successfully to diverse heavily constrained problems: traveling salesman problem, quadratic assignment problem. Early applications of ACO algorithms have been mainly concerned with solving ...

Stefka Fidanova

2002-08-01T23:59:59.000Z

409

Algorithms, Datastructures, and other Issues in Efficient Automated Deduction  

Science Conference Proceedings (OSTI)

Algorithms and datastructures form the kernel of any efficient theorem prover. In this abstract we discuss research on algorithms and datastructures for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly ...

Andrei Voronkov

2001-06-01T23:59:59.000Z

410

A scalable MPI_Comm_split algorithm for exascale computing  

Science Conference Proceedings (OSTI)

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

Paul Sack; William Gropp

2010-09-01T23:59:59.000Z

411

A genetic k-modes algorithm for clustering categorical data  

Science Conference Proceedings (OSTI)

Many optimization based clustering algorithms suffer from the possibility of stopping at locally optimal partitions of data sets. In this paper, we present a genetic k-Modes algorithm(GKMODE) that finds a globally optimal partition of a given ...

Guojun Gan; Zijiang Yang; Jianhong Wu

2005-07-01T23:59:59.000Z

412

Evaluation of RADAP II Severe-Storm-Detection Algorithms  

Science Conference Proceedings (OSTI)

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

Herb A. Winston; Larry J. Ruthi

1986-02-01T23:59:59.000Z

413

Bacterial Foraging Optimization Algorithm Integrating Tabu Search for Motif Discovery  

Science Conference Proceedings (OSTI)

Extracting motifs in the sea of DNA sequences is an intricate task but have great significance. We propose an alternative solution integrating bacterial foraging optimization (BFO) algorithm and Tabu Search (TS) algorithm namely TS-BFO. We modify the ...

Linlin Shao; Yuehui Chen

2009-11-01T23:59:59.000Z

414

A Passive Microwave Algorithm for Tropical Oceanic Rainfall  

Science Conference Proceedings (OSTI)

This study discusses a rainfall algorithm utilizing six channels of microwave radiance data from the Nimbus-7 Scanning Multifrequency Microwave Radiometer. The algorithm is intended for short-term climate studies over the ocean at low latitudes. ...

Barry B. Hinton; William S. Olson; David W. Martin; Brian Auvine

1992-12-01T23:59:59.000Z

415

The WSR-88D Severe Weather Potential Algorithm  

Science Conference Proceedings (OSTI)

The WSR-88D severe weather potential (SWP) algorithm is an automated procedure for the detection of severe local storms. The algorithm identifies individual thunderstorm cells within radar imagery and, for each cell, yields an index proportional ...

David H. Kitzmiller; Wayne E. McGovern; Robert F. Saffle

1995-03-01T23:59:59.000Z

416

A hybrid heuristic algorithm for the rectangular packing problem  

Science Conference Proceedings (OSTI)

A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-and-conquer and greedy strategies. The computational results on a class of benchmark problems have shown that the ...

Defu Zhang; Ansheng Deng; Yan Kang

2005-05-01T23:59:59.000Z

417

Semi-Lagrangian Advection Schemes and Eulerian WKL Algorithms  

Science Conference Proceedings (OSTI)

Several advection experiments were conducted to test semi-Lagrangian schemes and Eulerian Warming-Kutler-Lomax (WKL) algorithms. The Eulerian WKL algorithms, as a special case of fourth-degree (order) Lagrange interpolation, exhibit unacceptable ...

Ching-Yuang Huang

1994-07-01T23:59:59.000Z

418

On Massively Parallel Algorithm for Nonlinear Stochastic Network Problems  

E-Print Network (OSTI)

We develop an algorithm for solving nonlinear two-stage stochastic problems with network recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage ...

Nielson, Soren S.

419

Reservoir Operation by Ant Colony Optimization Algorithms M. R. ...  

E-Print Network (OSTI)

many features which are similar to genetic algorithms (GAs). Table 1 ..... discretized storage volumes as well as along the 60-month operation horizon makes the local update rule .... "Optimization, learning and natural algorithms" Ph .D. Thesis,.

420

A Total Lightning Trending Algorithm to Identify Severe Thunderstorms  

Science Conference Proceedings (OSTI)

An algorithm that provides an early indication of impending severe weather from observed trends in thunderstorm total lightning flash rates has been developed. The algorithm framework has been tested on 20 thunderstorms, including 1 nonsevere ...

Patrick N. Gatlin; Steven J. Goodman

2010-01-01T23:59:59.000Z

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


421

The Rain Profiling Algorithm Applied to Polarimetric Weather Radar  

Science Conference Proceedings (OSTI)

The algorithm developed in this paper for ground-based polarimetric radars is derived from those used for the spaceborne rain radar of TRMM (Tropical Rainfall Measurement Mission)—the so-called rain profiling algorithms. The characteristic of ...

Jacques Testud; Erwan Le Bouar; Estelle Obligis; Mustapha Ali-Mehenni

2000-03-01T23:59:59.000Z

422

A graph-theoretic model of lexical syntactic acquisition  

Science Conference Proceedings (OSTI)

This paper presents a graph-theoretic model of the acquisition of lexical syntactic representations. The representations the model learns are non-categorical or graded. We propose a new evaluation methodology of syntactic acquisition in the framework ...

Hinrich Schütze; Michael Walsh

2008-10-01T23:59:59.000Z

423

Theoretical Assessment of 178m2Hf De-Excitation  

Science Conference Proceedings (OSTI)

This document contains a comprehensive literature review in support of the theoretical assessment of the {sup 178m2}Hf de-excitation, as well as a rigorous description of controlled energy release from an isomeric nuclear state.

Hartouni, E P; Chen, M; Descalle, M A; Escher, J E; Loshak, A; Navratil, P; Ormand, W E; Pruet, J; Thompson, I J; Wang, T F

2008-10-06T23:59:59.000Z

424

A system theoretic approach to design safety into medical device  

E-Print Network (OSTI)

The goal of this thesis is to investigate and demonstrate the application of a systems approach to medical device safety in China. Professor Leveson has developed an accident modeling framework called STAMP (Systems Theoretic ...

Song, Qingyang S.M. Massachusetts Institute of Technology

2012-01-01T23:59:59.000Z

425

Theoretical Physics | U.S. DOE Office of Science (SC)  

Office of Science (SC) Website

Frontier Theoretical Physics Unique Aspects and Scientific Challenges Advanced Technology R&D Accelerator R&D Stewardship Research Highlights .pdf file (13.1MB) Questions for the...

426

Parameterization of the Condensation Process: A Theoretical Approach  

Science Conference Proceedings (OSTI)

A theoretical formulation is given that allows separate consideration of the major factors governing cloud droplet spectra in nonprecipitating cumulus clouds: activation of nuclei, condensational growth, and turbulent mixing. Broad spectra are ...

J. L. Brenguier

1991-01-01T23:59:59.000Z

427

Information-theoretic limits of dense underwater networks  

E-Print Network (OSTI)

Information-theoretic throughput scaling laws are analyzed in an underwater acoustic network with n regularly located nodes on a unit square, in which both bandwidth and received signal power can be severely limited. A ...

Shin, Won-Yong

428

Cooperative Energy Network Optimization for Distributed Microgrids: Game Theoretic Approach  

E-Print Network (OSTI)

Cooperative Energy Network Optimization for Distributed Microgrids: Game Theoretic Approach Y. Wasa. 1 5) 6, 7) 8) 6, 9) 10) 7) Receding Horizon Fig. 1: Distributed Microgrids4) 2 2.1 n V := {1

429

Theoretical Studies of Hydrogen Effects on Lithium-based Ceramics ...  

Science Conference Proceedings (OSTI)

Presentation Title, Theoretical Studies of Hydrogen Effects on Lithium-based Ceramics for Tritium-breeding Application in Fusion Reactor ... in Energy Materials: Some Examples in Hydrogen Storage, Thermoelectrics and Nuclear Materials.

430

RELEASE OF DRIED RADIOACTIVE WASTE MATERIALS TECHNICAL BASIS DOCUMENT  

Science Conference Proceedings (OSTI)

This technical basis document was developed to support RPP-23429, Preliminary Documented Safety Analysis for the Demonstration Bulk Vitrification System (PDSA) and RPP-23479, Preliminary Documented Safety Analysis for the Contact-Handled Transuranic Mixed (CH-TRUM) Waste Facility. The main document describes the risk binning process and the technical basis for assigning risk bins to the representative accidents involving the release of dried radioactive waste materials from the Demonstration Bulk Vitrification System (DBVS) and to the associated represented hazardous conditions. Appendices D through F provide the technical basis for assigning risk bins to the representative dried waste release accident and associated represented hazardous conditions for the Contact-Handled Transuranic Mixed (CH-TRUM) Waste Packaging Unit (WPU). The risk binning process uses an evaluation of the frequency and consequence of a given representative accident or represented hazardous condition to determine the need for safety structures, systems, and components (SSC) and technical safety requirement (TSR)-level controls. A representative accident or a represented hazardous condition is assigned to a risk bin based on the potential radiological and toxicological consequences to the public and the collocated worker. Note that the risk binning process is not applied to facility workers because credible hazardous conditions with the potential for significant facility worker consequences are considered for safety-significant SSCs and/or TSR-level controls regardless of their estimated frequency. The controls for protection of the facility workers are described in RPP-23429 and RPP-23479. Determination of the need for safety-class SSCs was performed in accordance with DOE-STD-3009-94, Preparation Guide for US. Department of Energy Nonreactor Nuclear Facility Documented Safety Analyses, as described below.

KOZLOWSKI, S.D.

2007-05-30T23:59:59.000Z

431

Interim safety basis for fuel supply shutdown facility  

SciTech Connect

This ISB in conjunction with the new TSRs, will provide the required basis for interim operation or restrictions on interim operations and administrative controls for the Facility until a SAR is prepared in accordance with the new requirements. It is concluded that the risk associated with the current operational mode of the Facility, uranium closure, clean up, and transition activities required for permanent closure, are within Risk Acceptance Guidelines. The Facility is classified as a Moderate Hazard Facility because of the potential for an unmitigated fire associated with the uranium storage buildings.

Brehm, J.R.; Deobald, T.L.; Benecke, M.W.; Remaize, J.A.

1995-05-23T23:59:59.000Z

432

Indefinite kernel fuzzy c-means clustering algorithms  

Science Conference Proceedings (OSTI)

This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. ... Keywords: indefinite kernel, kernel fuzzy c-means, non-euclidean fuzzy relational clustering, non-euclidean relational fuzzy c-means

Yuchi Kanzawa; Yasunori Endo; Sadaaki Miyamoto

2010-10-01T23:59:59.000Z

433

Quantum amplitude amplification algorithm: an explanation of availability bias  

E-Print Network (OSTI)

In this article, I show that a recent family of quantum algorithms, based on the quantum amplitude amplification algorithm, can be used to describe a cognitive heuristic called availability bias. The amplitude amplification algorithm is used to define quantitatively the ease of a memory task, while the quantum amplitude estimation and the quantum counting algorithms to describe cognitive tasks such as estimating probability or approximate counting.

Riccardo Franco

2008-10-06T23:59:59.000Z

434

The FIPS 186-4 Digital Signature Algorithm Validation System ...  

Science Conference Proceedings (OSTI)

... pass for formal validation, and general instruction for interfacing ... 5 Design Philosophy of the Digital Signature Algorithm Validation System ...

2013-09-17T23:59:59.000Z

435

Mehrotra-Type Predictor-Corrector Algorithms Revisited  

E-Print Network (OSTI)

Feb 5, 2007 ... Mehrotra-Type Algorithm, Polynomial Complexity. ?Corresponding author, Department of Mathematics, Faculty of Sciences, The University of ...

436

Contributors to the Dictionary of Algorithms and Data ...  

Science Conference Proceedings (OSTI)

Contributors to the Dictionary of Algorithms, Data Structures, and Classical Computer Science problems, with some contact information. NIST. ...

2013-11-08T23:59:59.000Z

437

Local Algorithms for Finding Interesting Individuals in Large Networks  

E-Print Network (OSTI)

that are distant from all those currently known. The Crawl operation permits an algorithm to explore the neighbors

Plotkin, Joshua B.

438

Quantization effects and stabilization of the fast-Kalman algorithm  

Science Conference Proceedings (OSTI)

The exact and actual cause of the failure of the fast-Kalman algorithm due to the generation and propagation of finite-precision or quantization error is presented. It is demonstrated that out of all the formulas that constitute this fast Recursive Least ... Keywords: Kalman filtering, adaptive algorithms, finite-precision error in RLS algorithms, quantization error in fast-Kalman algorithm, recursive least squares filtering

Constantin Papaodysseus; Constantin Alexiou; George Roussopoulos; Athanasios Panagopoulos

2001-01-01T23:59:59.000Z

439

On Exact Algorithms for Permutation CSP  

E-Print Network (OSTI)

In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $\\pi\\ : V \\rightarrow [1,...,|V|]$, which satisfies as many constraints as possible. A constraint $(v_1,v_2,...,v_k)$ is satisfied by an ordering $\\pi$ when $\\pi(v_1)CSP} for arity 2 or 3 can be solved by Held-Karp type algorithms in time $O^*(2^n)$, but no algorithm is known for arity at least 4 with running time significantly better than $2^{O(n\\log{n})}$. In this paper we resolve the gap by showing that {\\sc Arity 4 Permutati...

Kim, Eun Jung

2012-01-01T23:59:59.000Z

440

Architectural Implications for Spatial Object Association Algorithms  

Science Conference Proceedings (OSTI)

Spatial object association, also referred to as cross-match of spatial datasets, is the problem of identifying and comparing objects in two or more datasets based on their positions in a common spatial coordinate system. In this work, we evaluate two crossmatch algorithms that are used for astronomical sky surveys, on the following database system architecture configurations: (1) Netezza Performance Server R, a parallel database system with active disk style processing capabilities, (2) MySQL Cluster, a high-throughput network database system, and (3) a hybrid configuration consisting of a collection of independent database system instances with data replication support. Our evaluation provides insights about how architectural characteristics of these systems affect the performance of the spatial crossmatch algorithms. We conducted our study using real use-case scenarios borrowed from a large-scale astronomy application known as the Large Synoptic Survey Telescope (LSST).

Kumar, V S; Kurc, T; Saltz, J; Abdulla, G; Kohn, S R; Matarazzo, C

2009-01-29T23:59:59.000Z

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


441

A Genetic Algorithm for Best Subset . . .  

E-Print Network (OSTI)

Given a data set consisting of a large number of predictors plus a response, the problem addressed in this work is to select a minimal model which correctly predicts the response. Methods for achieving this subsetting of the predictors have been the topic of a considerable amount of study within the statistics community. Unfortunately, current methods often fail when the predictors are highly correlated. Furthermore, because of the exponential growth of the number of possible subsets as the number of candidate predictors increase, current methods have great difficulty handling high dimensional data sets. This paper details a method for variable selection using genetic algorithms. A genetic algorithm is described which uses a unique two criteria population management scheme. This method is explorative in nature, and allows for an approximation of the all possible subsets method over a set of interesting model sizes. Results of an application of this method to data are discussed. 1. INTR...

Bradley C. Wallet

1996-01-01T23:59:59.000Z

442

6.854J / 18.415J Advanced Algorithms, Fall 2001  

E-Print Network (OSTI)

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

Goemans, Michel

443

Artificial bee colony algorithm solution for optimal reactive power flow  

Science Conference Proceedings (OSTI)

Artificial bee colony (ABC) algorithm is an optimization algorithm based on the intelligent foraging behavior of honeybee swarm. Optimal reactive power flow (ORPF) based on ABC algorithm to minimize active power loss in power systems is studied in this ... Keywords: Artificial bee colony, Optimal reactive power flow, Penalty function, Power system

Kür?at Ayan; Ula? K?l?ç

2012-05-01T23:59:59.000Z

444

Multi-objective immune algorithm with Baldwinian learning  

Science Conference Proceedings (OSTI)

By replacing the selection component, a well researched evolutionary algorithm for scalar optimization problems (SOPs) can be directly used to solve multi-objective optimization problems (MOPs). Therefore, in most of existing multi-objective evolutionary ... Keywords: Baldwinian learning, Immune optimization algorithm, Memetic algorithm, Multi-objective optimization problems

Yutao Qi; Fang Liu; Meiyun Liu; Maoguo Gong; Licheng Jiao

2012-08-01T23:59:59.000Z

445

Hybrid solution algorithms for task scheduling problem with moving executors  

Science Conference Proceedings (OSTI)

Heuristic algorithms for solving the task scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated. Three hybrid solution algorithms are introduced. ... Keywords: Artificial intelligence, Flexible manufacturing systems, Scheduling algorithms

Jerzy Józefczyk

2006-03-01T23:59:59.000Z

446

Studying (non-planar) road networks through an algorithmic lens  

Science Conference Proceedings (OSTI)

This paper studies real-world road networks from an algorithmic perspective, focusing on empirical studies that yield useful properties of road networks that can be exploited in the design of fast algorithms that deal with geographic data. Unlike previous ... Keywords: Voronoi diagrams, algorithmic lens, circle arrangements, disk neighborhood systems, multiscale-dispersed graphs, road networks, shortest paths

David Eppstein; Michael T. Goodrich

2008-11-01T23:59:59.000Z

447

Orientation domains: A mobile grid clustering algorithm with spherical corrections  

Science Conference Proceedings (OSTI)

An algorithm has been designed and tested which was devised as a tool assisting the analysis of geological structures solely from orientation data. More specifically, the algorithm was intended for the analysis of geological structures that can be approached ... Keywords: Bedding orientation, Shifting grid, Size-oriented clustering algorithm, Square error criterion, Structural analysis

Joana Mencos; Oscar GratacóS; Mercè Farré; Joan Escalante; Pau ArbuéS; Josep Anton MuñOz

2012-12-01T23:59:59.000Z

448

Backoff algorithms performance in burst-like traffic  

Science Conference Proceedings (OSTI)

In the present paper several backoff algorithms are considered to analysis their behavior in burst-like traffic of smart metering network: YITRAN, Binary Exponential and Polynomial backoff algorithms. The comparison was performed by means of transmission ... Keywords: Markov chains, backoff algorithms, smart grid

Ievgenii Tsokalo; Yamnenko Yulia; Stanislav Mudriievskyi

2011-09-01T23:59:59.000Z

449

A hybrid real-parameter genetic algorithm for function optimization  

Science Conference Proceedings (OSTI)

One drawback of genetic algorithm is that it may spend much computation time in the encoding and decoding processes. Also, since genetic algorithm lacks hill-climbing capacity, it may easily fall in a trap and find a local minimum not the true solution. ... Keywords: Adaptive mechanism, Design optimization, Function optimization, Genetic algorithm, Simulated annealing

Shun-Fa Hwang; Rong-Song He

2006-01-01T23:59:59.000Z

450

Self-adaptive harmony search algorithm for optimization  

Science Conference Proceedings (OSTI)

Recently, a new meta-heuristic optimization algorithm - harmony search (HS) with continuous design variables was developed. This algorithm is conceptualized using the musical improvisation process of searching for a perfect state of harmony. Although ... Keywords: Harmony search, Low-discrepancy sequence, Meta-heuristic algorithm, Optimization

Chia-Ming Wang; Yin-Fu Huang

2010-04-01T23:59:59.000Z

451

Robot algorithms for localization of multiple emission sources  

Science Conference Proceedings (OSTI)

The problem of time-varying, multisource localization using robotic swarms has received relatively little attention when compared to single-source localization. It involves distinct challenges regarding how to partition the robots during search to ensure ... Keywords: Bayesian filters, Bayesian occupancy mapping, Source localization, biologically inspired algorithms, hill-climbing algorithms, mobile robotic networks, swarm algorithms

Kathleen Mcgill; Stephen Taylor

2011-04-01T23:59:59.000Z

452

Algorithms for the generalized weighted frequency assignment problem  

Science Conference Proceedings (OSTI)

We report the performance of 15 construction heuristics to find initial solutions, and 4 search algorithms to solve a frequency assignment problem where the value of an assigned frequency is determined by the site where it is assigned. The algorithms ... Keywords: Cross entropy, Frequency assignment, Genetic algorithm, Heuristics, Simulated annealing, Tabu search

David F. MuñOz; Diego F. MuñOz

2012-12-01T23:59:59.000Z

453

THE QUASIPERIODIC AUTOMATED TRANSIT SEARCH ALGORITHM  

Science Conference Proceedings (OSTI)

We present a new algorithm for detecting transiting extrasolar planets in time-series photometry. The Quasiperiodic Automated Transit Search (QATS) algorithm relaxes the usual assumption of strictly periodic transits by permitting a variable, but bounded, interval between successive transits. We show that this method is capable of detecting transiting planets with significant transit timing variations without any loss of significance-{sup s}mearing{sup -}as would be incurred with traditional algorithms; however, this is at the cost of a slightly increased stochastic background. The approximate times of transit are standard products of the QATS search. Despite the increased flexibility, we show that QATS has a run-time complexity that is comparable to traditional search codes and is comparably easy to implement. QATS is applicable to data having a nearly uninterrupted, uniform cadence and is therefore well suited to the modern class of space-based transit searches (e.g., Kepler, CoRoT). Applications of QATS include transiting planets in dynamically active multi-planet systems and transiting planets in stellar binary systems.

Carter, Joshua A. [Harvard-Smithsonian Center for Astrophysics, 60 Garden St., Cambridge, MA 02138 (United States); Agol, Eric [Department of Astronomy, Box 351580, University of Washington, Seattle, WA 98195 (United States)

2013-03-10T23:59:59.000Z

454

Efficient scalable algorithms for hierarchically semiseparable matrices  

SciTech Connect

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

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

2011-09-14T23:59:59.000Z

455

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at Hanford. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with 10 CFR 835, DOELAP, DOE-RL, ORP, PNSO, and Hanford contractor requirements. The dosimetry system is operated by PNNL’s Hanford External Dosimetry Program which provides dosimetry services to all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. Rev. 0 marks the first revision to be released through PNNL’s Electronic Records & Information Capture Architecture (ERICA) database.

Rathbone, Bruce A.

2005-02-25T23:59:59.000Z

456

Cold Vacuum Drying facility design basis accident analysis documentation  

SciTech Connect

This document provides the detailed accident analysis to support HNF-3553, Annex B, Spent Nuclear Fuel Project Final Safety Analysis Report (FSAR), ''Cold Vacuum Drying Facility Final Safety Analysis Report.'' All assumptions, parameters, and models used to provide the analysis of the design basis accidents are documented to support the conclusions in the FSAR. The calculations in this document address the design basis accidents (DBAs) selected for analysis in HNF-3553, ''Spent Nuclear Fuel Project Final Safety Analysis Report'', Annex B, ''Cold Vacuum Drying Facility Final Safety Analysis Report.'' The objective is to determine the quantity of radioactive particulate available for release at any point during processing at the Cold Vacuum Drying Facility (CVDF) and to use that quantity to determine the amount of radioactive material released during the DBAs. The radioactive material released is used to determine dose consequences to receptors at four locations, and the dose consequences are compared with the appropriate evaluation guidelines and release limits to ascertain the need for preventive and mitigative controls.

CROWE, R.D.

2000-08-08T23:59:59.000Z

457

A New Basis of Geoscience: Whole-Earth Decompression Dynamics  

E-Print Network (OSTI)

Neither plate tectonics nor Earth expansion theory is sufficient to provide a basis for understanding geoscience. Each theory is incomplete and possesses problematic elements, but both have served as stepping stones to a more fundamental and inclusive geoscience theory that I call Whole-Earth Decompression Dynamics (WEDD). WEDD begins with and is the consequence of our planet's early formation as a Jupiter-like gas giant and permits deduction of:(1) Earth's internal composition, structure, and highly-reduced oxidation state; (2) Core formation without whole-planet melting; (3) Powerful new internal energy sources - proto-planetary energy of compression and georeactor nuclear fission energy; (4) Georeactor geomagnetic field generation; (5) Mechanism for heat emplacement at the base of the crust resulting in the crustal geothermal gradient; (6) Decompression driven geodynamics that accounts for the myriad of observations attributed to plate tectonics without requiring physically-impossible mantle convection, and; (7) A mechanism for fold-mountain formation that does not necessarily require plate collision. The latter obviates the necessity to assume supercontinent cycles. Here, I review the principles of Whole-Earth Decompression Dynamics and describe a new underlying basis for geoscience and geology.

J. Marvin Herndon

2013-07-04T23:59:59.000Z

458

Sampling Within k-Means Algorithm to Cluster Large Datasets  

Science Conference Proceedings (OSTI)

Due to current data collection technology, our ability to gather data has surpassed our ability to analyze it. In particular, k-means, one of the simplest and fastest clustering algorithms, is ill-equipped to handle extremely large datasets on even the most powerful machines. Our new algorithm uses a sample from a dataset to decrease runtime by reducing the amount of data analyzed. We perform a simulation study to compare our sampling based k-means to the standard k-means algorithm by analyzing both the speed and accuracy of the two methods. Results show that our algorithm is significantly more efficient than the existing algorithm with comparable accuracy. Further work on this project might include a more comprehensive study both on more varied test datasets as well as on real weather datasets. This is especially important considering that this preliminary study was performed on rather tame datasets. Also, these datasets should analyze the performance of the algorithm on varied values of k. Lastly, this paper showed that the algorithm was accurate for relatively low sample sizes. We would like to analyze this further to see how accurate the algorithm is for even lower sample sizes. We could find the lowest sample sizes, by manipulating width and confidence level, for which the algorithm would be acceptably accurate. In order for our algorithm to be a success, it needs to meet two benchmarks: match the accuracy of the standard k-means algorithm and significantly reduce runtime. Both goals are accomplished for all six datasets analyzed. However, on datasets of three and four dimension, as the data becomes more difficult to cluster, both algorithms fail to obtain the correct classifications on some trials. Nevertheless, our algorithm consistently matches the performance of the standard algorithm while becoming remarkably more efficient with time. Therefore, we conclude that analysts can use our algorithm, expecting accurate results in considerably less time.

Bejarano, Jeremy [Brigham Young University; Bose, Koushiki [Brown University; Brannan, Tyler [North Carolina State University; Thomas, Anita [Illinois Institute of Technology; Adragni, Kofi [University of Maryland; Neerchal, Nagaraj [University of Maryland; Ostrouchov, George [ORNL

2011-08-01T23:59:59.000Z

459

Calculation of particulate dispersion in a design-basis tornadic storm from the Battelle Memorial Institute, Columbus, Ohio  

SciTech Connect

A three-dimensional numerical model is used to calculate ground-level air concentration and deposition (due to precipitation scavenging) after a hypothetical tornado strike at the Battelle Memorial Institute at Columbus, Ohio. Plutonium particles less than 20 ..mu..m in diameter are assumed to be lifted into the tornadic storm cell by the vortex. The rotational characteristics of the tornadic storm are embedded within the larger mesoscale flow of the storm system. The design-basis translational wind value is based on probabilities associated with existing records of tornado strikes in the vicinity of the plant site. Turbulence exchange coefficients are based on empirical values deduced from experimental data in severe storms and from theoretical assumptions obtained from the literature. The method of moments is used to incorporate subgrid-scale resolution of the concentration within a grid cell volume.

Pepper, D.W.

1980-10-01T23:59:59.000Z

460

Adaptive optimal control: an algorithm for direct digital control  

SciTech Connect

An algorithm for applying advanced control concepts in heating, ventilating, and air conditioning (HVAC) systems has been developed at the Los Alamos Scientific Laboratory (LASL). The algorithm uses optimal control and is adaptive in nature. Simulations for a solar heated and cooled building indicate that use of this algorithm can accomplish a substantial savings in auxiliary energy consumption. In this paper, the algorithm is described and its application is illustrated with a simple example. Simulation results for a more complex system are also presented. The hardware, including the digital computer, needed to implement this algorithm is briefly discussed.

Farris, D.R.; McDonald, T.E.

1980-01-01T23:59:59.000Z

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


461

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

SciTech Connect

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

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

2011-02-24T23:59:59.000Z

462

Guidance For Preparatioon of Basis For Interim Operation (BIO) Documents  

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

3011-2002 3011-2002 December 2002 Superceding DOE-STD-3011-94 November 1994 DOE STANDARD GUIDANCE FOR PREPARATION OF BASIS FOR INTERIM OPERATION (BIO) DOCUMENTS U.S. Department of Energy AREA SAFT Washington, D.C. 20585 DISTRIBUTION STATEMENT A. Approved for public release; distribution is unlimited. NOT MEASUREMENT SENSITIVE DOE-STD-3011-2002 ii This document has been reproduced directly from the best available copy. Available to DOE and DOE contractors from ES&H Technical Information Services, U.S. Department of Energy, (800) 473-4375, fax: (301) 903-9823. Available to the public from the U.S. Department of Commerce, Technology Administration, National Technical Information Service, Springfield, VA 22161;

463

Online Monitoring Technical Basis and Analysis Framework for Large Power  

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

for Large for Large Power Transformers; Interim Report for FY 2012 Online Monitoring Technical Basis and Analysis Framework for Large Power Transformers; Interim Report for FY 2012 The Light Water Reactor Sustainability Program is a research, development, and deployment program sponsored by the U.S. Department of Energy Office of Nuclear Energy. The program is operated in collaboration with the Electric Power Research Institute's (EPRI's) research and development efforts in the Long-Term Operations (LTO) Program. The LTO Program is managed as a separate technical program operating in the Plant Technology Department of the EPRI Nuclear Power Sector with the guidance of an industry advisory Integration Committee. Because both the Department of Energy Office of Nuclear Energy and EPRI conduct research and development in technologies

464

Online Monitoring Technical Basis and Analysis Framework for Emergency  

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

for for Emergency Diesel Generators-Interim Report for FY 2013 Online Monitoring Technical Basis and Analysis Framework for Emergency Diesel Generators-Interim Report for FY 2013 The Light Water Reactor Sustainability Program is a research, development, and deployment program sponsored by the U.S. Department of Energy Office of Nuclear Energy. The program is operated in collaboration with the Electric Power Research Institute's (EPRI's) research and development efforts in the Long-Term Operations Program. The Long-Term Operations Program is managed as a separate technical program operating in the Plant Technology Department of the EPRI Nuclear Power Sector with the guidance of an industry advisory Integration Committee. Because both the Department of Energy Office of Nuclear Energy and EPRI conduct research and development

465

Experimental Progress Report--Modernizing the Fission Basis  

Science Conference Proceedings (OSTI)

In 2010 a proposal (Modernizing the Fission Basis) was prepared to 'resolve long standing differences between LANL and LLNL associated with the correct fission basis for analysis of nuclear test data'. Collaboration between LANL/LLNL/TUNL has been formed to implement this program by performing high precision measurements of neutron induced fission product yields as a function of incident neutron energy. This new program benefits from successful previous efforts utilizing mono-energetic neutrons undertaken by this collaboration. The first preliminary experiment in this new program was performed between July 24-31, 2011 at TUNL and had 2 main objectives: (1) demonstrating the capability to measure characteristic {gamma}-rays from specific fission products; (2) studying background effects from room scattered neutrons. In addition, a new dual fission ionization chamber has been designed and manufactured. The production design of the chamber is shown in the picture below. The first feasibility experiment to test this chamber is scheduled at the TUNL Tandem Laboratory from September 19-25, 2011. The dual fission chamber design will allow simultaneous exposure of absolute fission fragment emission rate detectors and the thick fission activation foils, positioned between the two chambers. This document formalizes the earlier experimental report demonstrating the experimental capability to make accurate (fission product yields of the 239Pu(n,f) reaction (induced by quasimonoenergetic neutrons). A second experiment (9/2011) introduced an compact double-sided fission chamber into the experimental arrangement, and so the relative number of incident neutrons striking the sample foil at each bombarding energy is limited only by statistics. (The number of incident neutrons often limits the experimental accuracy.) Fission chamber operation was so exceptional that 2 more chambers have been fabricated; thus fission foils of different isotopes may be left in place with sample changes. The scope of the measurements is both greatly expanded and the results become vetted. Experiment 2 is not reported here. A continuing experiment has been proposed for February 2012.

Macri, R A

2012-02-17T23:59:59.000Z

466

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at Hanford. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with 10 CFR 835, DOELAP, DOE-RL, ORP, PNSO, and Hanford contractor requirements. The dosimetry system is operated by PNNL’s Hanford External Dosimetry Program (HEDP) which provides dosimetry services to all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee (HPDAC) which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. The first revision to be released through PNNL’s Electronic Records & Information Capture Architecture (ERICA) database was designated Revision 0. Revision numbers that are whole numbers reflect major revisions typically involving changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document.

Rathbone, Bruce A.

2009-08-28T23:59:59.000Z

467

Network-theoretic classification of parallel computation patterns  

Science Conference Proceedings (OSTI)

Parallel computation in a high-performance computing environment can be characterized by the distributed memory access patterns of the underlying algorithm. During execution, networks of compute nodes exchange messages that indirectly exhibit these access ... Keywords: communication patterns, computational dwarves, graph theory, network theory, pattern recognition

Sean Whalen; Sophie Engle; Sean Peisert; Matt Bishop

2012-05-01T23:59:59.000Z

468

Theoretical underpinnings for maximal clique enumeration on perturbed graphs  

Science Conference Proceedings (OSTI)

The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing ... Keywords: Graph algorithms, Graph perturbation theory, Maximal clique enumeration, Uncertain and noisy data

William Hendrix; Matthew C. Schmidt; Paul Breimyer; Nagiza F. Samatova

2010-06-01T23:59:59.000Z

469

Scalability of Dynamic Storage Allocation Algorithms  

E-Print Network (OSTI)

Dynamic storage allocation has a significant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage efficiently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the ability to satisfy multiple requests concurrently. This paper examines parallel dynamic storage allocation algorithms and how performancescales with increasing numbers of processors. The highest throughputs and lowest instruction counts are achieved with multiple free list fit I. The best memory utilization is achieved using a best fit system.

Arun Iyengar

1996-01-01T23:59:59.000Z

470

A Spreadsheet Algorithm for Stagewise Solvent Extraction  

SciTech Connect

The material balance and equilibrium equations for solvent extraction processes have been combined with computer spreadsheets in a new way so that models for very complex multicomponent multistage operations can be setup and used easily. A part of the novelty is the way in which the problem is organized in the spreadsheet. In addition, to facilitate spreadsheet setup, a new calculational procedure has been developed. The resulting Spreadsheet Algorithm for Stagewise Solvent Extraction (SASSE) can be used with either IBM or Macintosh personal computers as a simple yet powerful tool for analyzing solvent extraction flowsheets.

Leonard, R.A.; Regalbuto, M.C.

1993-08-01T23:59:59.000Z

471

Theoretical Study on Catalysis by Protein Enzymes and Ribozyme  

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

Theoretical Study on Theoretical Study on Catalysis by Protein Enzymes and Ribozyme Theoretical Study on Catalysis by Protein Enzymes and Ribozyme 2000 NERSC Annual Report 17shkarplus.jpg The energetics were determined for three mechanisms proposed for TIM catalyzed reactions. Results from reaction path calculations suggest that the two mechanisms that involve an enediol intermediate are likely to occur, while the direct intra-substrate proton transfer mechanism (in green) is energetically unfavorable due to the presence of His95 in the active site. Principal Investigator: Martin Karplus, Harvard University Research Objectives The goal of this project is to develop a greater understanding of the mechanisms involved in enzyme catalysis and related protein functions. We are studying two types of enzymes: proteins and a nucleic acid (hammerhead

472

Experimental and theoretical investigation of high gradient acceleration  

Science Conference Proceedings (OSTI)

This report contains a technical progress summary of the research conducted under the auspices of DOE Grant No. DE-FG0291ER-40648. Experimental and Theoretical Investigations of High Gradient Acceleration.'' This grant supports three research tasks: Task A consists of the design and fabrication of a 17GHz of photocathode gun, Task B supports the testing of high gradient acceleration using a 33GHz structure, and Task C comprises theoretical investigations, both in support of the experimental tasks and on critical physics issues for the development of high energy linear colliders. This report is organized as follows. The development of an rf gun design and research progress on the picosecond laser system is summarized in Sec. 2, the status of the studies of the LBL/Haimson high gradient structure, using a 50 MW free-electron laser is summarized in Sec. 3, and theoretical research progress is described in Sec. 4. Supporting material is contained in Appendices A-G.

Bekefi, G.; Chen, C.; Chen, S.; Danly, B.; Temkin, R.J.; Wurtele, J.S.

1992-02-01T23:59:59.000Z

473

Information-theoretic-based spreading measures of orthogonal polynomials  

E-Print Network (OSTI)

The macroscopic properties of a quantum system strongly depend on the spreading of the physical eigenfunctions (wavefunctions) of its Hamiltonian operador over its confined domain. The wavefunctions are often controlled by classical or hypergeometric-type orthogonal polynomials (Hermite, Laguerre and Jacobi). Here we discuss the spreading of these polynomials over its orthogonality interval by means of various information-theoretic quantities which grasp some facets of the polynomial distribution not yet analyzed. We consider the information-theoretic lengths closely related to the Fisher information and R\\'enyi and Shannon entropies, which quantify the polynomial spreading far beyond the celebrated standard deviation.

Jesus S. Dehesa; A. Guerrero; Pablo Sánchez-Moreno

2013-05-16T23:59:59.000Z

474

The Bayesian pursuit algorithm: a new family of estimator learning automata  

Science Conference Proceedings (OSTI)

The fastest Learning Automata (LA) algorithms currently available come from the family of estimator algorithms. The Pursuit algorithm (PST), a pioneering scheme in the estimator family, obtains its superior learning speed by using Maximum Likelihood ... Keywords: Bayesian learning automata, Bayesian pursuit algorithm, beta distribution, estimator algorithms, learning automata, pursuit algorithm

Xuan Zhang; Ole-Christoffer Granmo; B. John Oommen

2011-06-01T23:59:59.000Z

475

Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix  

E-Print Network (OSTI)

Quantum chemistry provides a target for quantum simulation of considerable scientific interest and industrial importance. The majority of algorithms to date have been based on a second-quantized representation of the electronic structure Hamiltonian - necessitating qubit requirements that scale linearly with the number of orbitals. The scaling of the number of gates for such methods, while polynomial, presents some serious experimental challenges. However, because the number of electrons is a good quantum number for the electronic structure problem it is unnecessary to store the full Fock space of the orbitals. Representation of the wave function in a basis of Slater determinants for fixed electron number suffices. However, to date techniques for the quantum simulation of the Hamiltonian represented in this basis - the CI-matrix - have been lacking. We show how to apply techniques developed for the simulation of sparse Hamiltonians to the CI-matrix. We prove a number of results exploiting the structure of the CI-matrix, arising from the Slater rules which define it, to improve the application of sparse Hamiltonian simulation techniques in this case. We show that it is possible to use the minimal number of qubits to represent the wavefunction, and that these methods can offer improved scaling in the number of gates required in the limit of fixed electron number and increasing basis set size relevant for high-accuracy calculations. We hope these results open the door to further investigation of sparse Hamiltonian simulation techniques in the context of the quantum simulation of quantum chemistry.

Borzu Toloui; Peter J. Love

2013-12-09T23:59:59.000Z

476

Dictionary Design Algorithms for Vector Map Compression  

E-Print Network (OSTI)

TThe enormous size of vector maps and limited storage available in hand-held devices... The cluster centroids obtained becomes our dictionary. Based on this dictionary, we encode the vector dataset that we obtained earlier. Since each vector would now be assigned to a particular cluster, that vector would now be represented in terms of a reference to that cluster's centroid entry in the dictionary. We formally show that this proposed dictionary construction approach often yields a lower error of approximation than the error from conventional fixed dictionary techniques. Experimental results with a road map representing the major US Highways confirm the superiority of the proposed method in yielding lower errors of approximations for a fixed size dictionary [1]. In our future work we would like to experiment on different differential vector schemes. The general purpose clustering algorithm aims at minimizing the total square error. When a user tolerant accuracy level for each road segment is specified, the clustering algorithm needs to be modified to meet this requirement.

Shashi Shekhar; Yan Huang; Judy Djugash

2002-01-01T23:59:59.000Z

477

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at the U.S. Department of Energy (DOE) Hanford site. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with requirements of 10 CFR 835, the DOE Laboratory Accreditation Program, the DOE Richland Operations Office, DOE Office of River Protection, DOE Pacific Northwest Office of Science, and Hanford’s DOE contractors. The dosimetry system is operated by the Pacific Northwest National Laboratory (PNNL) Hanford External Dosimetry Program which provides dosimetry services to PNNL and all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since its inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. The first revision to be released through PNNL’s Electronic Records & Information Capture Architecture database was designated Revision 0. Revision numbers that are whole numbers reflect major revisions typically involving significant changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document. Maintenance and distribution of controlled hard copies of the manual by PNNL was discontinued beginning with Revision 0.2.

Rathbone, Bruce A.

2010-04-01T23:59:59.000Z

478

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at the U.S. Department of Energy (DOE) Hanford site. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with requirements of 10 CFR 835, the DOE Laboratory Accreditation Program, the DOE Richland Operations Office, DOE Office of River Protection, DOE Pacific Northwest Office of Science, and Hanford’s DOE contractors. The dosimetry system is operated by the Pacific Northwest National Laboratory (PNNL) Hanford External Dosimetry Program which provides dosimetry services to PNNL and all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since its inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. The first revision to be released through PNNL’s Electronic Records & Information Capture Architecture database was designated Revision 0. Revision numbers that are whole numbers reflect major revisions typically involving significant changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document. Maintenance and distribution of controlled hard copies of the manual by PNNL was discontinued beginning with Revision 0.2.

Rathbone, Bruce A.

2011-04-04T23:59:59.000Z

479

Hanford External Dosimetry Technical Basis Manual PNL-MA-842  

SciTech Connect

The Hanford External Dosimetry Technical Basis Manual PNL-MA-842 documents the design and implementation of the external dosimetry system used at Hanford. The manual describes the dosimeter design, processing protocols, dose calculation methodology, radiation fields encountered, dosimeter response characteristics, limitations of dosimeter design under field conditions, and makes recommendations for effective use of the dosimeters in the field. The manual describes the technical basis for the dosimetry system in a manner intended to help ensure defensibility of the dose of record at Hanford and to demonstrate compliance with 10 CFR 835, DOELAP, DOE-RL, ORP, PNSO, and Hanford contractor requirements. The dosimetry system is operated by PNNL’s Hanford External Dosimetry Program (HEDP) which provides dosimetry services to all Hanford contractors. The primary users of this manual are DOE and DOE contractors at Hanford using the dosimetry services of PNNL. Development and maintenance of this manual is funded directly by DOE and DOE contractors. Its contents have been reviewed and approved by DOE and DOE contractors at Hanford through the Hanford Personnel Dosimetry Advisory Committee (HPDAC) which is chartered and chaired by DOE-RL and serves as means of coordinating dosimetry practices across contractors at Hanford. This manual was established in 1996. Since inception, it has been revised many times and maintained by PNNL as a controlled document with controlled distribution. Rev. 0 marks the first revision to be released through PNNL’s Electronic Records & Information Capture Architecture (ERICA) database. Revision numbers that are whole numbers reflect major revisions typically involving changes to all chapters in the document. Revision numbers that include a decimal fraction reflect minor revisions, usually restricted to selected chapters or selected pages in the document. Revision Log: Rev. 0 (2/25/2005) Major revision and expansion. Rev. 0.1 (3/12/2007) Minor revision. Updated Chapters 5, 6 and 9 to reflect change in default ring calibration factor used in HEDP dose calculation software. Factor changed from 1.5 to 2.0 beginning January 1, 2007. Pages on which changes were made are as follows: 5.23, 5.69, 5.78, 5.80, 5.82, 6.3, 6.5, 6.29, 9.2.

Rathbone, Bruce A.

2007-03-12T23:59:59.000Z

480

Experimental Progress Report--Modernizing the Fission Basis  

SciTech Connect

In 2010 a proposal (Modernizing the Fission Basis) was prepared to 'resolve long standing differences between LANL and LLNL associated with the correct fission basis for analysis of nuclear test data'. Collaboration between LANL/LLNL/TUNL has been formed to implement this program by performing high precision measurements of neutron induced fission product yields as a function of incident neutron energy. This new program benefits from successful previous efforts utilizing mono-energetic neutrons undertaken by this collaboration. The first preliminary experiment in this new program was performed between July 24-31, 2011 at TUNL and had 2 main objectives: (1) demonstrating the capability to measure characteristic {gamma}-rays from specific fission products; (2) studying background effects from room scattered neutrons. In addition, a new dual fission ionization chamber has been designed and manufactured. The production design of the chamber is shown in the picture below. The first feasibility experiment to test this chamber is scheduled at the TUNL Tandem Laboratory from September 19-25, 2011. The dual fission chamber design will allow simultaneous exposure of absolute fission fragment emission rate detectors and the thick fission activation foils, positioned between the two chambers. This document formalizes the earlier experimental report demonstrating the experimental capability to make accurate (< 2 %) precision gamma-ray spectroscopic measurements of the excitation function of high fission product yields of the 239Pu(n,f) reaction (induced by quasimonoenergetic neutrons). A second experiment (9/2011) introduced an compact double-sided fission chamber into the experimental arrangement, and so the relative number of incident neutrons striking the sample foil at each bombarding energy is limited only by statistics. (The number of incident neutrons often limits the experimental accuracy.) Fission chamber operation was so exceptional that 2 more chambers have been fabricated; thus fission foils of different isotopes may be left in place with sample changes. The scope of the measurements is both greatly expanded and the results become vetted. Experiment 2 is not reported here. A continuing experiment has been proposed for February 2012.

Macri, R A

2012-02-17T23:59:59.000Z

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


481

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

E-Print Network (OSTI)

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

Iatsenko, Dmytro; Stefanovska, Aneta

2013-01-01T23:59:59.000Z

482

Structural basis of substrate discrimination and integrin binding by autotaxin  

SciTech Connect

Autotaxin (ATX, also known as ectonucleotide pyrophosphatase/phosphodiesterase-2, ENPP2) is a secreted lysophospholipase D that generates the lipid mediator lysophosphatidic acid (LPA), a mitogen and chemoattractant for many cell types. ATX-LPA signaling is involved in various pathologies including tumor progression and inflammation. However, the molecular basis of substrate recognition and catalysis by ATX and the mechanism by which it interacts with target cells are unclear. Here, we present the crystal structure of ATX, alone and in complex with a small-molecule inhibitor. We have identified a hydrophobic lipid-binding pocket and mapped key residues for catalysis and selection between nucleotide and phospholipid substrates. We have shown that ATX interacts with cell-surface integrins through its N-terminal somatomedin B-like domains, using an atypical mechanism. Our results define determinants of substrate discrimination by the ENPP family, suggest how ATX promotes localized LPA signaling and suggest new approaches for targeting ATX with small-molecule therapeutic agents.

Hausmann, Jens; Kamtekar, Satwik; Christodoulou, Evangelos; Day, Jacqueline E.; Wu, Tao; Fulkerson, Zachary; Albers, Harald M.H.G.; van Meeteren, Laurens A.; Houben, Anna J.S.; van Zeijl, Leonie; Jansen, Silvia; Andries, Maria; Hall, Troii; Pegg, Lyle E.; Benson, Timothy E.; Kasiem, Mobien; Harlos, Karl; Vander Kooi, Craig W.; Smyth, Susan S.; Ovaa, Huib; Bollen, Mathieu; Morris, Andrew J.; Moolenaar, Wouter H.; Perrakis, Anastassis (Pfizer); (Leuven); (Oxford); (NCI-Netherlands); (Kentucky)

2013-09-25T23:59:59.000Z

483

Hanford Technical Basis for Multiple Dosimetry Effective Dose Methodology  

SciTech Connect

The current method at Hanford for dealing with the results from multiple dosimeters worn during non-uniform irradiation is to use a compartmentalization method to calculate the effective dose (E). The method, as documented in the current version of Section 6.9.3 in the 'Hanford External Dosimetry Technical Basis Manual, PNL-MA-842,' is based on the compartmentalization method presented in the 1997 ANSI/HPS N13.41 standard, 'Criteria for Performing Multiple Dosimetry.' With the adoption of the ICRP 60 methodology in the 2007 revision to 10 CFR 835 came changes that have a direct affect on the compartmentalization method described in the 1997 ANSI/HPS N13.41 standard, and, thus, to the method used at Hanford. The ANSI/HPS N13.41 standard committee is in the process of updating the standard, but the changes to the standard have not yet been approved. And, the drafts of the revision of the standard tend to align more with ICRP 60 than with the changes specified in the 2007 revision to 10 CFR 835. Therefore, a revised method for calculating effective dose from non-uniform external irradiation using a compartmental method was developed using the tissue weighting factors and remainder organs specified in 10 CFR 835 (2007).

Hill, Robin L.; Rathbone, Bruce A.

2010-08-01T23:59:59.000Z

484

Information-Theoretic Analysis of an Energy Harvesting Communication System  

E-Print Network (OSTI)

Information-Theoretic Analysis of an Energy Harvesting Communication System Omur Ozel Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 omur@umd.edu ulukus@umd.edu Abstract--In energy harvesting communication systems, an exogenous recharge process

Ulukus, Sennur

485

A theoretical framework to characterize multichannel interaction in electronic commerce  

Science Conference Proceedings (OSTI)

This paper presents an initial study of multichannel interactions within the framework of the E-Marketing. A analysis and prediction theoretical framework, based on the one hand on concepts resulting from psycholinguistics, and the other hand on information ... Keywords: E-marketing, interaction, media richness theory, multichannel, psycholinguistics

Vincent Chevrin; Alain Derycke; José Rouillard

2003-11-01T23:59:59.000Z

486

Theoretical Minimum Energy Use of a Building HVAC System  

E-Print Network (OSTI)

This paper investigates the theoretical minimum energy use required by the HVAC system in a particular code compliant office building. This limit might be viewed as the "Carnot Efficiency" for HVAC system. It assumes that all ventilation and air conditioning in the building are provided using the minimum energy value that does not violate physical law.

Tanskyi, O.

2011-01-01T23:59:59.000Z

487

An automata-theoretic approach to constraint LTL  

Science Conference Proceedings (OSTI)

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show PSPACE decidability of the logic for the constraint systems (Z, Keywords: Logics of space and time, Model-checking, Temporal logic

Stéphane Demri; Deepak D'Souza

2007-03-01T23:59:59.000Z

488

More on graph theoretic software watermarks: Implementation, analysis, and attacks  

Science Conference Proceedings (OSTI)

This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper [R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, ... Keywords: Software piracy protection, Software protection, Software watermarking, Surreptitious software

Christian Collberg; Andrew Huntwork; Edward Carter; Gregg Townsend; Michael Stepp

2009-01-01T23:59:59.000Z

489

Book review Thermal adaptation: A theoretical and empirical synthesis,  

E-Print Network (OSTI)

Book review Thermal adaptation: A theoretical and empirical synthesis, Michael J. Angilletta Jr of its predecessors, this new book by Michael Anguiletti provides the same litany of chapter topics from of anthropogenic cli- mate change. But what makes this particular book different is its focus on analyzing

Angilletta, Michael

490

Works of the Kiev school of theoretical cryptography  

Science Conference Proceedings (OSTI)

This paper presents works of the Kiev school of theoretical cryptography that are carried out mainly during the last two decades in the fields of cryptographic methods of information security, cryptanalysis, and related mathematical disciplines. Keywords: asymptotic analysis, cryptanalysis, cryptography, estimate of complexity of cryptalgorithms, probabilistic combinatorics, probability on algebraic structures, random placement, statistical criterion

M. N. Savchuk

2010-05-01T23:59:59.000Z

491

Theoretical and linguistic aspects of the fuzzy logic controller  

Science Conference Proceedings (OSTI)

Successful applications of the fuzzy logic controller by various researchers to a variety of ill-defined processes motivated this theoretical study of the fuzzy logic controller. Initially the controller is analysed by traditional (nonlinear) algebraic ... Keywords: Computer control, fuzzy logic controllers, gas turbines, linguistic models, modelling, nonlinear systems, stability

M. Braae; D. A. Rutherford

1979-09-01T23:59:59.000Z

492

Hadronic decays of the tau lepton: Theoretical outlook  

E-Print Network (OSTI)

The structure of the form factors stemmed from the hadronization of QCD currents in the energy region of the resonances can be explored through the analyses of exclusive hadronic decays of the tau lepton. I give a short review on the later theoretical progress achieved in the description of experimental data.

J. Portoles

2007-02-13T23:59:59.000Z

493

A Group-Theoretic Approach to Fast Matrix Multiplication  

Science Conference Proceedings (OSTI)

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group algebra \\mathbb{C}[G] ...

Henry Cohn; Christopher Umans

2003-10-01T23:59:59.000Z

494

Games Computers Play: GameTheoretic Aspects of Computing  

E-Print Network (OSTI)

Games Computers Play: Game­Theoretic Aspects of Computing Nathan Linial \\Lambda 1 Introduction Computers may interact in great many ways. A parallel computer consists of a group of processors which cooperate in order to solve large­scale computational problems. Computers compete against each other

Linial, Nathan "Nati"

495

Improving effectiveness of query expansion using information theoretic approach  

Science Conference Proceedings (OSTI)

Automatic Query expansion is a well-known method to improve the performance of information retrieval systems. In this paper we have suggested information theoretic measures to improve efficiency of co-occurrence based automatic query expansion. We have ... Keywords: automatic query expansion, candidate terms, kullback-leibler divergence, relevance feedback, term cooccurrence

Hazra Imran; Aditi Sharan

2010-06-01T23:59:59.000Z

496

Algorithms for high-throughput disk-to-disk sorting  

Science Conference Proceedings (OSTI)

In this paper, we present a new out-of-core sort algorithm, designed for problems that are too large to fit into the aggregate RAM available on modern supercomputers. We analyze the performance including the cost of IO and demonstrate the fastest (to ... Keywords: asynchronous methods, distributed-memory parallelism, hypercube, out-of-core algorithms, parallel algorithms, quicksort, samplesort, shared-memory parallelism, sorting

Hari Sundar, Dhairya Malhotra, Karl W. Schulz

2013-11-01T23:59:59.000Z

497

A digital control algorithm for diesel engine governing  

SciTech Connect

The performance of a microprocessor based precision engine speed control system was investigated. A sample rate selection criteria is presented along with a procedure to implement a high performance digital PID control algorithm. The algorithm requires a digital speed sensor of 12 to 14 bits to minimize excessive fuel rack motion at a steady state due to digital quantization effects. Computer simulation and experimental test results of the algorithm are presented for an 1800 RPM, 125 Kilowatt engine generator set.

Garvey, P.C.

1985-01-01T23:59:59.000Z

498

Business Case Slide 23: High-Value: Catalysts - Basis for Use  

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

Catalysts - Basis for Use Basis for use DUO2 has previously been used as a catalyst Dissociation of volatile organic compounds and nitrogen oxides in off-gas streams Oxidation of...

499

Business Case Slide 30: High-Value: Energy Uses - Basis for Use  

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

Energy Uses - Basis for Use DUO2 battery test cell at U. Kentucky DUO2 battery test cell at U. Kentucky Basis for use Capable of sustaining high temperatures Electronic properties...

500

Optimizing Radial Basis Functions by D.C. Programming and its use ...  

E-Print Network (OSTI)

Oct 6, 2009 ... the use of derivative-free models based on radial basis functions .... known, one can use a radial basis functions (RBF) model of the form m(x) =.