Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,459 records · Page 81

Performance of a GM tube based environmental dose rate monitor operating in the Time-To-Count mode

The events at the Fukushima Daiichi power plant in the aftermath of a natural disaster underline the importance of a large array of networked environmental monitors to cover areas around nuclear power plants. These monitors should meet a few basic criteria: have a uniform response over a wide range of gamma energies, have a uniform response over a wide range of incident angles, and have a large dynamic range. Many of these criteria are met if the probe is qualified to the international standard IEC 60532 (Radiation protection instrumentation - Installed dose rate meters, warning assemblies and monitors - X and gamma radiation of energy between 50 keV and 7 MeV), which specifically deals with energy response, angle of incidence, dynamic range, response time, and a number of environmental characteristics. EcoGamma is a dual GM tube environmental gamma radiation monitor designed specifically to meet the requirements of IEC 60532 and operate in the most extreme conditions. EcoGamma utilizes two energy compensated GM tubes operating with a Time-To-Count (TTC) collection algorithm. The TTC algorithm extends the lifetime and range of a GM tube significantly and allows the dual GM tube probe to achieve linearity over approximately 10 decades of gamma dose rate (from the Sv/hr range to 100 Sv/hr). In the TTC mode of operation, the GM tube is not maintained in a biased condition continuously. This is different from a traditional counting system where the GM tube is held at a constant bias continuously and the total number of strikes that the tube registers are counted. The traditional approach allows for good sensitivity, but does not lend itself to a long lifetime of the tube and is susceptible to linearity issues at high count rates. TTC on the other hand only biases the tube for short periods of time and in effect measures the time between events, which is statistically representative of the total strike rate. Since the tube is not continually biased, the life of the tube is extended and the linearity is greatly improved. Testing has been performed at Pacific Northwest National Laboratory (PNNL) in the USA and confirms compliance to IEC 60532 as well as linearity (± 10%) up to 100 Sv/hr. Furthermore, a network of EcoGamma probes may be linked through available supervisory software to provide a dose rate map of an area. This allows for real time monitoring of dose rates from one (or multiple) remote locations. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Imaging pyrometry for most color cameras using a triple pass filter

A simple combination of the Planck blackbody emission law, optical filters, and digital image processing is demonstrated to enable most commercial color cameras (still and video) to be used as an imaging pyrometer for flames and explosions. The hardware and data processing described take advantage of the color filter array (CFA) that is deposited on the surface of the light sensor array present in most digital color cameras. In this work, a triple-pass optical filter incorporated into the camera lens allows light in three 10-nm wide bandpass regions to reach the CFA/light sensor array. These bandpass regions are centered over the maxima in the blue, green, and red transmission regions of the CFA, minimizing the spectral overlap of these regions normally present. A computer algorithm is used to retrieve the blue, green, and red image matrices from camera memory and correct for remaining spectral overlap. A second algorithm calibrates the corrected intensities to a gray body emitter of known temperature, producing a color intensity correction factor for the camera/filter system. The Wien approximation to the Planck blackbody emission law is used to construct temperature images from the three color (blue, green, red) matrices. A short pass filter set eliminates light of wavelengths longer than 750 nm, providing reasonable accuracy (±10%) for temperatures between 1200 and 6000 K. The effectiveness of this system is demonstrated by measuring the temperature of several systems for which the temperature is known.

47 OTHER INSTRUMENTATION↗

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimization and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it also used significantly less computer memory.

60 APPLIED LIFE SCIENCES↗

Neutral Supersymmetric Higgs Boson Searches

