Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “I CODES”

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 91 records · Page 5

Best practices for building energy codes compliance

Building energy codes are a proven policy mechanism to achieve economy-wide energy savings in buildings. In 2021, the International Energy Agency Energy in Buildings and Communities Programme (IEA EBC) Building Energy Codes Working Group (BECWG) set out to survey the diverse codes compliance practices across BECWG member countries. While codes vary in format and approach, attaining the energy reduction potential of building energy codes requires effective implementation and compliance. This is a large undertaking for countries, as effective compliance checking requires adequate resources, technical knowledge, capacity, and strong institutions. Many nations face the same compliance issues, such as requiring faster and easier methods to verify codes and coordinating among numerous stakeholders and levels of government. This paper explores the need for stronger institutional approaches to enforce building energy codes that will lead to code compliance. Specifically, this report sets out to address the question of what practices result in effective building energy code compliance in selected BECWG member countries.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Do Programmers Prefer Predictable Expressions in Code?

Source code is a form of human communication, albeit one where the information shared between the programmers reading and writing the code is constrained by the requirement that the code executes correctly. Programming languages are more syntactically constrained than natural languages, but they are also very expressive, allowing a great many different ways to express even very simple computations. Still, code written by developers is highly predictable, and many programming tools have taken advantage of this phenomenon, relying on language model surprisal as a guiding mechanism. Additionally, while surprisal has been validated as a measure of cognitive load in natural language, its relation to human cognitive processes in code is still poorly understood. In this paper, we explore the relationship between surprisal and programmer preference at a small granularity—do programmers prefer more predictable expressions in code? Using meaning-preserving transformations, we produce equivalent alternatives to developer-written code expressions and run a corpus study on Java and Python projects. In general, language models rate the code expressions developers choose to write as more predictable than these transformed alternatives. Then, we perform two human subject studies asking participants to choose between two equivalent snippets of Java code with different surprisal scores (one original and transformed). We find that programmers do prefer more predictable variants, and that stronger language models like the transformer align more often and more consistently with these preferences.

97 MATHEMATICS AND COMPUTING↗

RASPA3

RASPA3, a molecular simulation code for computing adsorption and diffusion in nanoporous materials and thermodynamic and transport properties of fluids. It implements force field based classical Monte Carlo/molecular dynamics in various ensembles. RASPA3 is rewritten from the ground up in C++23 with speed and code readability in mind. Transition-matrix Monte Carlo is added to compute the density of states and free energies. The Monte Carlo code for rigid molecules is based on quaternions, and the atomic positions needed in the energy evaluation are recreated from the center of mass position and quaternion orientation. The expanded ensemble methodology for fractional molecules, with a scaling parameter λ between 0 and 1, now also keeps track of analytic expressions of dU/dλ, allowing independent verification of the chemical potential using thermodynamic integration. The source code is freely available under the MIT license on GitHub.

Dubbeldam, David↗

Fracton models from product codes

We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes. Depending on the properties of the input codes, product codes can realize either Type-I or Type-II fracton models, in both nonlocal and local constructions. For the nonlocal case, we show that a recently proposed model of lineons on nonlocal graphs can be obtained as a hypergraph product code. Interestingly, constrained mobility in this model arises only from energy barriers associated with the graph. For the local case, we introduce a novel type of classical LDPC code defined on a planar aperiodic tiling. By considering the specific example of the pinwheel tiling, we demonstrate the systematic construction of local Type-I and Type-II fracton models as product codes. Our work establishes product codes as a natural setting for exploring fracton order.

Fractons↗

Phase-engineered bosonic quantum codes

Continuous-variable systems protected by bosonic quantum codes have emerged as a promising platform for quantum information. To date, the design of code words has centered on optimizing the state occupation in the relevant basis to generate the distance needed for error correction. Here, we show tuning the phase degree of freedom in the design of code words can affect, and potentially enhance, the protection against Markovian errors that involve excitation exchange with the environment. As illustrations, we first consider phase engineering bosonic codes with uniform spacing in the Fock basis that correct excitation loss with a Kerr unitary and show that these modified codes feature destructive interference between error code words and, with an adapted “two-level” recovery, the error protection is significantly enhanced. We then study protection against energy decay with the presence of mode nonlinearities and analyze the role of phase for optimal code designs. As a result, we extend the principle of phase engineering to bosonic codes defined in other bases and multiqubit codes, demonstrating its broad applicability in quantum error correction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions

In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to Z d qudits, including instances where d is a nonprime number. This capability allows the identification of topological orders that differ from the Z d toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for Z p qudits (with p being a prime) are equivalent to finite copies of Z p toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order. Published by the American Physical Society 2024

Physics↗

Collaborative Research: Improved Efficiency and Coupling of the Radiation Code in the ACME Earth System Model (Final Report)

