Search NASA⌕ Search

SEARCH · Search NASA

Results for “random sampling”

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 127 records · Page 7

WHAT DOES CLUSTERING TELL US ABOUT THE BUILDUP OF THE RED SEQUENCE?

We analyze the clustering of red and blue galaxies from four samples spanning a redshift range of 0.4 < z < 2.0 to test the various scenarios by which galaxies evolve onto the red sequence. The data are taken from the UKIDSS Ultra Deep Survey, DEEP2, and COMBO-17. The use of clustering allows us to determine what fraction of the red sequence is made up of central galaxies and satellite galaxies. At all redshifts, including z = 0, the data are consistent with {approx}60% of satellite galaxies being red or quenched, implying that {approx}1/3 of the red sequence is comprised of satellite galaxies. More than three-fourths of red satellite galaxies were moved to the red sequence after they were accreted onto a larger halo. The constant fraction of satellite galaxies that are red yields a quenching time for satellite galaxies that depends on redshift in the same way as halo dynamical times: t{sub Q} {approx} (1 + z){sup -1.5}. In three of the four samples, the data favor a model in which red central galaxies are a random sample of all central galaxies; there is no preferred halo mass scale at which galaxies make the transition from star-forming to red and dead. The large errors on the fourth sample inhibit any conclusions. Theoretical models in which star formation is quenched above a critical halo mass are excluded by these data. A scenario in which mergers create red central galaxies imparts a weaker correlation between halo mass and central galaxy color, but even the merger scenario creates tension with red galaxy clustering at redshifts above 0.5. These results suggest that the mechanism by which central galaxies become red evolves from z = 0.5 to z = 0.

79 ASTRONOMY AND ASTROPHYSICS↗

Compressing unstructured mesh data from simulations using machine learning

The amount of data output from a computer simulation has grown to terabytes and petabytes as increasingly complex simulations are being run on massively parallel systems. As we approach exaflop computing in the next decade, it is expected that the I/O subsystem will not be able to write out these large volumes of data. In this paper, we explore the use of machine learning to compress the data before it is written out. Despite the computational constraints that limit us to using very simple learning algorithms, our results show that machine learning is a viable option for compressing unstructured data. Furthermore, we demonstrate that by simply using a better sampling algorithm to generate the training set, we can obtain more accurate results compared to random sampling, but at no extra cost. Further, by carefully selecting and incorporating points with high prediction error, we can improve reconstruction accuracy without sacrificing the compression rate.

97 MATHEMATICS AND COMPUTING↗

Deployment of salt sample extraction system at an engineering-scale electrorefiner

