Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Emulation of seismic-phase traveltimes with machine learning

SUMMARY We present a machine learning (ML) method for emulating seismic-phase traveltimes that are computed using a global-scale 3-D earth model and physics-based ray tracing. Accurate traveltime predictions based on 3-D earth models are known to reduce the bias of event location estimates, increase our ability to assign phase labels to seismic detections and associate detections to events. However, practical use of 3-D models is challenged by slow computational speed and the unwieldiness of pre-computed lookup tables that are often large and have prescribed computational grids. In this work, we train a ML emulator using pre-computed traveltimes, resulting in a compact and computationally fast way to approximate traveltimes that are based on a 3-D earth model. Our model is trained using approximately 850 million P-wave traveltimes that are based on the global LLNL-G3D-JPS model, which was developed for more accurate event location. The training-set consists of traveltimes between 10 393 global seismic stations and randomly sampled event locations that provide a prescribed, distance-dependent geographic sample density for each station. Prediction accuracy is dependent on event-station distance and whether the station was included in the training set. For stations included in the training set the mean absolute deviation (MAD) of the difference between traveltimes computed using ray tracing through the 3-D model and the ML emulator for local, regional, and teleseismic distances are 0.090, 0.125 and 0.121 s, respectively. For tested station locations not included in the training set, MAD values for the three distance ranges increase to 0.173, 0.219 and 0.210 s, respectively. Empirical traveltime residuals for a global reference data are indistinguishable when ML emulation or the 3-D model is used to compute traveltimes. This result holds regardless of whether the recording station is used in ML training or not.

58 GEOSCIENCES↗

Is Terzan 5 the remnant of a building block of the Galactic bulge? Evidence from APOGEE

ABSTRACT It has been proposed that the globular cluster-like system Terzan 5 is the surviving remnant of a primordial building block of the Milky Way bulge, mainly due to the age/metallicity spread and the distribution of its stars in the α–Fe plane. We employ Sloan Digital Sky Survey data from the Apache Point Observatory Galactic Evolution Experiment to test this hypothesis. Adopting a random sampling technique, we contrast the abundances of 10 elements in Terzan 5 stars with those of their bulge field counterparts with comparable atmospheric parameters, finding that they differ at statistically significant levels. Abundances between the two groups differ by more than 1σ in Ca, Mn, C, O, and Al, and more than 2σ in Si and Mg. Terzan 5 stars have lower [α/Fe] and higher [Mn/Fe] than their bulge counterparts. Given those differences, we conclude that Terzan 5 is not the remnant of a major building block of the bulge. We also estimate the stellar mass of the Terzan 5 progenitor based on predictions by the Evolution and Assembly of GaLaxies and their Environments suite of cosmological numerical simulations, concluding that it may have been as low as ∼3 × 108 M⊙ so that it was likely unable to significantly influence the mean chemistry of the bulge/inner disc, which is significantly more massive (∼1010 M⊙). We briefly discuss existing scenarios for the nature of Terzan 5 and propose an observational test that may help elucidate its origin.

79 ASTRONOMY AND ASTROPHYSICS↗

The Adaptive Potential of the Middle Domain of Yeast Hsp90

Abstract The distribution of fitness effects (DFEs) of new mutations across different environments quantifies the potential for adaptation in a given environment and its cost in others. So far, results regarding the cost of adaptation across environments have been mixed, and most studies have sampled random mutations across different genes. Here, we quantify systematically how costs of adaptation vary along a large stretch of protein sequence by studying the distribution of fitness effects of the same ≈2,300 amino-acid changing mutations obtained from deep mutational scanning of 119 amino acids in the middle domain of the heat shock protein Hsp90 in five environments. This region is known to be important for client binding, stabilization of the Hsp90 dimer, stabilization of the N-terminal-Middle and Middle-C-terminal interdomains, and regulation of ATPase–chaperone activity. Interestingly, we find that fitness correlates well across diverse stressful environments, with the exception of one environment, diamide. Consistent with this result, we find little cost of adaptation; on average only one in seven beneficial mutations is deleterious in another environment. We identify a hotspot of beneficial mutations in a region of the protein that is located within an allosteric center. The identified protein regions that are enriched in beneficial, deleterious, and costly mutations coincide with residues that are involved in the stabilization of Hsp90 interdomains and stabilization of client-binding interfaces, or residues that are involved in ATPase–chaperone activity of Hsp90. Thus, our study yields information regarding the role and adaptive potential of a protein sequence that complements and extends known structural information.