The complexity of radiative transfer, its importance to the exchange of energy in the climate system, and its high computational cost establishes importance of an accurate and efficient radiative transfer parameterization for climate simulation. Previous work by the proposing team at AER led to the development of the radiation code, RRTMG, which has been widely accepted by the global modeling community as a fast and accurate advancement over the previous generation of radiation codes. It has been in use in the NCAR CESM for many years, and it has been implemented in the initial version the DOE E3SM model. However, its computational cost remains high relative to other components in part due to its complexity and to its inefficient use of modern optimization strategies, and this project helped address this limitation for the code’s application in E3SM. Under other funding, the Investigators of this project led an effort to develop a high-performance broadband radiation code, called RTE+RRTMGP, which is a completely restructured code that will take advantage of modern computational capabilities to enhance its performance while retaining the strengths and accuracy of the original code. Designed to perform over a range of computer architectures, RTE+RRTMGP makes extensive use of Fortran 2003 features to improve both its efficiency and its use of memory. RTE+RRTMGP is expected to be adopted in the next generation of RTE+RRTMGP. This project allowed for advancements to the code’s computational capabilities and adding new and enhanced features. This included revising RTE+RRTMGP to run on GPU processors, analysis of and improvements to the code’s timing, modifying the gas optics in RRTMGP to increase the code’s accuracy, extensive validation of computed fluxes, heating rates and forcings, generating a cloud optical property and vertical sampling capabilities for RTE+RRTMGP, implementing a fast and accurate longwave scattering capability, and groundwork for the inclusion of a capability to specify solar variability. Many of the accomplishment in this project necessitated significant collaboration with the E3SM development team. The result of this project was optimization of a key physical component (radiative transfer calculations) of E3SM, directly supporting E3SM’s overarching global modeling objectives. More broadly, this project provided overall advancements in the use of radiative transfer calculations in atmospheric modeling and simulation, particularly for climate.

58 GEOSCIENCES↗

Draft ASME Boiler and Pressure Vessel Code Cases and Technical Bases for Use of Alloy 617 for Constructions of Nuclear Component Under Section III, Division 5

The American Society of Mechanical Engineers (ASME) Boiler and Pressure Vessel Code currently only allows five materials for use in construction of nuclear components for high temperature service. These are: 2.25Cr-1Mo and V-modified 9Cr-1Mo steels, Types 304 and 316 stainless steels and the high nickel Alloy 800H. Since 2005, the US high temperature gas-cooled reactor program has been characterizing elevated temperature mechanical properties of Alloy 617 as the leading candidate construction material for the intermediate heat exchanger. After analysis of these experimental results, along with historical data and additional results available through the Generation IV International Forum, Very High Temperature Reactor, Materials Program Management Board Materials Handbook, a draft ASME Code Case to allow nuclear construction with Alloy 617 for temperatures up to 1750°F (954°C) has been developed. This report contains the Code Case for Low Temperature Service Construction of Section III, Division 5, Subsection HB, Subpart A, Class A and Subsection HC, Subpart A, Class B components, which has been approved in Section II, Materials, and Section III, Rules for Construction of Nuclear Facility Components. Supporting technical justification for the low temperature Code Case is also included. This Code Case allows use of Alloy 617 up to 800°F (425°C). This report also contains an updated draft of a Section III, Division 5, Subsection HB, Subpart B, Class A Code Case for Alloy 617 to qualify it for use in construction of nuclear components up to 1750°F (954°C) for service life up to 100,000 hours. The draft contained in Appendix 4, subject to editorial revision and approval by the ASME Special Task Group on Alloy 617 Code Qualification, will be submitted for approval by letter ballot by the appropriate ASME Committees. The technical justification supporting the Code Case is presented in Appendix 5 of this report. This background document is part of the information package that will be submitted with the Code Case for ballot.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

MCNP ® Code V.6.3.0 Release Notes

The Monte Carlo N-Particle ® (MCNP ® ) code is a general-purpose, continuous-energy, generalized geometry, time-dependent, radiation transport code developed by the MCNP development team. The MCNP calculations provide predictive capabilities that can replace expensive or impossible-to perform experiments. Specific application problems include simulations of experimental diagnostics, intrinsic radiation, radiation detection and measurement, criticality safety, nuclear threat reduction and response, radiation health protection, nuclear weapons effects, and nuclear forensics. This MCNP code, version 6.3.0, follows the MCNP6.2.0 version. Since the release of MCNP6.2.0, many changes have been made to the MCNP code. These changes include new or improved features, a new build system, code enhancement and modernization, and bug fixes. The MCNP code, version 6.3.0, theory and user input information is documented in MCNP ® Code Version 6.3.0 Theory & User Manual, the build guidance for various platforms is documented in MCNP ® Code Version 6.3.0 Build Guide, and the verification and validation testing for various application benchmark test suites is documented in MCNP ® Code Version 6.3.0 Verification & Validation Testing.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Building Performance Standards and Energy Code Alignment - Technical Brief

