Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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 811 records · Page 45

Atmospheric parameters and metallicities for 2191 stars in the globular cluster M4

We report new metallicities for stars of Galactic globular cluster M4 using the largest number of stars ever observed at high spectral resolution in any cluster. We analyzed 7250 spectra for 2771 cluster stars gathered with the Very Large Telescope (VLT) FLAMES+GIRAFFE spectrograph at VLT. These medium-resolution spectra cover a small wavelength range, and often have very low signal-to-noise ratios. We approached this data set by reconsidering the whole method of abundance analysis of large stellar samples from beginning to end. We developed a new algorithm that automatically determines the atmospheric parameters of a star. Nearly all of the data preparation steps for spectroscopic analyses are processed on the syntheses, not the observed spectra. For 322 red giant branch (RGB) stars with V ≤ 14.7, we obtain a nearly constant metallicity, ([Fe/H]) = –1.07 (σ = 0.02). No difference in the metallicity at the level of 0.01 dex is observed between the two RGB sequences identified by Monelli et al. For 1869 subgiant and main-sequence stars with V > 14.7, we obtain ([Fe/H]) = –1.16 (σ = 0.09) after fixing the microturbulent velocity. These values are consistent with previous studies that have performed detailed analyses of brighter RGB stars at higher spectroscopic resolution and wavelength coverage. It is not clear if the small mean metallicity difference between brighter and fainter M4 members is real or is the result of the low signal-to-noise characteristics of the fainter stars. The strength of our approach is shown by recovering a metallicity close to a single value for more than 2000 stars, using a data set that is non-optimal for atmospheric analyses. This technique is particularly suitable for noisy data taken in difficult observing conditions.

79 ASTRONOMY AND ASTROPHYSICS↗

Digital quantum computation of fermion-boson interacting systems

We introduce a method for representing the low-energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the continuous theory thanks to the Nyquist-Shannon sampling theorem. The method makes the implementation of quantum algorithms for purely bosonic systems as well as fermion-boson interacting systems feasible. We present algorithmic circuits for computing the time evolution of these systems. The complexity of the algorithms scales polynomially with the system size. The algorithm is a natural extension of the existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed-matter physics to systems involving bosons and fermion-boson interactions and has a broad variety of potential applications in particle physics, condensed matter, etc. Due to the relatively small amount of additional resources required by the inclusion of bosons in our algorithm, the simulation of electron-phonon and similar systems can be placed in the same near-future reach as the simulation of interacting electron systems. We benchmark our algorithm by implementing it for a two-site Holstein polaron problem on an Atos Quantum Learning Machine quantum simulator. The polaron quantum simulations are in excellent agreement with the results obtained by exact diagonalization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Pre-equilibrium evolution of conserved charges with initial conditions in the ICCING Monte Carlo event generator

Heavy-ion collisions can be well described through relativistic viscous hydrodynamics, but questions still remain when hydrodynamics is applicable because the initial state may begin very far from equilibrium. Thus, a pre-equilibrium evolution phase is used to bridge the gap between the initial state and hydrodynamics. KøMPøST is one such pre-equilibrium model that propagates the energy-momentum tensor by decomposing it into the background and fluctuations around that background, whose evolution is captured by Green's functions. We extend this formalism to include conserved charges and calculate the corresponding nonequilibrium Green's functions in the relaxation-time approximation. The ICCING algorithm initializes conserved charges in the initial state by sampling $g$ → $q$$\overline{q}$ splitting probabilities and is, thus, perfectly positioned to implement Green's functions for charge propagation. As a result, we show that this method alters the initial-state charge geometries and is applicable in central to mid-central collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

Measurement of the nuclear modification factor of $b$-jets in 5.02 TeV Pb+Pb collisions with the ATLAS detector

