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,459 records · Page 81

HYPERCOMPACT STELLAR SYSTEMS AROUND RECOILING SUPERMASSIVE BLACK HOLES

A supermassive black hole ejected from the center of a galaxy by gravitational-wave recoil carries a retinue of bound stars - a 'hypercompact stellar system' (HCSS). The numbers and properties of HCSSs contain information about the merger histories of galaxies, the late evolution of binary black holes, and the distribution of gravitational-wave kicks. We relate the structural properties (size, mass, density profile) of HCSSs to the properties of their host galaxies and to the size of the kick in two regimes: collisional (M {sub BH} {approx}< 10{sup 7} M {sub sun}), i.e., short nuclear relaxation times, and collisionless (M {sub BH} {approx}> 10{sup 7} M {sub sun}), i.e., long nuclear relaxation times. HCSSs are expected to be similar in size and luminosity to globular clusters, but in extreme cases (large galaxies, kicks just above escape velocity) their stellar mass can approach that of ultracompact dwarf galaxies. However, they differ from all other classes of compact stellar system in having very high internal velocities. We show that the kick velocity is encoded in the velocity dispersion of the bound stars. Given a large enough sample of HCSSs, the distribution of gravitational-wave kicks can therefore be empirically determined. We combine a hierarchical merger algorithm with stellar population models to compute the rate of production of HCSSs over time and the probability of observing HCSSs in the local universe as a function of their apparent magnitude, color, size, and velocity dispersion, under two different assumptions about the star formation history prior to the kick. We predict that {approx}10{sup 2} HCSSs should be detectable within 2 Mpc of the center of the Virgo cluster, and that many of these should be bright enough that their kick velocities (i.e., velocity dispersions) could be measured with reasonable exposure times. We discuss other strategies for detecting HCSSs and speculate on some exotic manifestations.

79 ASTRONOMY AND ASTROPHYSICS↗

Software Trigger Algorithms to Search for Magnetic Monopoles with the NO$\nu$A Far Detector

The NOvA far detector, due to its surface proximity, large size, good timing resolution, large energy dynamic range, and continuous readout, is sensitive to the detection of magnetic monopoles over a large range of velocities and masses. In order to record candidate magnetic monopole events with high efficiency we have designed a software-based trigger to make decisions based on the data recorded by the detector. The decisions must be fast, have high efficiency, and a large rejection factor for the over 100,000 cosmic rays that course through the detector every second. In this paper we briefly describe the simulation of magnetic monopoles, including the detector response, and then discuss the algorithms applied to identify magnetic monopole candidates. We also present the results of trigger efficiency and purity tests using simulated samples of magnetic monopoles with overlaid cosmic backgrounds and electronic noise.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

The continuous readout stream of the MicroBooNE liquid argon time projection chamber for detection of supernova burst neutrinos

The MicroBooNE continuous readout stream is a parallel readout of the MicroBooNE liquid argon time projection chamber (LArTPC) which enables detection of non-beam events such as those from a supernova neutrino burst. The low energies of the supernova neutrinos and the intense cosmic-ray background flux due to the near-surface detector location makes triggering on these events very challenging. Instead, MicroBooNE relies on a delayed trigger generated by SNEWS (the Supernova Early Warning System) for detecting supernova neutrinos. The continuous readout of the LArTPC generates large data volumes, and requires the use of real-time compression algorithms (zero suppression and Huffman compression) implemented in an FPGA (field-programmable gate array) in the readout electronics. In this paper we present the results of the optimization of the data reduction algorithms, and their operational performance. To demonstrate the capability of the continuous stream to detect low-energy electrons, a sample of Michel electrons from stopping cosmic-ray muons is reconstructed and compared to a similar sample from the lossless triggered readout stream.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Global Sensitivity Analysis of a Reactive Transport Model for Mineral Scale Formation During Hydraulic Fracturing