The goal of the salt sampling program at Argonne is to develop and deploy automated molten salt sampling approaches for interfacing relevant unit operations with salt analysis to improve the timeliness of sampling-based accountancy measurements. Two technologies under development in support of this goal are a vacuum sampling loop module and a high-throughput pneumatic sample generator module. Compared to traditional point sampling approaches (i.e., dip probes), the vacuum sampling loop facilitates the collection of a larger cross-section of the bulk salt in order to collect more representative samples. The vacuum sampling approach also eliminates the risk of dross contamination of samples and avoids the use of moving parts in the salt. The pneumatic sample generator module is used to facilitate high-throughput sample analysis to improve the measurement precision of any given analytical technique by averaging out random sampling and measurement errors. In FY21, two methods for integrating these two modules were tested including direct fluidic coupling and coupling using a solid salt transfer mechanism. Solid salt transfer was ultimately selected over fluidic coupling, primarily to enable the transport of samples over longer distances to support automated at-line integration with high-precision techniques (such as microcalorimetry) that cannot withstand the conditions near an electrorefining process. To facilitate rapid solid salt coupling, new mechanisms were developed for rapidly charging and discharging salt sample tubes at the vacuum sampling loop and pneumatic sample generator modules, respectively. While the charging mechanism will be deployed in FY22, the discharge mechanism was tested in FY21 and is described here. The solid salt tube transfer method was deployed at one of Argonne’s engineering-scale electrorefiners to implement at-line high-throughput pneumatic micro-sample generation capabilities. The approach was used to generate precise uranium- and lanthanide-bearing electrorefiner micro-samples with the specific dimensions requested by researchers at Los Alamos National Laboratory for use in testing their novel microcalorimeter x-ray techniques. The solid salt transfer mechanism proved not only to be an effective means of integrating the precision sample generator with vacuum sampling, but also improved the performance of the sampler generator. To discharge salt from the sample tubes at the sampler generator, tube segments were inserted directly into the sample generator’s Helmholtz chamber and pressure pulse actuations were used to generate precision molten salt samples directly from the tube segments. The direct insertion of sample tubes into the sample generator enabled rapid loading of the salt and prevented salt from contacting most of the interior surfaces of the sample generator, which eliminated cross-contamination between runs. The vacuum sampling-loop tube charging mechanism will support high-throughput tube sampling operations by employing a dynamic vacuum filling process to fill short charge tubes that are configured to be rapidly connected and disconnected from the loop. The dynamic vacuum sampling operation will be automated, and sample tube handling can be executed with simple overhead actuation. Because the modular sampling approach described here eliminates the need for new high-radiation sample handling capabilities, salt-wetted seals, salt-wetted moving parts, and heated transfer lines outside the electrorefiner, it will address most of the remaining technical challenges for the at-line deployment of high-precision analytical techniques which will enable significant reductions in the time delay for sampling-based high-precision accountancy measurements.

42 ENGINEERING↗

COBRA:COMPUTED-TOMOGRAPHY BASED RANDOM-FIELD APPROXIMATION

SF-25-115 COBRA (COmputed-tomography Based Random-field Approximation) is a Python application for generating statistically equivalent random fields from CT-scan imagery. It leverages Karhunen–Loève expansions to model microstructural variability, enabling users to: Preprocess CT scans (filtering and Gaussian transformation); Fit covariance kernels fromempirical data; Solve eigenproblems to obtain KL modes; Sample random fields onsistent with fitted statistics; Postprocess samples back into the physical domain.

Hu, Tianchen↗

Topology of Large-scale Structures of Galaxies in Two Dimensions—Systematic Effects

We study the two-dimensional topology of galactic distribution when projected onto two-dimensional spherical shells. Using the latest Horizon Run 4 simulation data, we construct the genus of the two-dimensional field and consider how this statistic is affected by late-time nonlinear effects—principally gravitational collapse and redshift space distortion (RSD). We also consider systematic and numerical artifacts, such as shot noise, galaxy bias, and finite pixel effects. We model the systematics using a Hermite polynomial expansion and perform a comprehensive analysis of known effects on the two-dimensional genus, with a view toward using the statistic for cosmological parameter estimation. We find that the finite pixel effect is dominated by an amplitude drop and can be made less than 1% by adopting pixels smaller than 1/3 of the angular smoothing length. Nonlinear gravitational evolution introduces time-dependent coefficients of the zeroth, first, and second Hermite polynomials, but the genus amplitude changes by less than 1% between z = 1 and z = 0 for smoothing scales R{sub G}>9 Mpc/h. Non-zero terms are measured up to third order in the Hermite polynomial expansion when studying RSD. Differences in the shapes of the genus curves in real and redshift space are small when we adopt thick redshift shells, but the amplitude change remains a significant ∼O(10%) effect. The combined effects of galaxy biasing and shot noise produce systematic effects up to the second Hermite polynomial. It is shown that, when sampling, the use of galaxy mass cuts significantly reduces the effect of shot noise relative to random sampling.

79 ASTRONOMY AND ASTROPHYSICS↗

Self-Supervised Anomaly Detection via Neural Autoregressive Flows with Active Learning