This paper presents a measurement of b-jet production in Pb+Pb and pp collisions at $\sqrt{sNN}$ = 5.02 TeV with the ATLAS detector at the LHC. The measurement uses 260 pb –1 of pp collisions collected in 2017 and 1.4 nb –1 of Pb+Pb collisions collected in 2018. In both collision systems, jets are reconstructed via the anti-$k_t$ algorithm. The b-jets are identified from a sample of jets containing muons from the semileptonic decay of b-quarks using template fits of the muon momentum relative to the jet axis. In pp collisions, b-jets are reconstructed for radius parameters R = 0.2 and R = 0.4, and only R = 0.2 jets are used in Pb+Pb collisions. For comparison, inclusive R = 0.2 jets are also measured using 1.7 nb –1 of Pb+Pb collisions collected in 2018 and the same pp collision data as the b-jet measurement. The nuclear modification factor, $R_{AA}$, is calculated for both b-jets and inclusive jets with R = 0.2 over the transverse momentum range of 80–290 GeV. The nuclear modification factor for b-jets decreases from peripheral to central collisions. The ratio of the b-jet $R_{AA}$ to inclusive jet $R_{AA}$ is also presented and suggests that the $R_{AA}$ for b-jets is larger than that for inclusive jets in central Pb+Pb collisions. The measurements are compared with theoretical calculations and suggest a role for mass and colour-charge effects in partonic energy loss in heavy-ion collisions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Using Bayesian Inference Framework towards Identifying Gas Species and Concentration from High Temperature Resistive Sensor Array Data

High temperature gas sensors have been highly demanded for combustion process optimization and toxic emissions control, which usually suffer from poor selectivity. In order to solve this selectivity issue and identify unknown reducing gas species (CO, CH 4 , and CH 8 ) and concentrations, a high temperature resistive sensor array data set was built in this study based on 5 reported sensors. As each sensor showed specific responses towards different types of reducing gas with certain concentrations, based on which calibration curves were fitted, providing benchmark sensor array response database, then Bayesian inference framework was utilized to process the sensor array data and build a sample selection program to simultaneously identify gas species and concentration, by formulating proper likelihood between input measured sensor array response pattern of an unknown gas and each sampled sensor array response pattern in benchmark database. This algorithm shows good robustness which can accurately identify gas species and predict gas concentration with a small error of less than 10% based on limited amount of experiment data. These features indicate that Bayesian probabilistic approach is a simple and efficient way to process sensor array data, which can significantly reduce the required computational overhead and training data.

Liu, Yixin↗

An Interactive Spectral Analysis Tool for Chemical Identification and Quantification of Gas-Phase Species in Complex Spectra

A spectral analysis tool has been developed to interactively identify and quantify individual gas-phase species from complex infrared absorbance spectra obtained from laboratory or field data. The SpecQuant program has an intuitive graphical interface that accommodates both reference and experimental data with varying resolution and instrumental lineshape, as well as algorithms to readily align the wavenumber axis of a sample spectrum with the raster of a reference spectrum. Using a classical least squares model in conjunction with reference spectra such as those from the Pacific Northwest National Laboratory (PNNL) gas-phase infrared database or simulated spectra derived from the HITRAN line-by-line database, the mixing ratio of each identified species is determined along with its associated estimation error. After correcting the wavelength and intensity of the field data, SpecQuant displays the calculated mixing ratio versus the experimental data for each analyte along with the residual spectrum with any or all analyte fits subtracted for visual inspection of the fit and residuals. The software performance for multianalyte quantification was demonstrated using moderate resolution (0.5 cm –1 ) infrared spectra that were collected during the time-resolved infrared photolysis of methyl iodide.

Thompson, Christopher J.↗

Ridge-Valley Graphs: Combinatorial Ridge Detection Using Jacobi Sets

Ridges are one of the key feature of interest in areas such as computer vision and image processing. Even though a significant amount of research has been directed to defining and extracting ridges some fundamental challenges remain. For example, the most popular ridge definition (height ridge) is not invariant under monotonic transformations and its global structure is typically ignored during numerical computations. Furthermore, many existing algorithm are based on numerical heuristics and are rarely guaranteed to produce consistent results. In this paper a small change to the height ridge definition gives a definition that is consistent with the desired invariants. Nevertheless, we show that this definition results in similar structures compared to the most common traditional approach and that both formulations are equivalent for quadratic functions. Furthermore, this definition can be cast in the form of a degenerate Jacobi set, which allows insights into the global structure of ridges. In particular, we introduce the Ridge-Valley graph as the complete description of all ridges in an image. Analyzing this graph reveals similar invariants to those found for traditional ridge formulations, such as the fact that ridges do not merge. Finally, using the connection to Jacobi sets we describe a new combinatorial algorithm to extract the Ridge-Valley graph from sampled images that is guaranteed to produce a valid structure.