Injection of water-based hydraulic fracturing fluid (HFF) into tight shale gas/oil formations can increase formation permeability and enhance production rates, but this process frequently causes mineral scale formation that can occlude pore space and hinder flow. To identify the most important factors that control the formation of mineral scales, we applied a novel global sensitivity analysis method—distance-based generalized sensitivity analysis (DGSA)—to a reactive transport model (RTM) that was previously built and calibrated to simulate precipitation of barite [BaSO4] and iron (hydr)oxide [Fe(OH) 3 ] in shale matrices and on fracture surfaces. Reactive transport simulations were run with model parameters randomly sampled based on assigned uncertainties. Modeling results for barite and Fe(OH)3 formation were clustered using machine-learning algorithms. A list of ranked critical input parameters was obtained after statistical quantification of cumulative distribution functions of input parameters. We found that barite formation is most sensitive to the rate of sulfate ion generation, which is determined by the pyrite dissolution rate coefficient and oxidant availability. In addition, barite formation is sensitive to the initial amounts of barite in HFF and shale, followed by barite thermodynamics/kinetics. For Fe(OH) 3 formation, the ranked factors are Fe(OH)3 precipitation rate coefficients, initial HFF pH, initial Fe(OH) 3 amount in HFF, and oxidant availability. Overall, our results provide insights into managing mineral scale formation during hydraulic fracturing to enhance production. Meanwhile, this study serves as an example of global sensitivity analysis of RTMs using the efficient, straightforward, and open-source DGSA method.

58 GEOSCIENCES↗

End-to-end jet classification of boosted top quarks with the CMS open data

Here we describe a novel application of the end-to-end deep learning technique to the task of discriminating top quark-initiated jets from those originating from the hadronization of a light quark or a gluon. The end-to-end deep learning technique uses low-level detector representation of high-energy collision event as inputs to deep learning algorithms. In this study, we use low-level detector information from the simulated Compact Muon Solenoid (CMS) open data samples to construct the top jet classifiers. To optimize classifier performance we progressively add low-level information from the CMS tracking detector, including pixel detector reconstructed hits and impact parameters, and demonstrate the value of additional tracking information even when no new spatial structures are added. Relying only on calorimeter energy deposits and reconstructed pixel detector hits, the end-to-end classifier achieves an area under the receiver operator curve (AUC) score of 0.975 ± 0.002 for the task of classifying boosted top quark jets. After adding derived track quantities, the classifier AUC score increases to 0.9824 ± 0.0013, serving as the first performance benchmark for these CMS open data samples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗

Defining blood hematology reference values in female pig-tailed macaques ( Macaca nemestrina ) using the Isolation Forest algorithm

Background: Pig-tailed macaques (PTMs) are commonly used as preclinical models to assess antiretroviral drugs for HIV prevention research. Drug toxicities and disease pathologies are often preceded by changes in blood hematology. To better assess the safety profile of pharmaceuticals, we defined normal ranges of hematological values in PTMs using an Isolation Forest (iForest) algorithm. Methods: Eighteen female PTMs were evaluated. Blood was collected 1–24 times per animal for a total of 159 samples. Complete blood counts were performed, and iForest was used to analyze the hematology data to detect outliers. Results: Median, IQR, and ranges were calculated for 13 hematology parameters. From all samples, 22 outliers were detected. These outliers were excluded from the reference index. Conclusions: Using iForest, we defined a normal range for hematology parameters in female PTMs. This reference index can be a valuable tool for future studies evaluating drug toxicities in PTMs.

59 BASIC BIOLOGICAL SCIENCES↗

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING↗

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Quantification in Scientific ML

The intricate interactions between data sampling, model selection and the inherent randomness in complex systems strongly emphasize the need for a rigorous characterization of ML algorithms. In conventional statistics, uncertainty quantification (UQ) provides this characterization by measuring how accurately a model reflects the physical reality and by studying the impact of different error sources on the prediction.

97 MATHEMATICS AND COMPUTING↗