Many self-supervised methods have been proposed with the target of image anomaly detection. These methods often rely on the paradigm of data augmentation with predefined transformations such as flipping, cropping, and rotations. However, it is not straightforward to apply these techniques for non-image data, such as time series or tabular data, while the performance of the existing deep approaches has been under our expectation on tasks beyond images. In this work, we propose a novel active learning (AL) scheme that relied on neural autoregressive flows (NAF) for self-supervised anomaly detection, specifically on small-scale data. Unlike other generative models such as GANs or VAEs, flow-based models allow to explicitly learn the probability density and thus can assign accurate likelihoods to normal data which makes it usable to detect anomalies. The proposed NAF-AL method is achieved by efficiently generating random samples from latent space and transforming them into feature space along with likelihoods via invertible mapping. The samples with lower likelihoods are selected and further checked by outlier detection using Mahalanobis distance. The augmented samples incorporating with normal samples are used for training a better detector so as to approach decision boundaries. Compared with random transformations, NAF-AL can be interpreted as a likelihood-oriented data augmentation that is more efficient and robust. Extensive experiments show that our approach outperforms existing baselines on multiple time series and tabular datasets, and a real-world application in advanced manufacturing, with significant improvement on anomaly detection accuracy and robustness over the state-of-the-art.

Zhang, Jiaxin↗

Neutron and Gamma Correlations using CGM in MCNP 6.2.0

The general-purpose Monte Carlo radiation-transport code MCNP6{sup TM} came from the integration of MCNP5{sup TM} and MCNPX{sup TM}. The most recent release of MCNP, version 6.2.0, is scheduled for release in early 2017, which includes a variety of bug fixes and new features to the code. MCNP traditionally models nuclear reactions using Monte Carlo sampling techniques on measured and modeled cross-sectional data contained within ACE (A Compact Evaluated Nuclear Data File) libraries. In addition to reaction cross-sections, ACE libraries contain information relating to the production of secondary particles, such as secondary neutrons and photons. For example, an incident neutron on a nucleus can produce a nuclear reaction in the form (n, M{sub n}n'), where n is the incident neutron and M{sub n} is the number of secondary neutrons n' produced. Using this notation, different reactions can be described based on their neutron multiplicity, such as neutron capture (M{sub n} = 0), elastic and inelastic scattering (M{sub n} = 1), and reactions with multiple secondary neutrons (M{sub n} > 1). Accounting for secondary γ-rays emitted from the residual nuclei, this reaction can further be generalized as n, Mnn'M to describe a reaction producing M{sub n} neutrons and M -rays. These values M{sub n} and M are referred to as the neutron and multiplicities, respectively. ACE libraries contain the cross-sectional data for each reaction, and their corresponding statistically averaged multiplicities for neutrons and photons, M-bar{sub n} and M-bar{sub γ}. However, there are several limitations to reaction sampling using ACE libraries. First, the data contained within ACE libraries is limited by the accuracy of the model and/or experiment, which out of necessity can greatly simplify the true physics behind a reaction. For example, the value M{sub γ} in a (n, M{sub n}n'M{sub γ}γ) reaction is determined by the statistically averaged multiplicity M-bar{sub γ} instead of a distribution. Consequently, MCNP, unable to produce a continuous distribution, will utilizes a binary sampling around M-bar{sub γ}. While this sampling method provides a statistically average M{sub γ} over a large simulation, it is an inaccurate representation of an individual reaction and its corresponding secondary particles. Secondary neutrons are affected in a similar manner, such that different kinds of secondary neutrons can be sampled from the same interaction (eg., an inelastic neutron with an [n, 2n] neutron). Lastly, the random sampling technique for secondary particles remains completely independent of the sampled reaction, eliminating the ability to correlate secondary particles for a given reaction. To supplement these data libraries, additional codes and models describing certain nuclear reactions are employed. These codes can fill in the information missing from ACE, provide a better model to the true physics distribution, and can provide true correlated secondary particles, which has many useful applications in research and industry.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SOARCA Peach Bottom Atomic Power Station Long-Term Station Blackout Uncertainty Analysis: Convergence of the Uncertainty Results