In some Supersymmetric extensions of the Standard Model, including the Minimal Supersymmetric Standard Model (MSSM), the coupling of Higgs bosons to b-quarks is enhanced. This enhancement makes the associated production of the Higgs with b-quarks an interesting search channel for the Higgs and Supersymmetry at D0. The identification of b-quarks, both online and offline, is essential to this search effort. This thesis describes the author's involvement in the development of both types of b-tagging and in the application of these techniques to the MSSM Higgs search. Work was carried out on the Level-3 trigger b-tagging algorithms. The impact parameter (IP) b-tagger was retuned and the effects of increased instantaneous luminosity on the tagger were studied. An extension of the IP-tagger to use the z-tracking information was developed. A new b-tagger using secondary vertices was developed and commissioned. A tool was developed to allow the use of large multi-run samples for trigger studies involving b-quarks. Offline, a neural network (NN) b-tagger was trained combining the existing offline lifetime based b-tagging tools. The efficiency and fake rate of the NN b-tagger were measured in data and MC. This b-tagger was internally reviewed and certified by the Collaboration and now provides the official b-tagging for all analyses using the Run IIa dataset at D0. A search was performed for neutral MSSM Higgs bosons decaying to a b{bar b} pair and produced in association with one or more b-quarks. Limits are set on the cross-section times the branching ratio for such a process. The limits were interpreted in various MSSM scenarios. This analysis uses the NN b-tagger and was the first to use this tool. The analysis also relies on triggers using the Level-3 IP b-tagging tool described previously. A likelihood discriminant was used to improve the analysis and a neural network was developed to cross-check this technique. The result of the analysis has been submitted to PRL and is comparable to the result from CDF in the same channel which uses approximately twice the integrated luminosity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum algorithms from fluctuation theorems: Thermal-state preparation

Fluctuation theorems provide a correspondence between properties of quantum systems in thermal equilibrium and a work distribution arising in a non-equilibrium process that connects two quantum systems with Hamiltonians H 0 and H 1 = H 0 + V. Building upon these theorems, we present a quantum algorithm to prepare a purification of the thermal state of H 1 at inverse temperature β ≥ 0 starting from a purification of the thermal state of H 0 . The complexity of the quantum algorithm, given by the number of uses of certain unitaries, is $\mathcal{O}$ (e β(ΔA - w l )/2 ), where ΔA is the free-energy difference between H 1 and H 0 , and w l is a work cutoff that depends on the properties of the work distribution and the approximation error ϵ > 0. If the non-equilibrium process is trivial, this complexity is exponential i β∥V∥, where ∥V∥ is the spectral norm of V. This represents a significant improvement of prior quantum algorithms that have complexity exponential in β∥H 1 ∥ in the regime where ∥V∥$\ll$ ∥H 1 ∥. The dependence of the complexity in ϵ varies according to the structure of the quantum systems. It can be exponential in 1/ϵ in general, but we show it to be sublinear in 1/ϵ if H 0 and H 1 commute, or polynomial in 1/ϵ if H 0 and H 1 are local spin systems. The possibility of applying a unitary that drives the system out of equilibrium allows one to increase the value of w l and improve the complexity even further. To this end, we analyze the complexity for preparing the thermal state of the transverse field Ising model using different non-equilibrium unitary processes and see significant complexity improvements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling

Energy-aware scheduling in manufacturing operations with time-of-use electricity tariffs is a challenging problem. Sustainable manufacturing is gaining significant momentum: companies are not only improving their product quality, but also optimizing the production processes to improve energy consumption (i.e., minimizing energy cost) in order to manage environmental challenges which contribute to global climate change. The purpose of this paper is to study a preemptive scheduling problem on a single-machine to minimize the total completion time and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multiobjective mathematical programming model. To solve these objectives, we develop several new holistic ant colony optimization algorithms. The proposed model is solved via several methods including weighted sum method (WSM) using CPLEX, and multiobjective ant colony optimization based on a dominance ranking (ACO-DR) or based on a dominance ranking procedure and crowding distance comparison (ACO-DRC) or based on a heuristic approach to obtain an approximate Pareto-front and also provide information on when to start and resume each job for any solution on the Pareto-front. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we demonstrate how the results of the multiobjective model could be utilized in decision making using the multiobjective optimization on the basis of ratio analysis (MOORA) method. Furthermore, this proposed model and heuristics allows decision makers to operate in challenging-data enabled environments in industrial internet of things ecosystem, and assists in optimizing production planning to improve energy cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗

Calibration of elastoplastic constitutive model parameters from full-field data with automatic differentiation-based sensitivities

Here, we present a framework for calibration of parameters in elastoplastic constitutive models that is based on the use of automatic differentiation (AD). The model calibration problem is posed as a partial differential equation-constrained optimization problem where a finite element (FE) model of the coupled equilibrium equation and constitutive model evolution equations serves as the constraint. The objective function quantifies the mismatch between the displacement predicted by the FE model and full-field digital image correlation data, and the optimization problem is solved using gradient-based optimization algorithms. Forward and adjoint sensitivities are used to compute the gradient at considerably less cost than its calculation from finite difference approximations. Through the use of AD, we need only to write the constraints in terms of AD objects, where all of the derivatives required for the forward and inverse problems are obtained by appropriately seeding and evaluating these quantities. We present three numerical examples that verify the correctness of the gradient, demonstrate the AD approach's parallel computation capabilities via application to a large-scale FE model, and highlight the formulation's ease of extensibility to other classes of constitutive models.

42 ENGINEERING↗

A practical model for fluid flow in discrete-fracture porous media by using the numerical manifold method

Here in this study, a numerical manifold method (NMM) model is developed to analyze flow in porous media with discrete fractures in a non-conforming mesh. This new model is based on a two-cover-mesh system with a uniform triangular mathematical mesh and boundary/fracture-divided physical covers, where local independent cover functions are defined. The overlapping parts of the physical covers are elements where the global approximation is defined by the weighted average of the physical cover functions. The mesh is generated by a tree-cutting algorithm. A new model that does not introduce additional degrees of freedom (DOF) for fractures was developed for fluid flow in fractures. The fracture surfaces that belong to different physical covers are used to represent fracture flow in the direction of the fractures. In the direction normal to the fractures, the fracture surfaces are regarded as Dirichlet boundaries to exchange fluxes with the rock matrix. Furthermore, fractures that intersect with Dirichlet or Neumann boundaries are considered. Simulation examples are designed to verify the efficiency of the tree-cutting algorithm, the calculation's independency from the mesh orientation, and accuracy when modeling porous media that contain fractures with multiple intersections and different orientations. The simulation results show good agreement with available analytical solutions. Finally, the model is applied to cases that involve nine intersecting fractures and a complex network of 100 fractures, both of which achieve reasonable results. The new model is very practical for modeling flow in fractured porous media, even for a geometrically complex fracture network with large hydraulic conductivity contrasts between fractures and the matrix.

58 GEOSCIENCES↗

Estimating the joint distribution of rate parameters across multiple reactions in the absence of experimental data

Here, a procedure for determining the joint uncertainty of Arrhenius parameters across multiple combustion reactions of interest is demonstrated. This approach is capable of constructing the joint distribution of the Arrhenius parameters arising from the uncertain measurements performed in specific target experiments without having direct access to the underlying experimental data. The method involves constructing an ensemble of hypothetical data sets with summary statistics consistent with the available information reported by the experimentalists, followed by a fitting procedure that learns the structure of the joint parameter density across reactions using this consistent hypothetical data as evidence. The procedure is formalized in a Bayesian statistical framework, employing maximum-entropy and approximate Bayesian computation methods and utilizing efficient Markov chain Monte Carlo techniques to explore data and parameter spaces in a nested algorithm. We demonstrate the application of the method in the context of experiments designed to measure the rates of selected chain reactions in the H 2 -O 2 system and highlight the utility of this approach for revealing the critical correlations between the parameters within a single reaction and across reactions, as well as for maximizing consistency when utilizing rate parameter information in predictive combustion modeling of systems of interest.

97 MATHEMATICS AND COMPUTING↗

A stochastic downscaling approach for generating high-frequency solar irradiance scenarios

