Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling 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 541 records · Page 30

Scattering of a laser beam on a wet blood smear and measurement of red cell size distribution

We report an automated laser system that allows the red cell size distribution to be measured. Experiments are performed on laser light scattering by a suspension of oriented red blood cells (a wet blood smear). Based on an analysis of the angular distribution of light intensity in the diffraction pattern, we have restored the red cell size distribution. The average diameter of a red blood cell is determined with an error of less than 1%, and the spread of red blood cells in size – with an error of about 20%. We discuss the problems of photometry and processing of diffraction patterns, preparing blood samples and data processing algorithms, including methods for solving the inverse scattering problem. (laser biophotonics)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Near-optimal protocols in complex nonequilibrium transformations

Significance Classical thermodynamics was developed to help design the best protocols for operating heat engines that remain close to equilibrium at all times. Modern experimental techniques for manipulating microscopic and mesoscopic systems routinely access far-from-equilibrium states, demanding new theoretical tools to describe the optimal protocols in this more complicated regime. Prior studies have sought, in simple models, the protocol that minimizes dissipation. We use computational tools to investigate the diversity of low-dissipation protocols. We show that optimal protocols can be accompanied by a vast set of near-optimal protocols, which still offer the substantive benefits of the optimal protocol. Although solving for the optimal protocol is typically difficult, computationally identifying a near-optimal protocol can be comparatively easy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sequential Designs Based on Bayesian Uncertainty Quantification in Sparse Representation Surrogate Modeling

A numerical method, called OBSM, was recently proposed which employs overcomplete basis functions to achieve sparse representations. While the method can handle non-stationary response without the need of inverting large covariance matrices, it lacks the capability to quantify uncertainty in predictions. We address this issue by proposing a Bayesian approach which first imposes a normal prior on the large space of linear coefficients, then applies the MCMC algorithm to generate posterior samples for predictions. From these samples, Bayesian credible intervals can then be obtained to assess prediction uncertainty. A key application for the proposed method is the efficient construction of sequential designs. Several sequential design procedures with different infill criteria are proposed based on the generated posterior samples. As a result, numerical studies show that the proposed schemes are capable of solving problems of positive point identification, optimization, and surrogate fitting.

97 MATHEMATICS AND COMPUTING↗

Quantitative Structure Determination from Experimental Four-Dimensional Scanning Transmission Electron Microscopy via the Scattering Matrix

Considerable inroads have recently been made on algorithms to determine the sample potential from four-dimensional scanning transmission electron microscopy data from thick samples where multiple scattering cannot be neglected. This paper further develops the scattering matrix approach to such structure determination. Through simulation, we demonstrate how this approach can be modified to better handle partial spatial coherence, unknown probe defocus, and information from the dark field region. By combining these developments we reconstruct the electrostatic potential of a monolithic SrTiO 3 crystal showing good quantitative agreement with the expected structure.

4D STEM↗

Probabilistic variable-length segmentation of protein sequences for discriminative motif discovery (DiMotif) and sequence embedding (ProtVecX)

ABSTRACT In this paper, we present peptide-pair encoding (PPE), a general-purpose probabilistic segmentation of protein sequences into commonly occurring variable-length sub-sequences. The idea of PPE segmentation is inspired by the byte-pair encoding (BPE) text compression algorithm, which has recently gained popularity in subword neural machine translation. We modify this algorithm by adding a sampling framework allowing for multiple ways of segmenting a sequence. PPE segmentation steps can be learned over a large set of protein sequences (Swiss-Prot) or even a domain-specific dataset and then applied to a set of unseen sequences. This representation can be widely used as the input to any downstream machine learning tasks in protein bioinformatics. In particular, here, we introduce this representation through protein motif discovery and protein sequence embedding. (i) DiMotif: we present DiMotif as an alignment-free discriminative motif discovery method and evaluate the method for finding protein motifs in three different settings: (1) comparison of DiMotif with two existing approaches on 20 distinct motif discovery problems which are experimentally verified, (2) classification-based approach for the motifs extracted for integrins, integrin-binding proteins, and biofilm formation, and (3) in sequence pattern searching for nuclear localization signal. The DiMotif, in general, obtained high recall scores, while having a comparable F1 score with other methods in the discovery of experimentally verified motifs. Having high recall suggests that the DiMotif can be used for short-list creation for further experimental investigations on motifs. In the classification-based evaluation, the extracted motifs could reliably detect the integrins, integrin-binding, and biofilm formation-related proteins on a reserved set of sequences with high F1 scores. (ii) ProtVecX: we extend k-mer based protein vector (ProtVec) embedding to variable-length protein embedding using PPE sub-sequences. We show that the new method of embedding can marginally outperform ProtVec in enzyme prediction as well as toxin prediction tasks. In addition, we conclude that the embeddings are beneficial in protein classification tasks when they are combined with raw k-mer features. Availability Implementations of our method will be available under the Apache 2 licence at http://llp.berkeley.edu/dimotif and http://llp.berkeley.edu/protvecx .