Building energy codes focus on building design, construction and renovation and have significantly increased building efficiency since the first national energy code was published in 1975. Most jurisdictions have energy codes based on ANSI/ASHRAE/IES Standard 90.1 (hereto referred to as Standard 90.1) and the International Energy Conservation Code (IECC). Compliance options available in these model energy codes include a prescriptive path, whole building performance paths – including IECC Total Building Performance (TBP), Standard 90.1 Energy Cost Budget (ECB) method and Performance Rating Method (PRM) – and system performance paths for envelope and heating, ventilation, and air-conditioning systems. Building performance standard (BPS) policies are an emerging policy tool used by jurisdictions to reduce the operational energy use or greenhouse gas (GHG) emissions of the existing commercial building stock. BPS policies vary widely between jurisdictions and are tailored to each location’s climate and energy goals. Intuitively, projects that met a recent edition of the energy code should comply with the BPS targets. However, some new buildings may struggle with meeting the BPS for the following reasons: 1. Energy codes focus on the design of the building and its projected ability to perform efficiently, while BPS compliance is dependent on the actual ongoing performance of the building, considering variables like occupancy, operation, and maintenance. 2. There are significant differences in the methodologies used to determine BPS compliance versus code compliance, including how each handles compliance metrics, handling of building amenities, and renewable energy generation. 3. The prescriptive compliance path in the energy code is based on performance of individual building components, as opposed to the performance compliance path which accounts for holistic building design strategies and interdependent building systems. This can result in a significant variability in post-occupancy performance for buildings built using the prescriptive path. Designs on the lower end of the permitted efficiency range may struggle with meeting the BPS.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hierarchical memories: Simulating quantum LDPC codes with local gates

Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to geometric-locality constraints, it becomes challenging to realize these codes. In this paper, we construct a new family of [[N,K,D]] codes, referred to as hierarchical codes, that encode a number of logical qubits K=Ω(N/log(N) 2 ). The N th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code; nearest-neighbor gates in two dimensions are sufficient to implement the corresponding syndrome-extraction circuit and achieve a threshold. Below threshold the logical failure rate vanishes superpolynomially as a function of the distance D(N). We present a bilayer architecture for implementing the syndrome-extraction circuit, and estimate the logical failure rate for this architecture. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.