97 MATHEMATICS AND COMPUTING↗

Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling-based theoretical analysis for a regularized t1 minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors), and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter, and empirically produces superior results. Our numerical results test our framework on several medium-to-high dimensional examples of solutions to parameterized differential equations, and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Exploring the Interplay of Resilience and Energy Consumption for a Task-Based Partial Differential Equations Preconditioner

We discuss algorithm-based resilience to silent data corruption (SDC) in a task- based domain-decomposition preconditioner for partial differential equations (PDEs). The algorithm exploits a reformulation of the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to SDC. The implementation is based on a server-client model where all state information is held by the servers, while clients are designed solely as computational units. Scalability tests run up to ~ 51 K cores show a parallel efficiency greater than 90%. We use a 2D elliptic PDE and a fault model based on random single bit-flip to demonstrate the resilience of the application to synthetically injected SDC. We discuss two fault scenarios: one based on the corruption of all data of a target task, and the other involving the corruption of a single data point. We show that for our application, given the test problem considered, a four-fold increase in the number of faults only yields a 2% change in the overhead to overcome their presence, from 7% to 9%. We then discuss potential savings in energy consumption via dynamics voltage/frequency scaling, and its interplay with fault-rates, and application overhead.

97 MATHEMATICS AND COMPUTING↗

Evaluation of the Reconstruction Accuracy of the Ultrasound Model–Based Image Reconstruction (U-MBIR) Method for Concrete to Optimize Damage Detection

Reinforced concrete is a critical structural material used to construct nuclear power plants (NPPs). As such, its safety and performance must be thoroughly examined throughout the life cycle of the NPP infrastructure system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To support the development of these techniques, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. In the work documented in this report, the U-MBIR methodology was applied to four sets of ultrasonic data collected from concrete specimens. The results demonstrate that the U-MBIR algorithm can successfully detect defects within the four concrete samples. The reconstruction images help identify the specimen thickness, regions of delamination, and location of rebar embedded within the concrete. The reconstruction images allow engineers and technicians to characterize the internal defects within concrete specimens and structural members. Ultimately, this knowledge can guide engineers in making informed decisions regarding the performance, safety, and reliability of structural materials (i.e., reinforced concrete) throughout the life cycle of NPPs.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Next Generation Virgo Cluster Survey. XXI. The Weak Lensing Masses of the CFHTLS and NGVS RedGOLD Galaxy Clusters and Calibration of the Optical Richness

We measured stacked weak lensing cluster masses for a sample of 1323 galaxy clusters detected by the RedGOLD algorithm in the Canada–France–Hawaii Telescope Legacy Survey W1 and the Next Generation Virgo Cluster Survey at 0.2<z<0.5, in the optical richness range 10<λ<70. This is the most comprehensive lensing study of a ∼100% complete and ∼80% pure optical cluster catalog in this redshift range. We test different mass models, and our final model includes a basic halo model with a Navarro Frenk and White profile, as well as correction terms that take into account cluster miscentering, non-weak shear, the two-halo term, the contribution of the Brightest Cluster Galaxy, and an a posteriori correction for the intrinsic scatter in the mass–richness relation. With this model, we obtain a mass–richness relation of logM{sub 200}/M{sub ⊙} =(14.46±0.02)+(1.04±0.09)log(λ/40) (statistical uncertainties). This result is consistent with other published lensing mass–richness relations. We give the coefficients of the scaling relations between the lensing mass and X-ray mass proxies, L {sub X} and T {sub X}, and compare them with previous results. When compared to X-ray masses and mass proxies, our results are in agreement with most previous results and simulations, and consistent with the expected deviations from self-similarity.

79 ASTRONOMY AND ASTROPHYSICS↗

Photometric Redshifts and Stellar Masses for Galaxies from the DESI Legacy Imaging Surveys

We present a catalog of photometric redshifts and stellar masses for galaxies from imaging surveys serving the Dark Energy Spectroscopic Instrument project. The imaging footprints cover an area of over 14,000 deg 2 . This catalog contains about 0.17 billion morphologically classified galaxies with r < 23 mag. It covers the redshift range of z < 1 and the mass range of $8.4\lt \mathrm{log}({M}_{* })\lt 11.9$. A total of five photometric bands are used, including three optical filters (g, r, and z) and two infrared filters ( Wide-field Infrared Survey Explorer W 1 and W 2). We use k-nearest neighbors and local linear regression algorithms to estimate photometric redshifts. Based on a spectroscopic sample of about 2.2 million galaxies, we achieve a redshift bias of $\overline{{\rm{\Delta }}{z}_{\mathrm{norm}}}$ = 2.4 × 10 -4 , accuracy of ${\sigma }_{{\rm{\Delta }}{z}_{\mathrm{norm}}}$ = 0.017, and outlier rate of about 5.1%. The stellar mass and other physical parameters are derived by stellar population synthesis model fitting based on our photometric redshifts. The differences in $\mathrm{log}({M}_{* })$ derived using spectroscopic and photometric redshifts present a 1σ dispersion of 0.09 dex.