Asgari, Ehsaneddin↗

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Calibration of a soft secondary vertex tagger using proton-proton collisions at s = 13 TeV with the ATLAS detector

Several processes studied by the ATLAS experiment at the Large Hadron Collider produce low-momentum b-flavored hadrons in the final state. This paper describes the calibration of a dedicated tagging algorithm that identifies b-flavored hadrons outside of hadronic jets by reconstructing the soft secondary vertices originating from their decays. The calibration is based on a proton-proton collision dataset at a center-of-mass energy of 13 TeV corresponding to an integrated luminosity of 140 fb -1 . Scale factors used to correct the algorithm’s performance in simulated events are extracted for the b-tagging efficiency and the mistag rate of the algorithm using a data sample enriched in $t\overline{t}$ events. Several orthogonal measurement regions are defined, binned as a function of the multiplicities of soft secondary vertices and jets containing a b-flavored hadron in the event. The mistag rate scale factors are estimated separately for events with low and high average numbers of interactions per bunch crossing. The results, which are derived from events with low missing transverse momentum, are successfully validated in a phase space characterized by high missing transverse momentum and therefore are applicable to new physics searches carried out in either phase space regime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time

Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024

Pocrnic, Matthew (ORCID:0000000203089376)↗

Extracting off-diagonal order from diagonal basis measurements

Quantum gas microscopy has developed into a powerful tool to explore strongly correlated quantum systems. However, discerning phases with topological or off-diagonal long range order requires the ability to extract these correlations from site-resolved measurements. Here, we show that a multiscale complexity measure can pinpoint the transition to and from the bond ordered wave phase of the one-dimensional extended Hubbard model with an off-diagonal order parameter, sandwiched between diagonal charge and spin density wave phases, using only diagonal descriptors. We study the model directly in the thermodynamic limit using the recently developed variational uniform matrix product states algorithm, and draw our samples from degenerate ground states related by global spin rotations, emulating the projective measurements that are accessible in experiments. Our results will have important implications for the study of exotic phases using optical lattice experiments. Published by the American Physical Society 2024

1-dimensional systems↗

Dynamical Complexity of Non-Gaussian Many-Body Systems with Dissipation

We characterize the dynamical state of many-body bosonic and fermionic many-body models with intersite Gaussian couplings, on-site non-Gaussian interactions, and local dissipation comprising incoherent particle loss, particle gain, and dephasing. We first establish that, for fermionic systems, if the dephasing noise is larger than the non-Gaussian interactions, irrespective of the Gaussian coupling strength, the system state is a convex combination of Gaussian states at all times. Furthermore, for bosonic systems, we show that if the particle loss and particle gain rates are larger than the Gaussian intersite couplings, the system remains in a separable state at all times. Building on this characterization, we establish that at noise rates above a threshold, there exists a classical algorithm that can efficiently sample from the system state of both the fermionic and bosonic models. Finally, we show that, unlike fermionic systems, bosonic systems can evolve into states that are not convex Gaussian even when the dissipation is much higher than the on-site non-Gaussianity. Similarly, unlike bosonic systems, fermionic systems can generate entanglement even with noise rates much larger than the intersite couplings.

Computational complexity↗

Voronoi Diagram Based Optimization of Dynamic Reactive Power Sources

