Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Random Summing”

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 19 records

Detector Calibration to Quantify Random Summing in HPGe Spectroscopy

While calibrating a High Purity Germanium (HPGe) Radiation Detector for Xenon-133 (133Xe) the process of random summing occurs which leads to excess counts in the 160.6keV peak from random summing of the 81keV photons at the 162keV energy. Multiple samples of 133Xe with varying levels of radioactivity were assayed to determine a relationship between the occurrence of random summing and the net area of the 160.6keV peak. When the calculated efficiencies in the 160.6keV peak were compared to the theoretical efficiency obtained from a multi-energy calibration at 160.6keV, the amount of random summing could be estimated as excess observed efficiency and correlated to the sample activity. While a trend is apparent in the data, the mechanisms that contribute to the trend are still being studied so the data can be accurately correlated.

07 ISOTOPE AND RADIATION SOURCES↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

(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↗

Spin structures and baby universes

We extend a 2d topological model of the gravitational path integral to include sums over spin structure, corresponding to Neveu-Schwarz (NS) or Ramond (R) boundary conditions for fermions. This path integral corresponds to a correlator of boundary creation operators on a non-trivial baby universe Hilbert space, and vanishes when the number of R boundaries is odd. This vanishing implies a non-factorization of the correlator, which necessitates a dual interpretation of the bulk path integral in terms of a product of partition functions (associated to NS boundaries) and Witten indices (associated to R boundaries), averaged over an ensemble of theories with varying Hilbert space dimension and different numbers of bosonic and fermionic states. We also consider a model with End-of-the-World (EOW) branes, for which the dual ensemble then includes a sum over randomly chosen fermionic and bosonic states. We propose two modifications of the bulk path integral which restore an interpretation in a single dual theory: (i) a geometric prescription where we add extra boundaries with a sum over their spin structures, and (ii) an algebraic prescription involving “spacetime D-branes”. We extend our ideas to Jackiw-Teitelboim gravity, and propose a dual description of a single unitary theory with spin structure in a system with eigenbranes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral form factor of a quantum spin glass

It is widely expected that systems which fully thermalize are chaotic in the sense of exhibiting random-matrix statistics of their energy level spacings, whereas integrable systems exhibit Poissonian statistics. In this paper, we investigate a third class: spin glasses. These systems are partially chaotic but do not achieve full thermalization due to large free energy barriers. We examine the level spacing statistics of a canonical infinite-range quantum spin glass, the quantum p-spherical model, using an analytic path integral approach. We find statistics consistent with a direct sum of independent random matrices, and show that the number of such matrices is equal to the number of distinct metastable configurations — the exponential of the spin glass “complexity” as obtained from the quantum Thouless-Anderson-Palmer equations. We also consider the statistical properties of the complexity itself and identify a set of contributions to the path integral which suggest a Poissonian distribution for the number of metastable configurations. Our results show that level spacing statistics can probe the ergodicity-breaking in quantum spin glasses and provide a way to generalize the notion of spin glass complexity beyond models with a semi-classical limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

System and method for obfuscation of electronic circuits

A computer-implemented method of generating randomized electrical interconnects for an electronic circuit comprises steps of receiving a netlist of nodes of electronic components to be connected, each connection between the nodes forming an electrical interconnect; determining a list of one or more path directions for each electrical interconnect; determining a plurality of path direction distances for each electrical interconnect; generating a plurality of segments for each electrical interconnect, each segment having one path direction and a length which are selected at random; calculating a sum of the lengths of all of the segments in each path direction each time a segment is generated for each electrical interconnect; removing one path direction from the list of path directions when a first condition is met; and stopping the generating a plurality of segments for each electrical interconnect when a second condition is met.

Trujillo, Joshua↗

System and method for obfuscation of electronic circuits

A computer-implemented method of generating randomized electrical interconnects for an electronic circuit comprises steps of receiving a netlist of nodes of electronic components to be connected, each connection between the nodes forming an electrical interconnect; determining a list of one or more path directions for each electrical interconnect; determining a plurality of path direction distances for each electrical interconnect; generating a plurality of segments for each electrical interconnect, each segment having one path direction and a length which are selected at random; calculating a sum of the lengths of all segments of the plurality of segments in each path direction each time a segment is generated for each electrical interconnect; removing one path direction from the list of path directions when a first condition is met; and stopping the generating a plurality of segments for each electrical interconnect when a second condition is met.

Trujillo, Joshua↗

A Bayesian model for multivariate discrete data using spatial and expert information with application to inferring building attributes

When modeling sparsely observed multivariate data, strong prior information elicited from experts can be used to bolster predictive accuracy and counteract sampling bias. Similarly, modeling autocorrelation in space can help make use of co-occurrence patterns present in many types of spatial data. To make use of both expert prior information and spatial structure, we propose a novel graphical model for a spatial Bayesian network developed specifically to address challenges in inferring the attributes of buildings from geographically sparse observational data. This model is implemented as the sum of a spatial multivariate Gaussian random field and a tabular conditional probability function in real-valued space prior to projection onto the probability simplex. This modeling form is especially suitable for the usage of prior information in the form of sets of atomic rules obtained from experts. To perform inference with missing data, we implement a Markov chain Monte Carlo scheme composed of alternating steps of Gibbs sampling of missing entries and Hamiltonian Monte Carlo for model parameters. A case study in building attribution is presented to highlight the advantages and limitations of this approach.

97 MATHEMATICS AND COMPUTING↗

(U) Correlated Sampling Using Batch Statistics to Reduce the Uncertainty of Combinations of KSEN Outputs with MCNP6

The relative sensitivity of k eff to the densities of nuclides in a material are combined to compute relative sensitivities to other inputs. When computed in a single Monte Carlo run, the nuclide density sensitivities are correlated, and the statistical uncertainties propagated to other inputs will be incorrect unless those correlations are accounted for. Equations are presented to apply correlated sampling using batch statistics for the sum of an arbitrary number of random tallies and the difference of two random tallies when each is multiplied by a different constant. When correlated sampling is used on a recent benchmark evaluation, the correct statistical uncertainties for certain combinations of sensitivities are dramatically smaller than the incorrect uncertainties. A user-controlled, regular output of MCNP6’s KSEN sensitivities that allows batch statistics to be applied to combinations would be extremely valuable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Angular Correlation Date Measurements with the GeRMAC system

Advanced modeling and simulation efforts have improved at Idaho National Laboratory in recent years with a solid foundation of experimental results. Current computational methods represent significant modeling capabilities but are limited by the accuracy and availability of nuclear data. The creation of pre- and post-processing software tools to address these limitations is fundamental to the improvement of nuclear science modeling capacities. One aspect of predictive modeling tools deals with gamma-rays emitted from radionuclides, including fissile or fissionable material, fission products, or activation products, produced in reactor experiments or other neutron environments. The resulting radionuclides decay in unique ways, providing complications upon measurement as a result of random and cascade, or true, coincidence summing. These effects are not easily quantified during modeling efforts of gamma-ray source terms., The germanium rotational measurements for angular correlation (GeRMAC) system was built to quantify the relative angles for gamma rays emitted by radionuclides of interest to investigate true coincidence, or cascade, summing as well as the nuclear energy levels of decay schemes of interest. Proof of concept studies utilize a series of laboratory check sources to provide validity, and it will soon be used to perform the same measurements for fission products of interest. The resulting data can be used to implement into a Monte Carlo code, such as Geant4, to provide more precise gamma-ray source terms following irradiations of materials.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Differentiable Quantum Programming with Unbounded Loops

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Existing work has formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q# and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

Computer Science↗

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗

JWST Noise Floor. I. Random Error Sources in JWST NIRCam Time Series

James Webb Space Telescope (JWST) transmission and emission spectra will provide invaluable glimpses of transiting exoplanet atmospheres, including possible biosignatures. This promising science from JWST, however, will require exquisite precision and understanding of systematic errors that can impact the time series of planets crossing in front of and behind their host stars. Here, we provide estimates of the random noise sources affecting JWST Near-Infrared Camera (NIRCam) time-series data on the integration-to-integration level. We find that 1/f noise can limit the precision of grism time series for two groups (230–1000 ppm depending on the extraction method and extraction parameters), but will average down like the square root of N frames/reads. The current NIRCam grism time-series mode is especially affected by 1/f noise because its GRISMR dispersion direction is parallel to the detector fast-read direction, but could be alleviated in the GRISMC direction. Care should be taken to include as many frames as possible per visit to reduce this 1/f noise source: thus, we recommend the smallest detector subarray sizes one can tolerate, four output channels, and readout modes that minimize the number of skipped frames (RAPID or BRIGHT2). We also describe a covariance-weighting scheme that can significantly lower the contributions from 1/f noise as compared to sum extraction. We evaluate the noise introduced by pre-amplifier offsets, random telegraph noise, and high dark current resistor capacitor (RC) pixels and find that these are correctable below 10 ppm once background subtraction and pixel masking are performed. We explore systematic error sources in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Transverse Enhancement, Longitudinal Quenching and Coulomb Sum Rule in e-$^{12}$C and e-$^{16}$O Scattering

We present a short summary of a phenomenological analysis of all available electron scattering data on 12 C 12 C (about 6600 differential cross section measurements) and on 16 O 16 O (about 250 measurements) within the framework of the quasielastic superscaling model (including Pauli blocking). All quasielastic and inelastic cross section measurements are included down to the lowest momentum transfer ? q (including photo-production data). We find that there is enhancement of the transverse quasielastic response function and quenching of the longitudinal response function at low ? q (in addition to Pauli blocking). We extract parameterizations of a ? ? ? ? ? ? ? ? ? ? ? ? ? ? multiplicative low ? q "Longitudinal Quenching Factor" and an ? ? ? ? ? ? ? ? additive "Transverse Enhancement" contribution. Additionally, we find that the excitation of nuclear states contribute significantly (up to 30\%) to the Coulomb Sum Rule. We extract the most accurate determination of the sum rule to date and find it to be in disagreement with random phase approximation based calculations but in reasonable agreement with recent theoretical calculations such as "First Principle Green's Function Monte Carlo".

Bodek, Arie↗

The Role of Nuclear Data Sensitivities in Prompt α-Eigenvalue Predictions of Delayed Critical Benchmarks

Alpha (α) eigenvalues, which describe the logarithmic time derivative of the neutron population in a multiplying system, are integral to time-dependent behavior and diagnostic applications. However, uncertainties in the evaluated nuclear data can significantly impact the accuracy of transport simulations for such quantities. This work explores the use of machine learning models to predict two key outputs, α-eigenvalues and keff bias, using input features derived from α-eigenvalue sensitivities to nuclear data. The criticality safety benchmark models used in this study come from the International Handbook of Evaluated Criticality Safety Benchmark Experiments. Three models, random forest, XGBoost, and NGBoost, are trained on both energy-resolved and energy-summed α sensitivities. For the α-eigenvalue bias prediction, NGBoost achieved the highest R 2 (0.9476) using energy-resolved features, while XGBoost performed best using summed sensitivities. In contrast, when predicting the keff bias, all the models showed moderate predictive capability (best R 2 ≈ 0.72), as the mapping from the static α-sensitivities to the static keff bias was less direct. SHAP (SHapley Additive exPlanations) analysis was used to interpret the model predictions. Across both prediction tasks, the features associated with neutron capture [H-1 (n, γ)], uranium scattering reactions (such as 235 U elastic/inelastic), and actinide capture/fission reactions (such as 239 Pu and 234 U) were consistently identified as the most impactful. This highlights the key role of specific nuclear reactions and energy ranges in shaping both time-dependent and steady-state criticality behavior. These results demonstrated that α-sensitivities, despite being computed for time-dependent metrics, can provide valuable insights for predicting both α-eigenvalues and the keff bias. Moreover, machine learning models offer a promising pathway for uncovering important nuclear data dependencies and guiding future data evaluation efforts.

Nuclear data↗

Random quasi-phase-matching for pulse characterization from the near to the long wavelength infrared

Experiments requiring ultrafast laser pulses require a full characterization of the electric field to glean meaning from the experimental data. Such characterization typically requires a separate parametric optical process. As the central wavelength range of new sources continues to increase so too does the need for nonlinear crystals suited for characterizing these wavelengths. Here we report on the use of poly-crystalline zinc selenide as a universal nonlinear crystal in the frequency resolved optical gating characterization technique from the near to long-wavelength infrared. Due to its property of random quasi-phase-matching it’s capable of phase matching second-harmonic and sum-frequency generation of ultra-broadband pulses in the near and long wavelength infrared, while being crystal orientation independent. With the majority of ultra-fast laser sources being in this span of wavelengths, this work demonstrates a greatly simplified approach towards ultra-fast pulse characterization spanning from the near to the long-wavelength infrared. To our knowledge there is no single optical technique capable of such flexible capabilities.

Davis, Brandin (ORCID:0000000166964548)↗