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 1,369 records · Page 76

Demonstration of emulator-based Bayesian calibration of safety analysis codes: Theory and formulation

System codes for simulation of safety performance of nuclear plants may contain parameters whose values are not known very accurately. New information from tests or operating experience is incorporated into safety codes by a process known as calibration, which reduces uncertainty in the output of the code and thereby improves its support for decision-making. The work reported here implements several improvements on classic calibration techniques afforded by modern analysis techniques. The key innovation has come from development of code surrogate model (or code emulator) construction and prediction algorithms. Use of a fast emulator makes the calibration processes used here with Markov Chain Monte Carlo (MCMC) sampling feasible. This study uses Gaussian Process (GP) based emulators, which have been used previously to emulate computer codes in the nuclear field. The present work describes the formulation of an emulator that incorporates GPs into a factor analysis-type or pattern recognition-type model. This “function factorization” Gaussian Process (FFGP) model allows overcoming limitations present in standard GP emulators, thereby improving both accuracy and speed of the emulator-based calibration process. Calibration of a friction-factor example using a Method of Manufactured Solution is performed to illustrate key properties of the FFGP based process.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

OpenMSI Arrayed Analysis Tools (OMAAT) v2.0

Mass spectrometry (MS) is an analytical technique that enables all chemical species within a complex mixture to be resolved and identified based on their mass:charge ratio. MS is an increasingly important tool in life science research and development because it can resolve or separate small molecules, peptides, lipids, proteins, biopolymers and fragments of all of these structures. Unfortunately, the use of MS has been limited for lack of software tools to visualize, manipulate, store and transfer MS data. Ben Bowen, Oliver Ruebel and colleagues made a huge advance on the resolution of these limitations with the invention of "OpenMSI" (#2013-004), a computational method that makes the handling of these very large files (up to 50 Tb) much easier, especially for scientists with limited background in bioinformatics or sophisticated software applications of the type needed to handle such data files. With the OpenMSI Arrayed Analysis Tool (OMAAT, #2016-188) invention, the authors take MS data analysis one step further by providing tolls for automatic sample position optimization and ion selection. Even though sample deposition technologies have improved greatly, there is always the chance of encountering outliers in a predefined roster, especially in very large sample sets. Manual curation of the data would be extremely time consuming, so the inventors have included an algorithm that automatically finds the outliers. OMAAT is written in Python with accompanying Jupyter (formerly iPython) notebook and is fully integrated with OpenMSI.

Bowen, Benjamin↗

Active Learning in the Era of Big Data

Active learning methods automatically adapt data collection by selecting the most informative samples in order to accelerate machine learning. Because of this, real-world testing and comparing active learning algorithms requires collecting new datasets (adaptively), rather than simply applying algorithms to benchmark datasets, as is the norm in (passive) machine learning research. To facilitate the development, testing and deployment of active learning for real applications, we have built an open-source software system for large-scale active learning research and experimentation. The system, called NEXT, provides a unique platform for realworld, reproducible active learning research. This paper details the challenges of building the system and demonstrates its capabilities with several experiments. The results show how experimentation can help expose strengths and weaknesses of active learning algorithms, in sometimes unexpected and enlightening ways.

Jamieson, Kevin↗

Sythesis of MCMC and Belief Propagation

Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typically fast, empirically very successful, however in general lacking control of accuracy over loopy graphs. In this paper, we introduce MCMC algorithms correcting the approximation error of BP, i.e., we provide a way to compensate for BP errors via a consecutive BP-aware MCMC. Our framework is based on the Loop Calculus (LC) approach which allows to express the BP error as a sum of weighted generalized loops. Although the full series is computationally intractable, it is known that a truncated series, summing up all 2-regular loops, is computable in polynomial-time for planar pair-wise binary GMs and it also provides a highly accurate approximation empirically. Motivated by this, we first propose a polynomial-time approximation MCMC scheme for the truncated series of general (non-planar) pair-wise binary models. Our main idea here is to use the Worm algorithm, known to provide fast mixing in other (related) problems, and then design an appropriate rejection scheme to sample 2-regular loops. Furthermore, we also design an efficient rejection-free MCMC scheme for approximating the full series. The main novelty underlying our design is in utilizing the concept of cycle basis, which provides an efficient decomposition of the generalized loops. In essence, the proposed MCMC schemes run on transformed GM built upon the non-trivial BP solution, and our experiments show that this synthesis of BP and MCMC outperforms both direct MCMC and bare BP schemes.

97 MATHEMATICS AND COMPUTING↗

Adaptive estimation of quantum observables

The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable, and determines the next measurement step based on this information. We allow both for overlap and non-bitwise commutation relations in the subsets of Pauli operators that are simultaneously probed, thereby maximizing the amount of gathered information. AEQuO comes in two variants: a greedy bucket-filling algorithm with good performance for small problem instances, and a machine learning-based algorithm with more favorable scaling for larger instances. The measurement configuration determined by these subroutines is further post-processed in order to lower the error on the estimator. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods based on various grouping techniques or randomized measurements, thus greatly lowering the toll of measurements in current and future quantum applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Supercooled Liquid Water Detection Capabilities from Ka-Band Doppler Profiling Radars: Moment-Based Algorithm Formulation and Assessment

The occurrence of supercooled liquid water in mixed-phase cloud (MPC) affects their cloud microphysical and radiative properties. The prevalence of MPCs in the mid- and high latitudes translates these effects to significant contributions to Earth’s radiative balance and hydrological cycle. The current study develops and assesses a radar-only, moment-based phase partition technique for the demarcation of supercooled liquid water volumes in arctic, MPC conditions. The study utilizes observations from the Ka band profiling radar, the collocated high spectral resolution lidar, and ambient temperature profiles from radio sounding deployments following a statistical analysis of 5.5 years of data (January 2014–May 2019) from the Atmospheric Radiation Measurement observatory at the North Slope of Alaska. The ice/liquid phase partition occurs via a per-pixel, neighborhood-dependent algorithm based on the premise that the partitioning can be deduced by examining the mean values of locally sampled probability distributions of radar-based observables and then compare those against the means of climatologically derived, per-phase probability distributions. Analyzed radar observables include linear depolarization ratio (LDR), spectral width, and vertical gradients of reflectivity factor and radial velocity corrected for vertical air motion. Results highlight that the optimal supercooled liquid water detection skill levels are realized for the radar variable combination of spectral width and reflectivity vertical gradient, suggesting that radar-based polarimetry, in the absence of full LDR spectra, is not as critical as Doppler capabilities. The cloud phase masking technique is proven particularly reliable when applied to cloud tops with an Equitable Threat Score (ETS) of 65%; the detection of embedded supercooled layers remains much more uncertain (ETS = 27%).

54 ENVIRONMENTAL SCIENCES↗

Reconstructing high-dimensional Hilbert-valued functions via compressed sensing

We present and analyze a novel sparse polynomial technique for approximating high-dimensional Hilbert-valued functions, with application to parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our theoretical framework treats the function approximation problem as a joint sparse recovery problem, where the set of jointly sparse vectors is possibly infinite. To achieve the simultaneous reconstruction of Hilbert-valued functions in both parametric domain and Hilbert space, we propose a novel mixed-norm based `1 regularization method that exploits both energy and sparsity. Our approach requires extensions of concepts such as the restricted isometry and null space properties, allowing us to prove recovery guarantees for sparse Hilbert-valued function reconstruction. We complement the enclosed theory with an algorithm for Hilbert-valued recovery, based on standard forward-backward algorithm, meanwhile establishing its strong convergence in the considered infinite-dimensional setting. Finally, we demonstrate the minimal sample complexity requirements of our approach, relative to other popular methods, with numerical experiments approximating the solutions of high-dimensional parameterized elliptic PDEs.

Dexter, Nick↗

Sensors with Intelligent Measurement Platform and Low-cost Equipment (SIMPLE) – Performance Characterization

Design and performance of a digital signal processing platform for enhancing off-the-shelf voltage and current sensors are presented. The platform was developed for enabling advanced distribution grid applications with existing low-cost sensors. This digital sensor system leverages a variety of off-the-shelf voltage and current sensing technologies, analog-to-digital conversion, and sensor correction algorithms to yield more accurate and reliable digital measurements that support a multitude of applications and use cases. Sample performance and accuracy results are provided, including measurements at power frequency and higher harmonics. The system extends the native performance of the medium voltage sensors used in the system, for example, broadening measurement bandwidth beyond a few kHz, appropriate for measuring switching surges and harmonics on medium voltage distribution systems. The digital sensor system is installed and characterized in the field with a high-bandwidth optical calibration system to determine site-dependent calibration and performance issues.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamic Model Agnostic Reliability Evaluation of Machine-Learning Models Integrated in Instrumentation & Control Systems

In recent years, the field of data-driven neural network-based machine learning (ML) algorithms has grown significantly and spurred research in its applicability to instrumentation and control systems. While they are promising in operational contexts, the trustworthiness of such algorithms is not adequately assessed. Failures of ML-integrated systems are poorly understood; the lack of comprehensive risk modeling can degrade the trustworthiness of these systems. In recent reports by the National Institute for Standards and Technology, trustworthiness in ML is a critical barrier to adoption and will play a vital role in intelligent systems' safe and accountable operation. Thus, in this work, we demonstrate a real-time model-agnostic method to evaluate the relative reliability of ML predictions by incorporating out-of-distribution detection on the training dataset. It is well documented that ML algorithms excel at interpolation (or near-interpolation) tasks but significantly degrade at extrapolation. This occurs when new samples are "far" from training samples. The method, referred to as the Laplacian distributed decay for reliability (LADDR), determines the difference between the operational and training datasets, which is used to calculate a prediction's relative reliability. LADDR is demonstrated on a feedforward neural network-based model used to predict safety significant factors during different loss-of-flow transients. LADDR is intended as a "data supervisor" and determines the appropriateness of well-trained ML models in the context of operational conditions. Ultimately, LADDR illustrates how training data can be used as evidence to support the trustworthiness of ML predictions when utilized for conventional interpolation tasks.

97 MATHEMATICS AND COMPUTING↗

Measurement of buried undercut structures in microfluidic devices by laser fluorescent confocal microscopy

Measuring buried, undercut microstructures is a challenging task in metrology. These structures are usually characterized by measuring their cross sections after physically cutting the samples. This method is destructive and the obtained information is incomplete. The distortion due to cutting also affects the measurement accuracy. In this paper, we first apply the laser fluorescent confocal microscopy and intensity differentiation algorithm to obtain the complete three-dimensional profile of the buried, undercut structures in microfluidic devices, which are made by the soft lithography technique and bonded by the oxygen plasma method. The impact of material wettability and the refractive index (n) mismatch among the liquid, samples, cover layer, and objective on the measurement accuracy are experimentally investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A machine learning approach to photometric metallicities of giant stars

ABSTRACT Despite the advances provided by large-scale photometric surveys, stellar features – such as metallicity – generally remain limited to spectroscopic observations often of bright, nearby low-extinction stars. To rectify this, we present a neural network approach for estimating the metallicities and distances of red giant stars with 8-band photometry and parallaxes from Gaia EDR3 and the 2MASS and WISE surveys. The algorithm accounts for uncertainties in the predictions arising from the range of possible outputs at each input and from the range of models compatible with the training set (through drop-out). A two-stage procedure is adopted where an initial network to estimate photoastrometric parallaxes is trained using a large sample of noisy parallax data from Gaia EDR3 and then a secondary network is trained using spectroscopic metallicities from the APOGEE and LAMOST surveys and an augmented feature space utilizing the first-stage parallax estimates. The algorithm produces metallicity predictions with an average uncertainty of $\pm 0.19\, \mathrm{dex}$. The methodology is applied to stars within the Galactic bar/bulge with particular focus on a sample of 1.69 million objects with Gaia radial velocities. We demonstrate the use and validity of our approach by inspecting both spatial and kinematic gradients with metallicity in the Galactic bar/bulge recovering previous results on the vertical metallicity gradient (−0.528 ± 0.002 dex kpc−1) and the vertex deviation of the bar ($-21.29\pm 2.74\, \mathrm{deg}$).

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗

THE HARPS-TERRA PROJECT. I. DESCRIPTION OF THE ALGORITHMS, PERFORMANCE, AND NEW MEASUREMENTS ON A FEW REMARKABLE STARS OBSERVED BY HARPS

Doppler spectroscopy has uncovered or confirmed all the known planets orbiting nearby stars. Two main techniques are used to obtain precision Doppler measurements at optical wavelengths. The first approach is the gas cell method, which consists of least-squares matching of the spectrum of iodine imprinted on the spectrum of the star. The second method relies on the construction of a stabilized spectrograph externally calibrated in wavelength. The most precise stabilized spectrometer in operation is the High Accuracy Radial velocity Planet Searcher (HARPS), operated by the European Southern Observatory in La Silla Observatory, Chile. The Doppler measurements obtained with HARPS are typically obtained using the cross-correlation function (CCF) technique. This technique consists of multiplying the stellar spectrum by a weighted binary mask and finding the minimum of the product as a function of the Doppler shift. It is known that CCF is suboptimal in exploiting the Doppler information in the stellar spectrum. Here we describe an algorithm to obtain precision radial velocity measurements using least-squares matching of each observed spectrum to a high signal-to-noise ratio template derived from the same observations. This algorithm is implemented in our software HARPS-TERRA (Template-Enhanced Radial velocity Re-analysis Application). New radial velocity measurements on a representative sample of stars observed by HARPS are used to illustrate the benefits of the proposed method. We show that, compared with CCF, template matching provides a significant improvement in accuracy, especially when applied to M dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗

Computing Relative Binding Affinity of Ligands to Receptor: An Effective Hybrid Single-Dual-Topology Free-Energy Perturbation Approach in NAMD

An effective hybrid single-dual-topology protocol is designed for the calculation of relative binding affinities of small ligands to a receptor. The protocol was developed as an extension of the NAMD molecular dynamics program, which exclusively supports a dual-topology framework for relative alchemical free-energy perturbation (FEP) calculations. Here, the alchemical end states are represented as two separate molecules sharing a common substructure identified through maximum structural mapping. Within the substructure, an atom-to-atom correspondence is established, and each pair of corresponding atoms is holonomically constrained to share identical coordinates at all time throughout the simulation. The forces are projected and combined at each step for propagation. Following this formulation, a set of illustrative calculations of reliable experiment/simulation data, including relative solvation free energies of small molecules and relative binding affinities of drug compounds to proteins, are presented. To enhance sampling of the dual-topology region, the FEP calculations were carried out within a replica-exchange MD scheme supported by the multiple-copy algorithm module of NAMD, with periodically attempted swapping of the thermodynamic coupling parameter lambda between neighboring states. The findings are consistent with experiments and benchmarks reported in the literature, lending support to the validity of the current protocol. In summary, this hybrid single-dual-topology approach combines the conceptual simplicity of the dual-topology paradigm with the advantageous sampling efficiency of the single-topology method, making it an ideal strategy for high-throughput in silico drug design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance of missing transverse momentum reconstruction in proton-proton collisions at √ s = 13 TeV using the CMS detector

The performance of missing transverse momentum (p → T miss ) reconstruction algorithms for the CMS experiment is presented, using proton-proton collisions at a center-of-mass energy of 13 TeV, collected at the CERN LHC in 2016. The data sample corresponds to an integrated luminosity of 35.9 fb -1 . The results include measurements of the scale and resolution of p → T miss , and detailed studies of events identified with anomalous p → T miss . The performance is presented of a p → T miss reconstruction algorithm that mitigates the effects of multiple proton-proton interactions, using the "pileup per particle identification" method. The performance is shown of an algorithm used to estimate the compatibility of the reconstructed p → T miss with the hypothesis that it originates from resolution effects.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Hybrid-Learning Algorithm for Online Dynamic State Estimation in Multimachine Power Systems

With the increasing penetration of distributed generators in the smart grids, having knowledge of rapid real-time electromechanical dynamic states has become crucial to system stability control. Conventional Supervisory Control and Data Acquisition (SCADA)-based dynamic state estimation (DSE) techniques are limited by the slow sampling rates, while the emerging phasor measurement units (PMUs) technology enables rapid real-time measurements at network nodes. Using generator bus terminal voltages, we propose a hybrid-learning DSE (HL-DSE) algorithm to estimate the synchronous machine rotor angle and speed in real time. The HL-DSE takes the power system model into account and trains neuroestimators with real-time data in an online manner. Compared with traditional DSE methods, the HL-DSE overcomes limitations by using a data-driven approach in conjunction with the physical power system model. The time efficiency, accuracy, convergence, and robustness of the proposed algorithm are tested under noises and fault conditions in both small- and large-scale test systems. Simulation results show that the proposed HL-DSE is much more computationally efficient than widely used Kalman filter (KF)-based methods while maintaining comparable accuracy and robustness. In particular, HL-DSE is over 100 times faster than square-root unscented KF (SR-UKF) and 80 times faster than extended KF (EKF). The advantages and challenges of the HL-DSE are also discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

MADmap: A Massively Parallel Maximum-Likelihood Cosmic Microwave Background Map-Maker

MADmap is a software application used to produce maximum-likelihood images of the sky from time-ordered data which include correlated noise, such as those gathered by Cosmic Microwave Background (CMB) experiments. It works efficiently on platforms ranging from small workstations to the most massively parallel supercomputers. Map-making is a critical step in the analysis of all CMB data sets, and the maximum-likelihood approach is the most accurate and widely applicable algorithm; however, it is a computationally challenging task. This challenge will only increase with the next generation of ground-based, balloon-borne and satellite CMB polarization experiments. The faintness of the B-mode signal that these experiments seek to measure requires them to gather enormous data sets. MADmap is already being run on up to O(1011) time samples, O(108) pixels and O(104) cores, with ongoing work to scale to the next generation of data sets and supercomputers. We describe MADmap's algorithm based around a preconditioned conjugate gradient solver, fast Fourier transforms and sparse matrix operations. We highlight MADmap's ability to address problems typically encountered in the analysis of realistic CMB data sets and describe its application to simulations of the Planck and EBEX experiments. The massively parallel and distributed implementation is detailed and scaling complexities are given for the resources required. MADmap is capable of analysing the largest data sets now being collected on computing resources currently available, and we argue that, given Moore's Law, MADmap will be capable of reducing the most massive projected data sets.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive filtered back-projection for photoacoustic image reconstruction

Purpose: The purpose of this study is to develop an improved filtered-back-projection (FBP) algorithm for photoacoustic tomography (PAT), which allows image reconstruction with higher quality compared to images reconstructed through traditional algorithms. Methods: A rigorous expression of a weighting function has been derived directly from a photoacoustic wave equation and used as a ramp filter in Fourier domain. The authors’ new algorithm utilizes this weighting function to precisely calculate each photoacoustic signal’s contribution and then reconstructs the image based on the retarded potential generated from the photoacoustic sources. In addition, an adaptive criterion has been derived for selecting the cutoff frequency of a low pass filter. Two computational phantoms were created to test the algorithm. The first phantom contained five spheres with each sphere having different absorbances. The phantom was used to test the capability for correctly representing both the geometry and the relative absorbed energy in a planar measurement system. The authors also used another phantom containing absorbers of different sizes with overlapping geometry to evaluate the performance of the new method for complicated geometry. In addition, random noise background was added to the simulated data, which were obtained by using an arc-shaped array of 50 evenly distributed transducers that spanned 160° over a circle with a radius of 65 mm. A normalized factor between the neighbored transducers was applied for correcting measurement signals in PAT simulations. The authors assumed that the scanned object was mounted on a holder that rotated over the full 360° and the scans were set to a sampling rate of 20.48 MHz. Results: The authors have obtained reconstructed images of the computerized phantoms by utilizing the new FBP algorithm. From the reconstructed image of the first phantom, one can see that this new approach allows not only obtaining a sharp image but also showing the correct signal strength of the absorbers. The reconstructed image of the second phantom further demonstrates the capability to form clear images of the spheres with sharp borders in the overlapping geometry. The smallest sphere is clearly visible and distinguishable, even though it is surrounded by two big spheres. In addition, image reconstructions were conducted with randomized noise added to the observed signals to mimic realistic experimental conditions. Conclusions: The authors have developed a new FBP algorithm that is capable for reconstructing high quality images with correct relative intensities and sharp borders for PAT. The results demonstrate that the weighting function serves as a precise ramp filter for processing the observed signals in the Fourier domain. In addition, this algorithm allows an adaptive determination of the cutoff frequency for the applied low pass filter.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