Dynamic var sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues or even voltage collapse. This paper proposes a new approach to optimization of the sizes of dynamic var sources at candidate locations by a Voronoi diagram based algorithm. It first disperses sample points of potential solutions in a searching space, evaluates a cost function at each point by barycentric interpolation for the subspaces around the point, and then constructs a Voronoi diagram about cost function values over the entire space. Accordingly, the final optimal solution can be obtained. Case studies on the WSCC 9-bus system and NPCC 140-bus system have validated that the new approach can quickly identify the boundary of feasible solutions in searching space and converge to the global optimal solution.

25 ENERGY STORAGE↗

Stochastic DG Placement for Conservation Voltage Reduction Based on Multiple Replications Procedure

Conservation voltage reduction (CVR) and distributed-generation (DG) integration are popular strategies implemented by utilities to improve energy efficiency. This paper investigates the interactions between CVR and DG placement to minimize load consumption in distribution networks, while keeping the lowest voltage level within the predefined range. The optimal placement of DG units is formulated as a stochastic optimization problem considering the uncertainty of DG outputs and load consumptions. A sample average approximation algorithm-based technique is developed to solve the formulated problem effectively. A multiple replications procedure is developed to test the stability of the solution and calculate the confidence interval of the gap between the candidate solution and optimal solution. The proposed method has been applied to the IEEE 37-bus distribution test system with different scenarios. The numerical results indicate that the implementations of CVR and DG, if combined, can achieve significant energy savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗

Cynod: A Neutronics Code for Pebble Bed Modular Reactor Coupled Transient Analysis

The Pebble Bed Reactor (PBR) is one of the two concepts currently considered for development into the Next Generation Nuclear Plant (NGNP). This interest is due, in particular, to the concept’s inherent safety characteristics. In order to verify and confirm the design safety characteristics of the PBR computational tools must be developed that treat the range of phenomena that are expected to be important for this type of reactors. This paper presents a recently developed 2D R-Z cylindrical nodal kinetics code and shows some of its capabilities by applying it to a set of known and relevant benchmarks. The new code has been coupled to the thermal hydraulics code THERMIX/KONVEK[1] for application to the simulation of very fast transients in PBRs. The new code, CYNOD, has been written starting with a fixed source solver extracted from the nodal cylindrical geometry solver contained within the PEBBED code. The fixed source solver was then incorporated into a kinetic solver.. The new code inherits the spatial solver characteristics of the nodal solver within PEBBED. Thus, the time-dependent neutron diffusion equation expressed analytically in each node of the R-Z cylindrical geometry sub-domain (or node) is transformed into one-dimensional equations by means of the usual transverse integration procedure. The one-dimensional diffusion equations in each of the directions are then solved using the analytic Green’s function method. The resulting equations for the entire domain are then re-cast in the form of the Direct Coarse Mesh Finite Difference (D-CMFD) for convenience of solution. The implicit Euler method is used for the time variable discretization. In order to correctly treat the cusping effect for nodes that contain a partially inserted control rod a method is used that takes advantage of the Green’s function solution available in the intrinsic method. In this corrected treatment, the nodes are re-homogenized using axial flux shapes reconstructed based on the Green’s function method. The performance of the new code is demonstrated by applying it to a delayed supercritical problem and a to the OECD PBMR400 rod ejection benchmark problem. The latter makes use of the coupled CYNOD-THERMIX/KONVEK codes. A final improvement to the code is the subject of a companion paper: a heterogeneous TRISO fuel particle model was devised and incorporated into the code and used to provide an enhanced Doppler treatment. The new code is currently being coupled to the RELAP5-3D code for thermal-hydraulics. The full length paper will include extensive summaries of the equations and algorithm, descriptions of the sample and benchmark problems and details of the results. It is shown, in inter-code comparisons, that the new code correctly predicts the transient behaviors of the test problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Targeted Adaptive Design