This paper describes the convergence of MELCOR Accident Consequence Code System, Version 2 (MACCS2) probabilistic results of offsite consequences for the uncertainty analysis of the State-of-the-Art Reactor Consequence Analyses (SOARCA) unmitigated long-term station blackout scenario at the Peach Bottom Atomic Power Station. The consequence metrics evaluated are individual latent-cancer fatality (LCF) risk and individual early fatality risk. Consequence results are presented as conditional risk (i.e., assuming the accident occurs, risk per event) to individuals of the public as a result of the accident. In order to verify convergence for this uncertainty analysis, as recommended by the Nuclear Regulatory Commission’s Advisory Committee on Reactor Safeguards, a ‘high’ source term from the original population of Monte Carlo runs has been selected to be used for: (1) a study of the distribution of consequence results stemming solely from epistemic uncertainty in the MACCS2 parameters (i.e., separating the effect from the source term uncertainty), and (2) a comparison between Simple Random Sampling (SRS) and Latin Hypercube Sampling (LHS) in order to validate the original results obtained with LHS. Three replicates (each using a different random seed) of size 1,000 each using LHS and another set of three replicates of size 1,000 using SRS are analyzed. The results show that the LCF risk results are well converged with either LHS or SRS sampling. The early fatality risk results are less well converged at radial distances beyond 2 miles, and this is expected due to the sparse data (predominance of “zero” results).

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fast generation of sparse random kernel graphs

The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.

97 MATHEMATICS AND COMPUTING↗

diamond-sampling

This software provides a means for computing only the largest few entries of the product of two matrices, both exactly and approximately (using randomized sampling techniques). The purpose of the code is to demonstrate both the time it takes to solve the problem as well as the accuracy of the approximate approach. It is also meant to serve as a foundation to test the applicability of the sampling technique to related problems in data mining, including maximum inner product search, nearest neighbor search, and maximum cosine similarity.

Ballard, Grey↗

DOES SIZE MATTER? THE UNDERLYING INTRINSIC SIZE DISTRIBUTION OF RADIO SOURCES AND IMPLICATIONS FOR UNIFICATION BY ORIENTATION

Unification by orientation is a ubiquitous concept in the study of active galactic nuclei. A gold standard of the orientation paradigm is the hypothesis that radio galaxies and radio-loud quasars are intrinsically the same, but are observed over different ranges of viewing angles. Historically, strong support for this model was provided by the projected sizes of radio structure in luminous radio galaxies, which were found to be significantly larger than those of quasars, as predicted due to simple geometric projection. Recently, this test of the simplest prediction of orientation-based models has been revisited with larger samples that cover wider ranges of fundamental properties-and no clear difference in projected sizes of radio structure is found. Cast solely in terms of viewing angle effects, these results provide convincing evidence that unification of these objects solely through orientation fails. However, it is possible that conflicting results regarding the role orientation plays in our view of radio sources simply result from insufficient sampling of their intrinsic size distribution. We test this possibility using Monte Carlo simulations constrained by real sample sizes and properties. We develop models for the real intrinsic size distribution of radio sources, simulate observations by randomly sampling intrinsic sizes and viewing angles, and analyze how likely each sample is to support or dispute unification by orientation. We find that, while it is possible to reconcile conflicting results purely within a simple, orientation-based framework, it is very unlikely. We analyze the effects that sample size, relative numbers of radio galaxies and quasars, the critical angle that separates the two subclasses, and the shape of the intrinsic size distribution have on this type of test.

79 ASTRONOMY AND ASTROPHYSICS↗

Rapid estimation of photosynthetic leaf traits of tropical plants in diverse environmental conditions using reflectance spectroscopy