Analysis of In situ Observations of Cloud Microphysics from M-PACE Final Report, DOE Grant Agreement No. DE-FG02-06ER64168

This report summarizes the findings and accomplishments of work performed under DOE Grant Agreement No. DE-FG02-06ER64168. The focus of the work was the analysis of in situ observations collected by the University of North Dakota Citation research aircraft during the Mixed-Phase Arctic Cloud Experiment (M-PACE). This project was conducted in 2004 along the North Slope of Alaska. The objectives of the research were: to characterize certain microphysical properties of clouds sampled during M-PACE, including spatial variability, precipitation formation, ice multiplication; to examine instrument performance and certain data processing algorithms; and to collaborate with other M-PACE investigators on case study analyses. A summary of the findings of the first two objectives is given here in parts 1 and 2; full results are contained in reports listed in part 3 of this report. The collaborative efforts are described in the publications listed in part 3.

54 ENVIRONMENTAL SCIENCES↗

A Statistical Model for Generating a Population of Unclassified Objects and Radiation Signatures Spanning Nuclear Threats

This report describes an approach for generating a simulated population of plausible nuclear threat radiation signatures spanning a range of variability that could be encountered by radiation detection systems. In this approach, we develop a statistical model for generating random instances of smuggled nuclear material. The model is based on physics principles and bounding cases rather than on intelligence information or actual threat device designs. For this initial stage of work, we focus on random models using fissile material and do not address scenarios using non-fissile materials. The model has several uses. It may be used as a component in a radiation detection system performance simulation to generate threat samples for injection studies. It may also be used to generate a threat population to be used for training classification algorithms. In addition, we intend to use this model to generate an unclassified 'benchmark' threat population that can be openly shared with other organizations, including vendors, for use in radiation detection systems performance studies and algorithm development and evaluation activities. We assume that a quantity of fissile material is being smuggled into the country for final assembly and that shielding may have been placed around the fissile material. In terms of radiation signature, a nuclear weapon is basically a quantity of fissile material surrounded by various layers of shielding. Thus, our model of smuggled material is expected to span the space of potential nuclear weapon signatures as well. For computational efficiency, we use a generic 1-dimensional spherical model consisting of a fissile material core surrounded by various layers of shielding. The shielding layers and their configuration are defined such that the model can represent the potential range of attenuation and scattering that might occur. The materials in each layer and the associated parameters are selected from probability distributions that span the range of possibilities. Once an object is generated, its radiation signature is calculated using a 1-dimensional deterministic transport code. Objects that do not make sense based on physics principles or other constraints are rejected. Thus, the model can be used to generate a population of spectral signatures that spans a large space, including smuggled nuclear material and nuclear weapons.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Can changes in deformation regimes be inferred from crystallographic preferred orientations in polar ice?

Creep due to ice flow is generally thought to be the main cause for the formation of crystallographic preferred orientations (CPOs) in polycrystalline anisotropic ice. However, linking the development of CPOs to the ice flow history requires a proper understanding of the ice aggregate's microstructural response to flow transitions. In this contribution the influence of ice deformation history on the CPO development is investigated by means of full-field numerical simulations at the microscale. We simulate the CPO evolution of polycrystalline ice under combinations of two consecutive deformation events up to high strain, using the code VPFFT (visco-plastic fast Fourier transform algorithm) within ELLE. A volume of ice is first deformed under coaxial boundary conditions, which results in a CPO. The sample is then subjected to different boundary conditions (coaxial or non-coaxial) in order to observe how the deformation regime switch impacts the CPO. The model results indicate that the second flow event tends to destroy the first, inherited fabric with a range of transitional fabrics. However, the transition is slow when crystallographic axes are critically oriented with respect to the second imposed regime. Therefore, interpretations of past deformation events from observed CPOs must be carried out with caution, particularly in areas with complex deformation histories.

54 ENVIRONMENTAL SCIENCES↗