79 ASTRONOMY AND ASTROPHYSICS↗

First Sagittarius A* Event Horizon Telescope Results. III. Imaging of the Galactic Center Supermassive Black Hole

We present the first event-horizon-scale images and spatiotemporal analysis of Sgr A* taken with the Event Horizon Telescope in 2017 April at a wavelength of 1.3 mm. Imaging of Sgr A* has been conducted through surveys over a wide range of imaging assumptions using the classical CLEAN algorithm, regularized maximum likelihood methods, and a Bayesian posterior sampling method. Different prescriptions have been used to account for scattering effects by the interstellar medium toward the Galactic center. Mitigation of the rapid intraday variability that characterizes Sgr A* has been carried out through the addition of a “variability noise budget” in the observed visibilities, facilitating the reconstruction of static full-track images. Our static reconstructions of Sgr A* can be clustered into four representative morphologies that correspond to ring images with three different azimuthal brightness distributions and a small cluster that contains diverse nonring morphologies. Based on our extensive analysis of the effects of sparse (u,v)-coverage, source variability, and interstellar scattering, as well as studies of simulated visibility data, we conclude that the Event Horizon Telescope Sgr A* data show compelling evidence for an image that is dominated by a bright ring of emission with a ring diameter of ∼50 μas, consistent with the expected “shadow” of a 4 × 10$^{6}$ M $_{⊙}$ black hole in the Galactic center located at a distance of 8 kpc.

79 ASTRONOMY AND ASTROPHYSICS↗

A Clustering-based biased Monte Carlo Approach to Protein Titration Curve Prediction

We develop and implement a novel approach to computing the ensemble averages in systems characterized by pair-wise interactions between the entities. Methods involving full enumeration of the configuration space result in exponential complexity. Sampling methods such as Markov Chain Monte Carlo (MCMC) algorithms have been proposed to tackle the exponential complexity of these problems. In certain scenarios where significant energetic coupling exists between the entities, the accuracy of the such algorithms can be diminished. We propose a strategy to improve the accuracy of the MCMC runs by taking advantage of the cluster structure in the interaction energy matrix. We propose two different schemes for performing the biased MCMC runs on the partitioned systems and show that they are valid MCMC schemes. We then apply these algorithms to the problem of computing the protonation fractions and hence the titration curves of titratable protein residues that constitute a given protein. We leverage both synthesized and real-world systems and show the improved performance of our biased MCMC methods when compared to the regular MCMC method.

Visweswara Sathanur, Arun↗

X-ray diffraction at the National Ignition Facility

We report details of an experimental platform implemented at the National Ignition Facility to obtain in situ powder diffraction data from solids dynamically compressed to extreme pressures. Thin samples are sandwiched between tamper layers and ramp compressed using a gradual increase in the drive-laser irradiance. Pressure history in the sample is determined using high-precision velocimetry measurements. Up to two independently timed pulses of x rays are produced at or near the time of peak pressure by laser illumination of thin metal foils. The quasi-monochromatic x-ray pulses have a mean wavelength selectable between 0.6 Å and 1.9 Å depending on the foil material. The diffracted signal is recorded on image plates with a typical 2 θ x-ray scattering angle uncertainty of about 0.2° and resolution of about 1°. Analytic expressions are reported for systematic corrections to 2 θ due to finite pinhole size and sample offset. A new variant of a nonlinear background subtraction algorithm is described, which has been used to observe diffraction lines at signal-to-background ratios as low as a few percent. Variations in system response over the detector area are compensated in order to obtain accurate line intensities; this system response calculation includes a new analytic approximation for image-plate sensitivity as a function of photon energy and incident angle. This experimental platform has been used up to 2 TPa (20 Mbar) to determine the crystal structure, measure the density, and evaluate the strain-induced texturing of a variety of compressed samples spanning periods 2–7 on the periodic table.

47 OTHER INSTRUMENTATION↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