Tropical forests are one of the main carbon sinks on Earth, but the magnitude of CO 2 absorbed by tropical vegetation remains uncertain. Terrestrial biosphere models (TBMs) are commonly used to estimate the CO 2 absorbed by forests, but their performance is highly sensitive to the parameterization of processes that control leaf-level CO 2 exchange. Direct measurements of leaf respiratory and photosynthetic traits that determine vegetation CO 2 fluxes are critical, but traditional approaches are time-consuming. Reflectance spectroscopy can be a viable alternative for the estimation of these traits and, because data collection is markedly quicker than traditional gas exchange, the approach can enable the rapid assembly of large datasets. However, the application of spectroscopy to estimate photosynthetic traits across a wide range of tropical species, leaf ages and light environments has not been extensively studied. Here, we used leaf reflectance spectroscopy together with partial least-squares regression (PLSR) modeling to estimate leaf respiration ( R dark25 ), the maximum rate of carboxylation by the enzyme Rubisco ( V cmax25 ), the maximum rate of electron transport ( J max25 ), and the triose phosphate utilization rate ( T p25 ), all normalized to 25°C. We collected data from three tropical forest sites and included leaves from fifty-three species sampled at different leaf phenological stages and different leaf light environments. Our resulting spectra-trait models validated on randomly sampled data showed good predictive performance for V cmax25 , J max25 , T p25 and R dark25 (RMSE of 13, 20, 1.5 and 0.3 μmol m -2 s -1 , and R 2 of 0.74, 0.73, 0.64 and 0.58, respectively). The models showed similar performance when applied to leaves of species not included in the training dataset, illustrating that the approach is robust for capturing the main axes of trait variation in tropical species. We discuss the utility of the spectra-trait and traditional gas exchange approaches for enhancing tropical plant trait studies and improving the parameterization of TBMs.

54 ENVIRONMENTAL SCIENCES↗

i- flow: High-dimensional integration and sampling with normalizing flows

In many fields of science, high-dimensional integration is required. Numerical methods have been developed to evaluate these complex integrals. We introduce the code i-flow, a python package that performs high-dimensional numerical integration utilizing normalizing flows. Normalizing flows are machine-learned, bijective mappings between two distributions. i-flow can also be used to sample random points according to complicated distributions in high dimensions. We compare i-flow to other algorithms for high-dimensional numerical integration and show that i-flow outperforms them for high dimensional correlated integrals. The i-flow code is publicly available on gitlab at https://gitlab.com/i-flow/i-flow.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

(U) A General-Purpose Code for Correlated Sampling Using Batch Statistics with MCNP6 for Fixed-Source Problems