Cote-Hammarlof, Pamela A.↗

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

Aspects of propagator sparsening in lattice QCD

In lattice field theory, field sparsening aims to replace quantum fields, or objects constructed from them, with approximations that preserve the appropriate symmetries and maintain many aspects of the physics that the fields determine. For example, an effective sparsening of a quark propagator provides an efficient map from a quark propagator on a fine lattice geometry to a quark propagator defined on a coarser geometry in order to reduce storage and computational costs of subsequent calculational stages while maintaining long-distance correlations and corresponding low-energy physical information. Previous studies have focused on decimating lattice sites or randomly sampling lattice sites to reduce the size of the propagator and subsequent costs of Wick contractions. Here, we extend the study of sparsening to incorporate covariant averaging of spatial sites and examine the effects on two-point and three-point correlation functions involving various hadrons. We find that sparsening is most effective in reproducing the unsparsened versions of these correlation functions when weighted covariant-averaging is sequentially applied many times.

Lattice QCD↗

Mitigating Catastrophic Forgetting in Deep Learning in a Streaming Setting Using Historical Summary

Recent advancements in scientific equipment and the adaptation of electronics and the Internet of Things (IoT) in our everyday lives resulted in large and complex data production at a high rate. Making meaningful and timely knowledge discovery at a modest cost from this big data is difficult for computing power and storage limitations. Training deep learning models incrementally in a streaming setting can help us with overcoming these limitations. However, in a well-known phenomenon named catastrophic forgetting, incrementally trained models increasingly perform poorly on the past data. To mitigate catastrophic forgetting in training in a streaming setting, we propose constructing a historical summary over time and use the summary with newly arrived data during incremental training. We propose various data summarization techniques such as random sampling, micro clustering, coreset computation, and Auto Encoders to counteract catastrophic forgetting. We built a pipeline for incremental training with a historical summary for training deep learning models for streaming data. We demonstrate the effectiveness of historical summary in mitigating catastrophic forgetting using three case studies involving three different deep learning applications: an Artificial Neural Network (ANN) for classification task on MNIST dataset, a language model (RNN-LM) on the WikiText2 dataset, and a Convolutional Neural Network (CNN), ResNet50 to classify the ImageNet dataset. Through the training of the models, we observe that catastrophic forgetting is evident in ANN and CNN but not in an RNN. For the first task, our method recovers up to 47.9% lost accuracy due to catastrophic forgetting. For the third task, the historical summary recovers classification accuracy by up to 25%. For the second task, though there is not proof of catastrophic forgetting, the training performance (PPL) improves by up to 26% with historical summary.

Dash, Sajal↗

Soybean ( Glycine max ) Haplotype Map (GmHapMap): a universal resource for soybean translational and functional genomics

Here, we describe a worldwide haplotype map for soybean (GmHapMap) constructed using whole-genome sequence data for 1007 Glycine max accessions and yielding 14.9 million variants as well as 4.3 M tag single-nucleotide polymorphisms (SNPs). When sampling random subsets of these accessions, the number of variants and tag SNPs plateaued beyond approximately 800 and 600 accessions, respectively. This suggests extensive coverage of diversity within the cultivated soybean. GmHapMap variants were imputed onto 21 618 previously genotyped accessions with up to 96% success for common alleles. A local association analysis was performed with the imputed data using markers located in a 1-Mb region known to contribute to seed oil content and enabled us to identify a candidate causal SNP residing in the NPC1 gene. We determined gene-centric haplotypes (407 867 GCHs) for the 55 589 genes and showed that such haplotypes can help to identify alleles that differ in the resulting phenotype. Finally, we predicted 18 031 putative loss-of-function (LOF) mutations in 10 662 genes and illustrated how such a resource can be used to explore gene function. The GmHapMap provides a unique worldwide resource for applied soybean genomics and breeding.