Solar power is increasingly cost viable with solar photovoltaic (PV) installations becoming commonplace. PV planning and operational studies, however, require high-frequency solar irradiance scenarios to understand potential electric grid impacts due to the variability and uncertainty of the underlying solar resource. Existing remote sensing solar data products are often available over large spatial domains, but are limited in temporal resolution. For example, the global horizontal irradiance (GHI) component contained within the National Solar Radiation Database (NSRDB) is available at time resolution of 30 min on an approximately four-kilometer grid. In contrast, substantial solar variability is present at finer time scales and this article describes an algorithm to stochastically generate one-minute GHI from widely available sub-hourly NSRDB. A generalized linear modeling (GLM) framework is proposed, which includes non-Gaussian mixtures, and extends the literature involving the synthesis of GHI data. The model is trained on a set of sample locations around Oregon, USA, and validated across the USA using both the Surface Radiation Budget Network (SURFRAD) dataset and Solar Radiation Monitoring Laboratory (SRML) network. Simulated ensembles show good coverage properties and temporal correlation structure. The resulting downscaled ensembles allow for understanding the unpredictable variability inherent in GHI at locations without direct measurements. Here, future work can leverage the algorithm as part of a stochastic optimization of electric grid operations with high-penetration PV systems.

14 SOLAR ENERGY↗

MHD flow of a micropolar fluid over a stretchable disk in a porous medium with heat and mass transfer

This article studies the simultaneous impacts of heat and mass transfer of an incompressible electrically conducting micropolar fluid generated by the stretchable disk in presence of porous medium. The thermal radiation effect is accounted via Rosseland’s approximation. The governing boundary layer equations are reduced into dimensionless form by employing the suitable similarity transformations. A finite difference base algorithm is utilized to obtain the solution expressions. The impacts of physical parameters on dimensionless axial velocity, radial velocity, micro-rotation, temperature and concentrations profiles are presented and examined carefully. Numerical computation is performed to compute shear stress, couple stress, heat and mass rate at the disk.

36 MATERIALS SCIENCE↗

Uncertainty Quantification for Data-Driven Machine Learning Models in Nuclear Engineering Applications: Where We Are and What Do We Need?

Machine learning (ML) has been leveraged to tackle a diverse range of tasks in almost all branches of nuclear engineering. Many of the successes in ML applications can be attributed to the recent performance breakthroughs in deep learning, the growing availability of computational power, data, and easy-to-use ML libraries. However, these empirical successes have often outpaced our formal understanding of the ML algorithms. An important but under-rated area is uncertainty quantification (UQ) of ML. ML-based models are subject to approximation uncertainty when they are used to make predictions, due to sources including but not limited to, data noise, data coverage, extrapolation, imperfect model architecture and the stochastic training process. The goal of this paper is to clearly explain and illustrate the importance of UQ of ML. We will elucidate the differences in the basic concepts of UQ of physics-based models and data-driven ML models. Various sources of uncertainties in physical modeling and data-driven modeling will be discussed, demonstrated, and compared. We will also present and demonstrate a few techniques to quantify the ML prediction uncertainties, including Monte Carlo dropout, deep ensemble, Bayesian neural networks, Gaussian Processes and conformal prediction. Lastly, we will discuss the need for building a verification, validation and UQ framework to establish ML credibility.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multi-Stage Stochastic Programming to Joint Economic Dispatch for Energy and Reserve With Uncertain Renewable Energy

To address the uncertain renewable energy in the day-ahead optimal dispatch of energy and reserve, a multi-stage stochastic programming model is established in this paper to minimize the expected total costs. The uncertainties over the multiple stages are characterized by a scenario tree and the optimal dispatch scheme is cast as a decision tree which guarantees the flexibility to decide the reasonable outputs of generation and the adequate reserves accounting for different realizations of renewable energy. Most importantly, to deal with the “Curse of Dimensionality” of stochastic programming, stochastic dual dynamic programming (SDDP) is employed, which decomposes the original problem into several sub-problems according to the stages. Specifically, the SDDP algorithm performs forward pass and backward pass repeatedly until the convergence criterion is satisfied. At each iteration, the original problem is approximated by creating a linear piecewise function. Besides, an improved convergence criterion is adopted to narrow the optimization gaps. The results on the IEEE 118-bus system and real-life provincial power grid show the effectiveness of the proposed model and method.