Correlated sampling can be used to reduce the uncertainty of a difference of tallies by taking advantage of the negative covariance term in the sandwich formula. Booth first showed how correlated sampling can be applied with batch statistics using MCNP’s tally fluctuation chart (TFC) to reduce the uncertainty of a difference of tallies in fixed-source problems. Booth presented a problem in which a 1273% uncertainty in a difference was reduced to 8% by accounting for correlations. Researchers He and Su recently studied correlated sampling using the TFC in MCNP version 5. They determined that the code did not print enough digits in the TFC tally means for accurate batch statistics in some cases. After modifying the source code, they concluded that “correlated sampling can yield a standard deviation of about one magnitude smaller than that predicted by the direct, un-correlated simulation when the changes in system response are small (say about 1%), which is equivalent to saving in CPU time by a factor of 100. Such saving [sic] becomes less significant as the change in system response becomes larger.” He and Su provided the formulas needed to apply batch statistics to compute the correlated uncertainty of a difference of tallies. In this report, we follow up on their work by providing the formulas needed to apply batch statistics to compute the correlated uncertainty of a ratio of tallies and of a difference of two tallies divided by a third tally. We extend these formulas to differences and ratios of ratios. These formulas are applied to reduce the uncertainty associated with calculating a relative sensitivity. He and Su did not investigate the accuracy of their correlated sampling uncertainty estimates. We use their test problems and evaluate the accuracy of the uncertainty estimates by comparing with results obtained from random sampling, and, in simple cases, with theoretical values of the “exact” uncertainties. We find that the uncertainties obtained from batch statistics are accurate as long as at least 100 batches are used. We present a new computer code, COSUBS (COrrelated Sampling Using Batch Statistics), that reads MCNP6 TFCs and applies correlated sampling using batch statistics for the tally combinations that the user specifies. COSUBS is a very general tool that compares all TFCs for a base case and one or two perturbed cases. It computes uncertainties for ratios if given only a base case. This report is organized as follows. The equations to apply batch statistics to the difference of random tallies are reviewed in Sec. II. Section III presents the equations for applying batch statistics to a ratio of random tallies; this is useful for computing relative sensitivities using a one-sided finite difference and the relative sensitivity using the differential operator method. Section IV presents the equations for applying batch statistics to a difference of two random tallies divided by a third; this is useful for computing a relative sensitivities using a central difference. Section V presents the equations for applying batch statistics to a difference of two ratios with four random tallies. Section VI presents the equations for applying batch statistics to a one-sided finite difference estimate of the relative sensitivity of a ratio (this uses four random tallies). Section VII presents the equations for applying batch statistics to a central difference estimate of the relative sensitivity of a ratio (this uses six random tallies). Section VIII presents the equations for applying batch statistics to a sum of random tallies. Section IX discusses how to apply batch statistics using MCNP6. Section X presents COSUBS, describing its command-line options and logic. Sections XI through XVI present numerical results for various test problems. Section XVII is a summary and conclusions. Appendix A derives the theoretical Monte Carlo tally variance given certain assumptions; these variances are used to verify the batch statistics for some of the problems. Appendix B lists the MCNP6 input for the unperturbed example problem. Appendix C presents modifications made to MCNP6.3 to support this work.

97 MATHEMATICS AND COMPUTING↗

CALiPER Retail Lamps Study 3

The CALiPER program first began investigating LED lamps sold at retail stores in 2010, purchasing 33 products from eight retailers and covering six product categories. The findings revealed a fragmented marketplace, with large disparities in performance of different products, accuracy of manufacturer claims, and offerings from different retail outlets. Although there were some good products, looking back many would not be considered viable competitors to other available options, with too little lumen output, not high enough efficacy, or poor color quality. CALiPER took another look in late 2011purchasing 38 products of five different types from nine retailers and the improvement was marked. Performance was up; retailer claims were more accurate; and the price per lumen and price per unit efficacy were down, although the price per product had not changed much. Nonetheless, there was still plenty of room for improvement, with the performance of LED lamps not yet reaching that of well-established classes of conventional lamps (e.g., 75 W incandescent A19 lamps). Since the second retail lamp study was published in early 2012, there has been substantial progress in all aspects of LED lamps available from retailers. To document this progress, CALiPER again purchased a sample of lamps from retail stores 46 products in total, focusing on A19, PAR30, and MR16 lamps but instead of a random sample, sought to select products to answer specific hypotheses about performance. These hypotheses focused on expanding ranges of LED equivalency, the accuracy of lifetime claims, efficacy and price trends, as well as changes to product designs. Among other results, key findings include: There are now very good LED options to compete with 60 W, 75 W, and 100 W incandescent A19 lamps, and 75 W halogen PAR30 lamps. MR16 lamps have shown less progress, but there are now acceptable alternatives to 35 W, 12 V halogen MR16 lamps and 50 W, 120 V halogen MR16 lamps for some applications. Other uses, such as in enclosed luminaires, may require more development. At the same price point, lamps purchased in 2013 tended to have higher output and slightly higher efficacy than in 2011 or 2010. Over 30% of the products purchased in 2013 exceeded the maximum efficacy measured in 2011 (71 lm/W), with the most efficacious product measured at 105 lm/W. There appears to be increasing consistency in color quality, with a vast majority of products having a CCT of 2700 K or 3000 K and a CRI between 80 and 85. There were also fewer poor performing products tested and more high-performing products available in 2013 than in previous years. The accuracy of equivalency and performance claims was better than in 2011, but remains a concern, with 43% of tested products failing to completely meet their equivalency claim and 20% of products failing to match the manufacturer’s performance data. Although progress has been substantial, on average LED lamps remain more expensive than other energy efficiency lighting technologies -- although some aspects can be superior. Although not universal to all product lines or all product types, the issue of insufficient lumen output from LED lamps is waning. Thus, manufacturers can focus on other issues, such as reducing cost, improving electrical/dimmer compatibility, eliminating flicker, or improving color quality. While these issues are not inherent to all products, they remain a concern for the broader market.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Adaptive Data-Driven Deep-Learning Surrogate Model for Frontal Polymerization in Dicyclopentadiene