54 ENVIRONMENTAL SCIENCES↗

Stochastic Gradients for Large-Scale Tensor Decomposition

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Tidal Disruption Event Galaxy Binner

This software simulates astronomical survey detections of tidal disruptions of stars by super-massive black holes. It begins with the synthetic galaxy catalogue described in van Velzen 2008 (https://arxiv.org/abs/1707.03458). The stellar disruption rate in each galaxy is estimated based on Stone & Metzger 2016 (https://arxiv.org/abs/1410.7772). Based on these rates, and the present-day stellar mass function in the galaxy, disruptions are randomly sampled, and the properties of the resulting flares are sampled based on empirical distributions. The code also accounts for obscuration by dust in the host galaxy. Finally, the survey selection effects are applied. The detectable simulated flares are stored in a database, allowing histograms of their properties to be created.

Roth, NathanielJ.↗

Reliability of Open Public Electric Vehicle Direct Current Fast Chargers

The aim was to systematically evaluate the usability of all public electric vehicles (EV) direct current fast chargers (DCFC) in the San Francisco region. To achieve a rapid transition to EVs, a highly reliable and easy to use charging infrastructure is critical to building confidence among consumers. The functionality and usability of all 182 open, public DCFC charging stations with CCS connectors (combined charging system) in the 9 counties of the Bay Area were tested (655 electric vehicle service equipment (EVSE) ports). An EVSE was classified as functional if it charged an EV for 2 minutes. Overall, 73.3% of the 655 EVSEs were functional. The causes of the nonfunctioning EVSEs (23.5%) were blank or unresponsive screens or error messages; payment system failures; charge initiation failures; network failures; or broken connectors. In addition, the cable was too short to reach the EV inlet for 3.2% of the EVSEs. A random sampling of 10% of the EVSEs, approximately 8 days after the first evaluation, found no overall change in functionality. The level of functionality found with field testing conflicts with the 95–98% uptime reported by the EV service providers (EVSPs) who operate the EV charging stations. There is a need for precise and verifiable definitions of uptime, downtime, and excluded time, as applied to public EV chargers. In conclusion, the level of failure of the existing public EV DCFC charge infrastructure highlights the importance of improving the system design and maintenance to improve adoption of EVs.

33 ADVANCED PROPULSION SYSTEMS↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

COVID-19 prevention at institutions of higher education, United States, 2020–2021: implementation of nonpharmaceutical interventions

Background, In early 2020, following the start of the coronavirus disease 2019 (COVID-19) pandemic, institutions of higher education (IHEs) across the United States rapidly pivoted to online learning to reduce the risk of on-campus virus transmission. We explored IHEs’ use of this and other nonpharmaceutical interventions (NPIs) during the subsequent pandemic-affected academic year 2020–2021. Methods, From December 2020 to June 2021, we collected publicly available data from official webpages of 847 IHEs, including all public (n = 547) and a stratified random sample of private four-year institutions (n = 300). Abstracted data included NPIs deployed during the academic year such as changes to the calendar, learning environment, housing, common areas, and dining; COVID-19 testing; and facemask protocols. We performed weighted analysis to assess congruence with the October 29, 2020, US Centers for Disease Control and Prevention (CDC) guidance for IHEs. For IHEs offering ≥50% of courses in person, we used weighted multivariable linear regression to explore the association between IHE characteristics and the summated number of implemented NPIs. Results, Overall, 20% of IHEs implemented all CDC-recommended NPIs. The most frequently utilized NPI was learning environment changes (91%), practiced as one or more of the following modalities: distance or hybrid learning opportunities (98%), 6-ft spacing (60%), and reduced class sizes (51%). Additionally, 88% of IHEs specified facemask protocols, 78% physically changed common areas, and 67% offered COVID-19 testing. Among the 33% of IHEs offering ≥50% of courses in person, having < 1000 students was associated with having implemented fewer NPIs than IHEs with ≥ 1000 students. Conclusions, Only 1 in 5 IHEs implemented all CDC recommendations, while a majority implemented a subset, most commonly changes to the classroom, facemask protocols, and COVID-19 testing. IHE enrollment size and location were associated with degree of NPI implementation. Additional research is needed to assess adherence to NPI implementation in IHE settings.

59 BASIC BIOLOGICAL SCIENCES↗

Designing an Optimal Sensor Network via Minimizing Information Loss

Optimal experimental design is a classic topic in statistics, with many well-studied problems, applications, and solutions. The design problem we study is the placement of sensors to monitor spatiotemporal processes, explicitly accounting for the temporal dimension in our modeling and optimization. We observe that recent advancements in computational sciences often yield large datasets based on physics-based simulations, which are rarely leveraged in experimental design. We introduce a novel model-based sensor placement criterion, along with a highly-efficient optimization algorithm, which integrates physics-based simulations and Bayesian experimental design principles to identify sensor networks that “minimize information loss” from simulated data. Our technique relies on sparse variational inference and (separable) Gauss-Markov priors, and thus may adapt many techniques from Bayesian experimental design. We validate our method through a case study monitoring air temperature in Phoenix, Arizona, using state-of-the-art physics-based simulations. Our results show our framework to be superior to random or quasi-random sampling, particularly with a limited number of sensors. We conclude by discussing practical considerations and implications of our framework, including more complex modeling tools and real-world deployments.

54 ENVIRONMENTAL SCIENCES↗

Long Term Per-Component Power and Thermal Measurements of the OLCF Summit System

As we move into the exascale era, the power and energy footprints of high-performance computing (HPC) systems have grown significantly larger. Due to the harsh power and thermal conditions the system, components are exposed to extreme operating conditions. Operation of such modern HPC systems requires deep insights into long term system behavior to maintain its efficiency as well as its longevity. To help the HPC community to gain such insights, we provide a dataset that records the long-term power and thermal behavior of the 200PF pre-exascale supercomputer at the Oak Ridge Leadership Computing Facility (OLCF), Summit. This system is an IBM AC922 based system that has 9,252 IBM Power9 CPUs and 27,756 Nvidia V100 GPUs and can consume up to 13MW power at peak. Heat removal is performed using medium temperature direct liquid cooling and rear-door heat exchanger based secondary cooling loop. Originally extracted from a high-resolution (1Hz) per-component (GPUs, CPUs) measurements from the system, we primarily provide a dataset that has 10-second and 1-minute mean power and thermal measurements selected from five month-long segments over the course of 2020 (January and August), 2021 (February and August), and 2022 (January). For convenience, we also provide various sub datasets randomly sampled from the time and space (hosts) of the cluster. Further details and example code for analysis can be found in the following GitHub repository: https://github.com/at-aaims/summit_power_and_thermal_data

97 MATHEMATICS AND COMPUTING↗

Proposal and application of ROM-Lasso method for sensitivity coefficient evaluation

We propose a novel method for evaluating sensitivity coefficients of neutronics parameters to cross sections, so-called the reduced-order modeling technique ROM-Lasso. In this method, cross sections of interest are randomly sampled, and corresponding perturbed core analyses are performed. Then, the sensitivity coefficient vector of the higher-level model is expanded via the active subspace bases obtained with the lower-level model whose dimensional complexity is smaller than that of the higher-level model, and the expansion coefficients are estimated by the Lasso regression. A unique feature of the ROM-Lasso method allows the use of different bases optimized for each neutronics parameter. We conducted a verification calculation for an accelerator-driven system and demonstrated that the ROM-Lasso method can reproduce the sensitivity coefficients with a much smaller number of forward calculations than the direct method. The proposed method can be used to practically evaluate sensitivity coefficients. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Description and Use of SCALE Sampler Parametric Capability for Engineering Analysis and Optimization

The Sampler sequence was introduced into the SCALE nuclear modeling and simulation suite in SCALE 6.2 to perform uncertainty quantification via random sampling of nuclear data, material number densities, and dimensions. Sampler was expanded with the introduction of a parametric capability in SCALE 6.2.2. This paper discusses input for the Sampler parametric sequence and presents two case studies of analyses performed using the sequence. These case studies include preconceptual design of a package for transporting high assay low-enriched uranium (HALEU) oxide and scoping calculations to support subcritical limit development for a future update of the ANSI/ANS-8.1 (ANS-8.1) standard. The parametric capability within Sampler provides many benefits to analysts. For instance, parametric sweeps are frequently used to identify optimum parameter values as part of safety analysis or system design, but such sweeps can require substantial engineering time or may rely on custom-written scripts or scripts such as Write One, Run Many (or WORM) developed outside of any software quality assurance program. With the parametric capabilities in Sampler, however, a large number of inputs can be generated automatically without recourse to scripting by individual analysts. The parametric capability can also be used in lieu of the CSAS5S search sequence to identify optimum parameters more simply with straightforward inputs and outputs. Sampler can also be used to calculate input parameters from engineering specifications. For example, diameters can be converted to radii, or masses can be used to calculate number densities. Overall, the Sampler parametric capability provides a robust feature within SCALE, eliminating the need for user-developed scripting.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ptychographic wavefront characterization for single-particle imaging at x-ray lasers

A well-characterized wavefront is important for many x-ray free-electron laser (XFEL) experiments, especially for single-particle imaging (SPI), where individual biomolecules randomly sample a nanometer region of highly focused femtosecond pulses. We demonstrate high-resolution multiple-plane wavefront imaging of an ensemble of XFEL pulses, focused by Kirkpatrick–Baez mirrors, based on mixed-state ptychography, an approach letting us infer and reduce experimental sources of instability. From the recovered wavefront profiles, we show that while local photon fluence correction is crucial and possible for SPI, a small diversity of phase tilts likely has no impact. Our detailed characterization will aid interpretation of data from past and future SPI experiments and provides a basis for further improvements to experimental design and reconstruction algorithms.

47 OTHER INSTRUMENTATION↗

Transit Rider/Travel Behavior Inventory Survey - Minneapolis-St. Paul Metro - 1990

The 1990 transit on-board survey aimed to update the 1988 survey, which was conducted as part of the Preliminary Engineering Study for the Hennepin County Light Rail Transit System. The 1988 study received Regional Transit Board funding, and survey results could be applied to a mode split model for projecting ridership on the proposed Light Rail Transit System. However, this survey was designed with the 1990 Travel Behavior Inventory in mind. The intention had been to update the 1988 survey in 1990 to be compatible with the 1990 Travel Behavior Inventory data. The results of the 1990 survey were used primarily to create a table of observed transit trips between each of the 1,200 traffic analysis zones in the region. This trip table was used to calibrate a new mode split model, which estimated future year travel by mode. The 1990 update survey focused on new routes and routes that had changed significantly since 1988. To preserve compatibility with the 1988 survey, the same survey questionnaire card was used, together with the same survey procedures for data collection. The procedures randomly sampled bus patrons during the transit trip, asking key questions about the patron and the transit trip. The survey card was intended for patrons to fill out quickly so it could be completed during the transit trip. The questions focused on conditions that have proven over time to significantly influence ridership. In all, a total of 20,126 valid survey records were processed. Adding surrogate trips, the survey data file is composed of a total of 27,159 trip records . About 10% of the records were filled out by persons who had answered more than one questionnaire.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