economic dispatch↗

Assessment of the dose reduction potential of a model-based iterative reconstruction algorithm using a task-based performance metrology

Purpose: Different computed tomography (CT) reconstruction techniques offer different image quality attributes of resolution and noise, challenging the ability to compare their dose reduction potential against each other. The purpose of this study was to evaluate and compare the task-based imaging performance of CT systems to enable the assessment of the dose performance of a model-based iterative reconstruction (MBIR) to that of an adaptive statistical iterative reconstruction (ASIR) and a filtered back projection (FBP) technique. Methods: The ACR CT phantom (model 464) was imaged across a wide range of mA setting on a 64-slice CT scanner (GE Discovery CT750 HD, Waukesha, WI). Based on previous work, the resolution was evaluated in terms of a task-based modulation transfer function (MTF) using a circular-edge technique and images from the contrast inserts located in the ACR phantom. Noise performance was assessed in terms of the noise-power spectrum (NPS) measured from the uniform section of the phantom. The task-based MTF and NPS were combined with a task function to yield a task-based estimate of imaging performance, the detectability index (d′). The detectability index was computed as a function of dose for two imaging tasks corresponding to the detection of a relatively small and a relatively large feature (1.5 and 25 mm, respectively). The performance of MBIR in terms of the d′ was compared with that of ASIR and FBP to assess its dose reduction potential. Results: Results indicated that MBIR exhibits a variability spatial resolution with respect to object contrast and noise while significantly reducing image noise. The NPS measurements for MBIR indicated a noise texture with a low-pass quality compared to the typical midpass noise found in FBP-based CT images. At comparable dose, the d′ for MBIR was higher than those of FBP and ASIR by at least 61% and 19% for the small feature and the large feature tasks, respectively. Compared to FBP and ASIR, MBIR indicated a 46%–84% dose reduction potential, depending on task, without compromising the modeled detection performance. Conclusions: The presented methodology based on ACR phantom measurements extends current possibilities for the assessment of CT image quality under the complex resolution and noise characteristics exhibited with statistical and iterative reconstruction algorithms. The findings further suggest that MBIR can potentially make better use of the projections data to reduce CT dose by approximately a factor of 2. Alternatively, if the dose held unchanged, it can improve image quality by different levels for different tasks.

60 APPLIED LIFE SCIENCES↗

Multilevel Training of Neural Networks

MTNN is a software library for applying multilevel algorithms on training neural networks. Based on PyTorch, it is designed to be an extensible framework to enable researchers to implement multilevel training algorithms on a variety of neural network models. This release includes a culmination of preliminary work in applying the multilevel Full Approximation Scheme technique on fully connected and convolutional neural networks to solve PDE problems (pending publication submission).

Li, Ruipeng↗

Intrusive analysis for NEK5000: development of intrusive uncertainty quantification for high-dimensional, high-fidelity codes.

We study the use of lower-fidelity training data for uncertainty quantification of complex simulation models. In our approach, computationally expensive full-model outputs are approximated applying proper orthogonal-decomposition-based dimensionality reduction to the full model. A Gaussian-processes-based machine learning approach is then used to model the difference (or, rather, the correspondence) between the higher-fidelity and the lower-fidelity data. This stochastic model can be constructed by using few additional full code evaluations; it is used to calibrate arbitrarily many lower-quality outputs in order to create additional training data for sampling-based analysis. In effect, an adequate approximation of the simulation model’s response to uncertainty can be constructed at a modest computational cost. In fact, we aim at the number of full-model evaluations comparable to that required for a linear approximation (as opposed to numbers traditionally associated with sampling in high-dimensional spaces). In this report, we explain the basic algorithm, suggest some performance tuning options, and give a first characterization for the class of simulation models of nuclear engineering for which the suggested report is effective.

Roderick, O.↗