Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compiler optimization”

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.

244 records · Page 14

Italian prototype building models for urban scale building performance simulation

Urban building energy modeling (UBEM) seeks to evaluate strategies to optimize building energy use at urban scale to support a city's building energy goals. Prototype building models are usually developed to represent typical urban building characteristics of a specific use type, construction year, and climate zone, as detailed characteristics of individual buildings at urban scale are difficult to obtain. This study investigated the Italian building stock, developing 46 building prototypes, based on construction year, for residential and office buildings. The study included 16 single-family buildings, 16 multi-family buildings, and 14 office buildings. Building envelope properties and heating, ventilation, and air conditioning system characteristics were defined according to existing building energy codes and standards for climatic zone E, which covers about half the Italian municipalities. Novel contributions of this study include (1) detailed specifications of prototype building energy models for Italian residential and office buildings that can be adopted by UBEM tools, and (2) a dataset in GeoJSON format of Italian urban buildings compiled from diverse data sources and national standards. Finally, the developed prototype building specifications, the building dataset, and the workflow can be applied to create other building prototypes and to support Italian national building energy efficiency and environmental goals.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗

Assessing hydrogen supply chains: An integrated review of leakage and energy efficiency studies

This paper examines hydrogen leakage and efficiency across the supply chain for liquid, gaseous, and mixed hydrogen systems. These factors are crucial for assessing hydrogen's role in mitigating emissions and facilitating a clean energy transition. Drawing on a comprehensive review of existing literature and model-based analysis, the study compiles leakage rates and efficiency metrics at each stage of the supply chain: production, storage, transmission, distribution, and end-use. These data inform system scenarios that estimate the impact of leakage on overall performance and climate benefits. The analysis also identifies persistent data gaps, particularly for liquid and mixed system configurations, and outlines priorities for future research. A comparison of hydrogen system types shows that gaseous pathways generally achieve the highest efficiencies (28 %–39 %) and the lowest leakage rates (∼4.5 %) across the supply chain. Liquid hydrogen systems, while favorable for long-distance and high-volume transport due to their higher energy density, exhibit lower efficiency (∼28 %) and a greater leakage potential (∼12 %). Mixed systems, which combine gaseous and liquid elements (e.g., pipeline transmission followed by liquefaction and truck distribution), show compounded energy losses and moderate-to-high leakage rates (6.8 %–9.4 %), highlighting trade-offs associated with added system complexity. The study highlights opportunities for technological advancements, including optimizing liquefaction, enhancing insulation for storage and transportation, and refining refueling equipment. These improvements are crucial for maximizing the climate benefits of hydrogen. The results offer actionable insights for researchers, industry, and policymakers working to develop low-leakage, high-efficiency hydrogen infrastructure.

08 HYDROGEN↗

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗

Plastic additives in the ocean: Use of a comprehensive dataset for meta-analysis and method development

In excess of 13,000 chemicals are added to plastics (‘additives’) to improve performance, durability, and production of plastic products. They are categorized into numerous chemical classes including flame retardants, light stabilizers, antioxidants, and plasticizers. While research on plastic additives in the marine environment has increased over the past decade, there is a lack of methodological standardization. To direct future measurement of plastic additives, we compiled a first-of-its-kind dataset of literature assessing plastic additives in marine environments, delineated by sample type (plastic debris, seawater, sediment, biota). Using this dataset, we performed a meta-analysis to summarize the state of the science. Currently, our dataset includes 217 publications published between 1978 and May 2023. The majority of publications analyzed plastic additives in biota collected from Europe and Asia. Analyses concentrated on plasticizers, brominated flame retardants, and bisphenols. Common sample preparation techniques included Solvent - Agitation extraction for plastic, sediment, and biota samples, and Solid Phase Extraction for seawater samples with dichloromethane and solvent mixtures including dichloromethane as the organic extraction solvent. Finally, most analyses were performed utilizing gas chromatography/mass spectrometry. There are a variety of data gaps illuminated by this meta-analysis, most notably the small number of compounds that have been targeted for detection compared to the large number of additives used in plastic production. The provided dataset facilitates future investigation of trends in plastic additive concentration data in the marine environment (allowing for comparison to toxicity thresholds) and acts as a starting point for optimizing and harmonizing plastic additive analytical methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatial biases of information influence global estimates of soil respiration: how can we improve global predictions?

Soil respiration (Rs), the efflux of CO2 from soils to the atmosphere, is a major component of the terrestrial carbon cycle, but is poorly constrained from regional to global scales. The global soil respiration database (SRDB) is a compilation of in-situ Rs observations from around the globe that has been consistently updated with new measurements over the past decade. It is unclear whether the addition of data to new versions of the SRDB has produced better-constrained global Rs estimates. We compared two versions of the SRDB (v3.0 n=5173 and v5.0 n=10366) to determine how additional data influenced the global sum and uncertainty of Rs as predicted by a quantile regression forest model. A model parameterized using SRDBv3 yielded a global Rs sum of 88.6 Pg C yr-1, and associated uncertainty of 29.9 (mean absolute error) and 57.9 (standard deviation) Pg C yr-1, whereas parameterization using SRDBv5 yielded 96.5 Pg C yr-1 and associated uncertainty of 30.2 (mean average error) and 73.4 (standard deviation) Pg C yr-1. Empirically estimated global heterotrophic respiration (Rh) from v3 and v5 were 49.9-50.2 (mean 50.1) and 53.3-53.5 (mean 53.4) Pg C yr-1, respectively. Interestingly, SRDBv5’s inclusion of new data from underrepresented regions (e.g., Asia, Africa, South America) thus resulted in overall higher model uncertainty. The SRDBv5 is still biased towards northern latitudes and temperate zones, so we tested that an optimized global distribution of Rs measurements resulted in a global sum of 96.4 ± 21.4 Pg C yr-1 and lower model uncertainty. These results support current global estimates of Rs but highlight spatial inconsistencies that influence model parameterization and interpretation that should be addressed to improve regional- to global-scale predictions.

Stell, Emma↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

Data for Determining Spatially Varying Profit-Maximizing Management Practices for Miscanthus and Switchgrass Production in the Rainfed United States

The compiled datasets include county-level variables used for simulating miscanthus and switchgrass production in 2287 counties across the rainfed US including 5-year (2012-2016) averaged growing season degree days (GDD), 5-year (2012-2016) averaged growing season cumulative precipitation, National Commodity Crop Productivity Index (NCCPI) values, regional dummies (only for miscanthus), the regional-level random effect of the yield response function, N price, land cash rent, the first year fixed cost (only for switchgrass), and separate datasets for simulating an alternative model assuming a constant N rate. The GAMS codes are used to run the simulation to obtain the main results including the age-varying profit-maximizing N rate, biomass yields, and annual profits for miscanthus and switchgrass production across counties in the rainfed US. The STATA codes are used to merge and analyze simulation results and create summary statistics tables and key figures.

Age↗

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