Frontal polymerization (FP) is a self-sustaining curing process that enables rapid and energy-efficient manufacturing of thermoset polymers and composites. Computational methods conventionally used to simulate the FP process are time-consuming, and repeating simulations are required for sensitivity analysis, uncertainty quantification, or optimization of the manufacturing process. Here, in this work, we develop an adaptive surrogate deep-learning model for FP of dicyclopentadiene (DCPD), which predicts the evolution of temperature and degree of cure orders of magnitude faster than the finite-element method (FEM). The adaptive algorithm provides a strategy to select training samples efficiently and save computational costs by reducing the redundancy of FEM-based training samples. The adaptive algorithm calculates the residual error of the FP governing equations using automatic differentiation of the deep neural network. A probability density function expressed in terms of the residual error is used to select training samples from the Sobol sequence space. The temperature and degree of cure evolution of each training sample are obtained by a 2D FEM simulation. The adaptive method is more efficient and has a better prediction accuracy than the random sampling method. With the well-trained surrogate neural network, the FP characteristics (front speed, shape, and temperature) can be extracted quickly from the predicted temperature and degree-of-cure fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Milky Way mass with K giants and BHB stars using LAMOST, SDSS/SEGUE, and Gaia : 3D spherical Jeans equation and tracer mass estimator

ABSTRACT We measure the enclosed Milky Way mass profile to Galactocentric distances of ∼70 and ∼50 kpc using the smooth, diffuse stellar halo samples of Bird et al. The samples are Large Sky Area Multi-Object Fiber Spectroscopic Telescope (LAMOST) and Sloan Digital Sky Survey/Sloan Extension for Galactic Understanding and Exploration (SDSS/SEGUE) K giants (KG) and SDSS/SEGUE blue horizontal branch (BHB) stars with accurate metallicities. The 3D kinematics are available through LAMOST and SDSS/SEGUE distances and radial velocities and Gaia DR2 proper motions. Two methods are used to estimate the enclosed mass: 3D spherical Jeans equation and Evans et al. tracer mass estimator (TME). We remove substructure via the Xue et al. method based on integrals of motion. We evaluate the uncertainties on our estimates due to random sampling noise, systematic distance errors, the adopted density profile, and non-virialization and non-spherical effects of the halo. The tracer density profile remains a limiting systematic in our mass estimates, although within these limits we find reasonable agreement across the different samples and the methods applied. Out to ∼70 and ∼50 kpc, the Jeans method yields total enclosed masses of 4.3 ± 0.95 (random) ±0.6 (systematic) × 1011 M⊙ and 4.1 ± 1.2 (random) ±0.6 (systematic) × 1011 M⊙ for the KG and BHB stars, respectively. For the KG and BHB samples, we find a dark matter virial mass of $M_{200}=0.55^{+0.15}_{-0.11}$ (random) ±0.083 (systematic) × 1012 M⊙ and $M_{200}=1.00^{+0.67}_{-0.33}$ (random) ±0.15 (systematic) × 1012 M⊙, respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