Method for implementing depth deconvolution algorithm for enhanced thermal tomography 3D imaging

A computer-implemented method, apparatus, and computer program product implement enhanced thermal tomography three-dimensional (3D) thermal effusivity imaging. Experimental thermal imaging data is acquired. A response function is derived and a convolution formulation is constructed from the experimental thermal imaging data. A deconvolution solution procedure is implemented that includes constructing a matrix solution equation with a damping parameter, and solving the matrix solution equation with a selected number of iterations to construct a plurality of effusivity images. Using the novel depth deconvolution algorithm with experimental data acquired from a one-sided pulsed thermal-imaging system provides greater sensitivity for internal sample features substantially eliminating degradation in depth resolution.

36 MATERIALS SCIENCE↗

Automated quantum error mitigation based on probabilistic error reduction

Current quantum computers suffer from a level of noise that prohibits extracting useful results directly from longer computations. The figure of merit in many near-term quantum algorithms is an expectation value measured at the end of the computation, which experiences a bias in the presence of hardware noise. A systematic way to remove such bias is probabilistic error cancellation (PEC). PEC requires a full characterization of the noise and introduces a sampling overhead that increases exponentially with circuit depth, prohibiting high-depth circuits at realistic noise levels. Probabilistic error reduction (PER) is a related quantum error mitigation method that systematically reduces the sampling overhead at the cost of reintroducing bias. In combination with zero-noise extrapolation, PER can yield expectation values with an accuracy comparable to PEC.Noise reduction through PER is broadly applicable to near-term algorithms, and the automated implementation of PER is thus desirable for facilitating its widespread use. To this end, we present an automated quantum error mitigation software framework that includes noise tomography and application of PER to user-specified circuits. We provide a multi-platform Python package that implements a recently developed Pauli noise tomography (PNT) technique for learning a sparse Pauli noise model and exploits a Pauli noise scaling method to carry out PER.We also provide software tools that leverage a previously developed toolchain, employing PyGSTi for gate set tomography and providing a functionality to use the software Mitiq for PER and zero-noise extrapolation to obtain error-mitigated expectation values on a user-defined circuit.

McDonough, Benjamin↗

Primal-Dual Differentiable Programming for Distribution System Critical Load Restoration: Preprint

Swift and reliable critical load restoration (CLR) can help make a distribution system resilient towards extreme events. To optimally achieve that, alongside practical concerns such as limiting online computational burden, some studies leverage model-free reinforcement learning (RL) to train control policies. Despite the advantages provided by RL algorithms, these approaches suffer from two issues: 1) the lack of a proper mechanism for constraint enforcement, and 2) poor sample efficiency. Therefore, in this paper, a primal-dual differentiable programming (PDDP) method is developed for guiding the training leading to a constraint-satisfying policy. Additionally, the model-based nature of the proposed method aims at improving sample efficiency. The experiment on a CLR problem demonstrates that PDDP can effectively train a control policy that both achieves desirable performance and satisfies required constraints.

differentiable programming↗

Preparing Fermions via Classical Sampling and Linear Combinations of Unitaries

We present an extension of the Evolving density matrices on Qubits (E$ρ$OQ) framework that enables efficient fault-tolerant preparation of fermionic quantum states. The original method circumvents state preparation by stochastic sampling, but faces a sign problem in fermionic systems leading to a large number of circuits necessary. We resolve this by combining classical stochastic sampling with a linear combination of unitaries method that avoids the exponential circuit scaling that plagued naïve implementations. The resulting algorithm requires $\mathcal{O}(M^2)$$R_Z$ rotations for circuit preparation, where $M$ is the number of retained basis states. We validate the method for ground and excited states in the Thirring model, including by computing two-point correlation functions relevant to scattering. In this model for fixed accuracy $\varepsilon$, $M$ is found to scale empirically as $M \propto \frac{1}{mg}\log(1/g)\log(1/m)$.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