Pattison, Christopher A. [California Institute of ↗

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗

Coupling TRACE with nodal neutronics code Ants using the Exterior Communications Interface and VTT's multi-physics driver Cerberus

In this paper a recently developed coupling between system code TRACE and nodal neutronics code Ants is presented. The TRAC/RELAP Advanced Computational Engine (TRACE) is a reactor system code developed by U.S. Nuclear Regulatory Commission (NRC). The code has been designed to analyse loss-of-coolant accidents (LOCAs), operational transients and other accident scenarios in light water reactors. Ants is the reduced order nodal neutronics code of the Kraken framework. The diffusion solution method in Ants is based on the Analytic Function Expansion Nodal method (AFEN) and Flux Expansion Nodal Method (FENM). Rectangular, hexagonal and triangular geometries are supported. Both steady state and burnup problems including micro-depletion can be simulated. The coupling is implemented using VTT's multi-physics driver Cerberus and the Exterior Communications Interface (ECI) which is supplied with TRACE and enables the coupling of TRACE without source code modifications. The main focus in the paper is on describing the TRACE-Ants coupling in detail in order to share to other code developers what we have learned from the ECI based coupling process. The coupled code system is briefly tested by simulating a simple transient in a SMR core initiated by control rod movement. The results of the test calculation look reasonable and more complicated test cases will be modelled in the near future.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Geometric Structure and Transversal Logic of Quantum Reed–Muller Codes

Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. The simplest class of native operations are transversal gates, which are naturally fault-tolerant. Here, in this paper, we aim to characterize the transversal gates of quantum Reed–Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. We start our work by establishing a new geometric characterization of quantum RM codes via the Boolean hypercube and its associated subcube complex. More specifically, a set of stabilizer generators for a quantum RM code can be described via transversal X and Z operators acting on subcubes of particular dimensions. This characterization leads us to define subcube operators composed of single-qubit π/2 k Z -rotations that act on subcubes of given dimensions. We first characterize the action of subcube operators on the code space: depending on the dimension of the subcube, these operators either (1) act as a logical identity on the code space, (2) implement non-trivial logic, or (3) rotate a state away from the code space. Second, and more remarkably, we uncover that the logic implemented by these operators corresponds to circuits of multi-controlled-Z gates that have an explicit and simple combinatorial description. Overall, this suite of results yields a comprehensive understanding of a class of natural transversal operators for quantum RM codes.

Reed–Muller (RM) codes↗

Performance-Aligned LLMs for Generating Fast HPC Code

Optimizing scientific software is a difficult task because codebases are often large and complex, and performance can depend upon several factors including the algorithm, its implementation, and hardware among others. Causes of poor performance can originate from disparate sources and be difficult to diagnose. Recent years have seen a multitude of work that use large language models (LLMs) to assist in software development tasks. However, these tools are trained to model the distribution of code as text, and are not specifically designed to understand performance aspects of code. In this work, we introduce a reinforcement learning based methodology to align the outputs of code LLMs with performance. This allows us to build upon the current code modeling capabilities of LLMs and extend them to generate better performing code. Here, we demonstrate that our fine-tuned model improves the expected speedup of generated code over base models for a set of benchmark tasks from 0.9 to 1.6 for serial code and 1.9 to 4.5 for OpenMP parallel code.

Computer science↗

Electric Vehicle Charging for Residential and Commercial Energy Codes: Technical Brief

Numerous studies show that sales of electric vehicles (EVs) have grown consistently over recent years in the U.S. The U.S. Energy Information Administration (EIA) estimated 3 million EVs were on the road in 2022, and the Edison Electric Institute (EEI) forecasts a total of 26.4 million EVs on the road by 2030. Based on this forecast, EEI projects the need for an additional 12.9 million EV charge ports by 2030. If EV charging infrastructure fails to keep pace with sales of EVs it could result in consumers stranded without options to power their vehicles. EVs are capable of providing substantial benefits to the consumers. EVs are less expensive to operate than conventional internal combustion engine vehicles, have lower maintenance costs, and have the convenience of fueling (charging) at home or work. Studies conducted in California show that costs associated with installing EV charging infrastructure can be substantially more expensive for retrofit scenarios compared to new construction, making inclusion of EV infrastructure in new construction codes a cost-effective policy option to increase infrastructure to meet growing demands. PNNL tracks adoption of mandatory EV provisions across the U.S. As of December 20, 2024, 12 states (California, Oregon, Washington, Colorado, New Mexico, Illinois, Maryland, Delaware, New Jersey, Rhode Island, Massachusetts and Vermont) and 53 local governments have added EV provisions to their building codes, local ordinances and zoning requirements. Originally published in 2022, this tech brief has been revised to align with recent model energy code committee discussions and published EV infrastructure code language. This technical brief summarizes market trends, costs and benefits, and provides sample code language for EV charging infrastructure for consideration to be included in model codes, such as the International Energy Conservation Code (IECC) and ANSI/ASHRAE/IES Standard 90.1, as well as directly by states and local governments in their building codes. The technical brief summarizes related efforts undertaken by states and local governments, and builds upon language considered during the 2021 and 2024 IECC development cycles.

2021 IECC↗

Efficient Binary Static Code Data Flow Analysis Using Unsupervised Learning

The ever increasing need to ensure that code is reliably, efficiently and safely constructed has fueled the evolution of popular static binary code analysis tools. In identifying potential coding flaws in binaries, tools such as IDA Pro are used to disassemble the binaries into an opcode/assembly language format in support of manual static code analysis. Because of the highly manual and resource intensive nature involved with analyzing large binaries, the probability of overlooking potential coding irregularities and inefficiencies is quite high. In this paper, a light-weight data, unsupervised data flow methodology is described which uses highly-correlated data flow graph (CDFGs) to identify coding irregularities such that analysis time and required computing resources are minimized. Such analysis accuracy and efficiency gains are achieved by using a combination of graph analysis and unsupervised machine learning techniques which allows an analyst to focus on the most statistically significant flow patterns while performing binary static code analysis.

97 MATHEMATICS AND COMPUTING↗

Distributing User Code with the CernVM FileSystem

The CernVM FileSystem (CVMFS) is widely used in High Throughput Computing to efficiently distributed experiment code. However, the standard CVMFS publishing tools are designed for a small group of people from each experiment to maintain common software, and the tools are not a good fit for publishing software from numerous users in each experiment. As a result, most user code, such as code to do specific physics analyses, is still sent with every job to the place the job is run. That process is relatively inefficient, especially when the user code is large. To overcome these limitations, we have built a CVMFS user code publication system. This publication system enables users to still submit their code with their jobs but the code is distributed and accessed through the standard CVMFS infrastructure. The user code is automatically deleted from CVMFS after a period of no use. Most of the software for the system is available as a single self-contained open source rpm called cvmfs-user-pub and is available for other deployments.

97 MATHEMATICS AND COMPUTING↗