Modern advanced manufacturing and advanced materials design often require searches of relatively high-dimensional process control parameter spaces for settings that result in optimal structure, property, and performance parameters. The mapping from the former to the latter must be determined from noisy experiments or from expensive simulations. Here, we abstract this problem to a mathematical framework in which an unknown function from a control space to a design space must be ascertained by means of expensive noisy measurements, which locate control settings generating desired design features within specified tolerances, with quantified uncertainty. We describe targeted adaptive design (TAD), a new algorithm that performs this sampling task efficiently. TAD creates a Gaussian process surrogate model of the unknown mapping at each iterative stage, proposing a new batch of control settings to sample experimentally and optimizing the updated expected log-predictive probability density of the target design. TAD either stops upon locating a solution with uncertainties that fit inside the tolerance box or uses a measure of expected future information to determine that the search space has been exhausted with no solution. TAD thus embodies the exploration-exploitation tension in a manner that recalls, but is essentially different from, Bayesian optimization and optimal experimental design.

97 MATHEMATICS AND COMPUTING↗

FTR for: Reducing plug-load electricity footprint of residential buildings through low-cost, non-intrusive sub-metering and personalized feedback technology

The project started in October 2016 and ended in December 2022. The project's principal goals and achievements were: (i) Measure real and reactive electric power consumption in ~400 apartments in multifamily settings of varying size and vintage and publish the data; data was published according to New York State's recommended 15x15 rule continuously from Jan 2019 through December 2022 (10 second time resolution); with the combination of large number of apartments, real and reactive power, as well as high time resolution (10-seconds), the dataset is first of its kind worldwide; because the dataset New York City apartment consumption pre, during, and post pandemic, it further offers unique insights into changes in residential electricity consumption during lockdowns and after modified work from home schedules. (ii) Measure effectiveness of different feedback types to prompt residents to lower their electricity consumption; achieved 11% (kWh-weighted) reduction versus baseline consumption; confirmed previous studies that social comparisons elicit above average responses; showed, for the first time, that the so called boomerang effect in power consumption feedback projects can be explained by a previously hypothesized norm-conforming "magnet effect" (rather than a non-conforming defiance effect), thus substantially advancing the research in the field. (iii) Disaggregate apartment-level consumption to appliance level; because the hardware for electricity consumption unexpectedly allowed only for 10-second time resolution (rather than the 1-second resolution we had planned on), the disaggregation algorithms we developed on sample data could not be applied to the actual field data we collected. The project has yielded high visibility, with a total of 17 publications, from peer reviewed journals, published data sets (free access), blog posts, NY Times, National Public Radio, and CNN.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Assessing and benchmarking the fidelity of posterior inference methods for astrophysics data analysis

In this era of large and complex astronomical survey data, interpreting, validating, and comparing inference techniques becomes increasingly difficult. This is particularly critical for emerging inference methods like Simulation-Based Inference (SBI), which offer significant speedup potential and posterior modeling flexibility, especially when deep learning is incorporated. We present a study to assess and compare the performance and uncertainty prediction capability of Bayesian inference algorithms – from traditional MCMC sampling of analytic functions to deep learning-enabled SBI. We focus on testing the capacity of hierarchical inference modeling in those scenarios. Before we extend this study to cosmology, we first use astrophysical simulation data to ensure interpretability. We demonstrate a probabilistic programming implementation of hierarchical and non-hierarchical Bayesian inference using simulations derived from the DeepBench software library, a benchmarking tool developed by our group that generates simple and controllable astrophysical objects from first principles. This study will enable astronomers and physicists to harness the inference potential of these methods with confidence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Smart Vision-Aided RICH (Robotic Interface Control and Handling) System for VULCAN

High-flux neutron beams and high-efficiency detectors enable rapid neutron diffraction measurements at the Engineering Materials Diffractometer (VULCAN) at the Spallation Neutron Source (SNS), Oak Ridge National Laboratory (ORNL). To optimize beam time utilization, efficient sample exchange, alignment, and automated measurements are essential. Recent advances in artificial intelligence (AI) have expanded the capabilities of robotic systems. Here, we report the development of a Robotic Interactive Control and Handling (RICH) system for sample handling at VULCAN, designed to support high-throughput experiments and reduce overhead time. The RICH system employs a six-axis desktop robot integrated with AI-based computer vision models capable of recognizing and localizing samples in real time from instrument and depth-resolving cameras. Vision algorithms combine these detections to align samples with designated measurement positions or place them within complex sample environments such as furnaces. This integration of machine learning-assisted vision with robotic handling demonstrates the feasibility of autonomous sample detection and preparation, offering a pathway toward fully unmanned neutron scattering experiments.

automation↗