SEARCH · Engineering Papers

Results for “Code”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 469 records · Page 26

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Code Benchmark of the HTTF Pressurized Conduction Cooldown Test Using SAM

The High Temperature Test Facility (HTTF) at Oregon State University is an integral system test facility to simulate postulated reactor transients of prismatic high-temperature gas-cooled reactors(HTGRs). A series of test campaigns was launched, providing abundant test data that could be used to benchmark reactor system analysis codes like the System Analysis Module (SAM). In this study, a SAM model of the facility is developed based on the two-dimensional (2D) ring model approach. All components including the ceramic matrix, graphite heaters, helium coolant channels, core barrel, upcomer, pressure vessel, and reactor cavity cooling system are modeled as concentric cylindrical rings. The model is used to simulate one of the benchmark problems-Pressurized Conduction Cooldown (PCC)-within the scope of the Organisation for Economic Co-operation and Development Nuclear Energy Agency International HTTF Benchmark. The simulations consist of two parts. In the first part, operating and boundary conditions as well as thermophysical properties of materials are specified for the benchmark problem. In this work, results from the first part will be used in code-to-code comparison. In the second part, the SAM model is used to simulate Test PG-27, which is the first PCC test carried out in the HTTF, with only two of the ten heater banks activated. The results in the second part are used for code-to-data comparison. Because the helium coolant flow rate is not measured in this facility, it is estimated using the input power and inlet/outlet coolant temperatures. Additionally, radial heat flow in the ceramic blocks is complicated by hundreds of cylindrical coolant channels and heater rods embedded in them. As such, it is necessary to deduce an effective thermal conductivity for the ceramic to analyze the core thermal behavior. SAM predictions of the helium coolant and ceramic temperatures are compared with test data measured in three equivalent sectors. Overall, the SAM results agree reasonably well with test data within the variation of data among the three sectors, which demonstrates SAM's capability in capturing transient effects in HTGR using the simplified 2D ring model.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2026

Resilience of the surface code to error bursts

Quantum error correction works effectively only if the error rate of gate operations is sufficiently low. However, some rare physical mechanisms can cause a temporary increase in the error rate that affects many qubits; examples include ionizing radiation in superconducting hardware and large deviations in the global control of atomic systems. We refer to such rare transient spikes in the gate error rate as error bursts. In this work, we investigate the resilience of the rotated surface code to generic error bursts. We assume that, after appropriate mitigation strategies, the spike in the error rate lasts for only a single syndrome-extraction cycle; we also assume that the enhanced error rate is uniform across the code block. Under these assumptions, and for a circuit-level depolarizing noise model, we perform Monte Carlo simulations to determine the regime in burst error rate and background error rate for which the memory time becomes arbitrarily long as the code block size grows. Our results indicate that suitable hardware mitigation methods combined with standard decoding methods may suffice to protect against transient error bursts in the rotated surface code.

Quantum error correction↗

DOE OSTI2023

Securely Aggregated Coded Matrix Inversion

Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model for training data distributed across client devices. In this work we propose approximating the inverse of an aggregated data matrix, where the data is generated by clients; similar to the federated learning paradigm, while also being resilient to stragglers. To do so, we propose a coded computing method based on gradient coding. We modify this method so that the coordinator does not access the local data at any point; while the clients access the aggregated matrix in order to complete their tasks. Here, the network we consider is not centrally administrated, and the communications which take place are secure against potential eavesdroppers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

A combinatorial model for dentate gyrus sparse coding

The dentate gyrus forms a critical link between the entorhinal cortex and CA3 by providing a sparse version of the signal. Concurrent with this increase in sparsity, a widely accepted theory suggests the dentate gyrus performs pattern separation—similar inputs yield decorrelated outputs. Although an active region of study and theory, few logically rigorous arguments detail the dentate gyrus’s (DG) coding. We suggest a theoretically tractable, combinatorial model for this action. The model provides formal methods for a highly redundant, arbitrarily sparse, and decorrelated output signal.To explore the value of this model framework, we assess how suitable it is for two notable aspects of DG coding: how it can handle the highly structured grid cell representation in the input entorhinal cortex region and the presence of adult neurogenesis, which has been proposed to produce a heterogeneous code in the DG. We find tailoring the model to grid cell input yields expansion parameters consistent with the literature. In addition, the heterogeneous coding reflects activity gradation observed experimentally. Lastly, we connect this approach with more conventional binary threshold neural circuit models via a formal embedding.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

Demonstration of MOOSE-based Griffin reactor physics, code for heterogeneous lead-cooled fast reactor analysis

The MOOSE-based reactor physics code Griffin was assessed on a heterogeneous pin-resolved model of a prototype lead-cooled fast reactor assembly. This model was developed in preparation for future use in MOOSE-based multiphysics calculations for computing hot channel factors. Heterogeneous multigroup cross sections were prepared using the fast reactor multi-group cross section processing code MC{sup 2}-3 using a two-step method. Griffin simulations were performed using the DFEM-SN solver on 576 cores on Argonne's LCRC cluster. Diffusion-based acceleration methods were applied (NDA and CMFD). Reference solutions were generated with continuous energy MCNP and the hybrid MOC/finite element solver PROTEUS-MOC for code-to-code comparison. Space-angle convergence studies were conducted to observe convergence in k-eigenvalue and axial pin power distributions. The fully resolved Griffin calculation was within 68 pcm of the MCNP eigenvalue and exhibited max 1.2% relative error in the axial pin power distribution. Griffin produced nearly identical results to PROTEUS-MOC when using the same 9-group multigroup cross-section set. Griffin demonstrated favorable scaling in wall-clock time and memory usage when using diffusion-based acceleration methods. Griffin is capable of simulating the pin-resolved heterogeneous LFR assembly with good accuracy and performance, and is suitable for future use in coupled high-fidelity hot channel factor simulations. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2022

Calculation of neutron flux spectra of the VVER-1000 mock-up shielding benchmark with Monte Carlo code MCS utilizing mesh-based weight window

The measurements of neutron spectra compiled inside the NEA-1517/82 package from the Shielding Integral Benchmark Archive and Database (SINBAD) are chosen as benchmark cases to validate the variance reduction technique based on weight window in Monte Carlo Code MCS. A full 3D model for fixed source mode calculation with hexagonal lattice source definition is developed to simulate total of 6 points of measurements at the vicinity of the reactor and the reactor pressure vessel region. A code/code comparison against MCNP6 code is first conducted as verification element for the mesh-based weight window capability in MCS. Finally, the validation results are presented against measurements. The verification against MCNP6 code gives good agreement in addition of the insight to the importance of user understanding to determine proper reference point and reference lower weight bound for scaling which is not required in MCS code due to its capability of automatic scaling. The comparison of neutron spectra between MCS and measurements shows good agreement within 3 standard deviations for all of six detector positions.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2022

Uncertainty analysis for VERA problem 2 using the cell-code Condor v2.8.05

Condor is a cell-level neutronic calculation code that applies multi-group collision probabilities with heterogeneous response coupling method within generic geometry configurations. Under the Condor's code continuous development, the incorporation of up-to-date methodologies and state-of-the-art practices in reactor analysis represents a driving force. In this work, the capabilities of Condor v2.8.05 to develop an uncertainty analysis for realistic PWR-kind fuel assemblies are studied. The Total Monte Carlo approach is applied to quantify the impact of fabrication tolerances in the code's results for reactivity and power distributions, by means of randomly sampled input values using the VERA problem 2 as basis. The VERA problem 2 proposes a series of Westinghouse 2D 17 x 17-type fuel lattices, to be calculated reflected at beginning-of-life without Xe. The configurations correspond to a modern PWR. Selected neutronic parameters from Condor runs are thus analyzed in terms of the observed spread as well as the obtained distributions for the randomly perturbed cases, showing the capability of the code to handle the required input data, as well as its ability to provide valuable insights regarding uncertainty quantification.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2016

Building Energy Codes: Policy Overview and Good Practices

Globally, 32% of total final energy consumption is attributed to the building sector. To reduce energy consumption, energy codes set minimum energy efficiency standards for the building sector. With effective implementation, building energy codes can support energy cost savings and complementary benefits associated with electricity reliability, air quality improvement, greenhouse gas emission reduction, increased comfort, and economic and social development. This policy brief seeks to support building code policymakers and implementers in designing effective building code programs.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2015

Methodology for Evaluating Cost-Effectiveness of Commercial Energy Code Changes

This document lays out DOE's methodology for evaluating the cost-effectiveness of energy code and standard proposals and editions. The evaluation is applied to new provisions or editions of ANSI/ASHRAE/IES Standard 90.1 and the International Energy Conservation Code. The methodology follows standard life-cycle cost (LCC) economic analysis procedures. Cost-effectiveness evaluation requires three steps: 1) evaluating the energy and energy cost savings of code changes, 2) evaluating the incremental and replacement costs related to the changes, and 3) determining the cost-effectiveness of energy code changes based on those costs and savings over time.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

PDQ Users Manual. Manual Version 2, for PDQ Code Version 1.20

PDQ is a tool for the management of the input and execution of batch jobs for simulation codes that use a text based input system. It accomplishes this goal by operating at two levels. First, it takes input file templates (commonly known at LANL as input deck templates) and creates multiple instantiations by performing substitutions of data from table files into symbols (variables) found in the template. Second, it provides commands to submit the created files to the SLURM batch system for execution. These two activities taken together produce a whole that is greater than the sum of its parts and provides an elegant way of executing studies across multiple similar simulations while minimizing the risk of typographical errors in the input files. PDQ was originally developed as a job management system called XVS by Jeff McAninch while he was at LANL. Besides the capabilities described here, XVS had many other features specific for interactions with particular simulation codes. After Jeff’s departure, maintenance of XVS was taken over by Rendell Carver; he added some new features as well as kept it functioning as the batch system at LANL was changed from LSF to MOAB to SLURM. In 2017, Rob Pelak decided to develop a different version that removed the additional features (many of which were rendered obsolete with the retirement of the simulation code or batch system that they supported) and produced a cleaner “bare bones” version of XVS. A few other behaviors of XVS that Rob found irksome were altered. Rob gave the resulting code a new name: PDQ. In 2022 Danielle McDermott developed a version that runs under Python 3.X. As suggested by Rob, she used the python2to3 utility to identify most changes. Given that PDQ continues to operate with Python version 2.7 we have advanced the version number to 1.20.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Study of Codes & Standards for Energy Storage Systems: A Report to Congress

The Infrastructure Investment and Jobs Act (H.R. 3684, 2021) directed the Secretary of Energy to prepare a report identifying the existing codes and standards for energy storage technologies. The stated goals for the report are to enhance the safe development of energy storage systems by identifying codes that require updating and facilitation of greater conformity in codes across different types and usages of energy storage technologies. This paper will focus on the specific codes and standards for stationary energy storage systems (ESS).

25 ENERGY STORAGE↗

DOE OSTI2024

COG User's Manual: A Multiparticle Monte Carlo Transport Code (Sixth Edition)

COG is a high-resolution code for the Monte Carlo simulation of coupled particle transport in arbitrary 3-D geometry. COG will transport neutrons, protons, deuterons, alpha particles with energies up to hundreds of GeV, and photons with energy ranges limited by the available cross section sets and physics models. Electrons can be transported via the EGS5 electron transport kernel, electrons can also be transported. The COG code is a significant upgrade from earlier Monte Carlo transport codes and has been written specifically to make it more versatile, accurate, and easy to use. COG has provisions for calculating deep penetration (shielding) problems, criticality problems, and neutron activation problems while retains all of the standard capabilities found in other Monte Carlo transport codes. COG uses high-resolution pointwise cross-section databases and makes no compromises in the transport physics, so that the results of a COG run are limited only by the accuracy of the databases used. COG runs primarily on Linux Operating System workstations with MPICH software installed – currently, Red Hat 7 & 8, Windows 10 (Windows Subsystem for Linux –WSL), Ubuntu 16, 18 & 20, OpenSUSE Leap 15.2, Fedora 32, Apple Power Mac with Intel CPU (with MacPorts installed) workstations, and LLNL LC supercomputer CTS-1 cluster with TOSS 3 are supported.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Methodology for Evaluating Commercial Energy Code Updates

This document lays out the Department of Energy’s (DOE’s) methodology for evaluating the cost-effectiveness of energy code and standard proposals and editions. The evaluation is applied to new provisions or editions of ANSI/ASHRAE/IES Standard 90.1 and the International Energy Conservation Code. The methodology follows standard lifecycle cost (LCC) economic analysis procedures. A cost-effectiveness evaluation requires three steps: 1) evaluating the energy and energy cost savings of code changes; 2) evaluating the incremental and replacement costs related to the changes; and 3) determining the cost-effectiveness of energy code changes based on those costs and savings over time.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2024

Methodology for Evaluating Energy Savings, Cost-Effectiveness, and Societal Impacts of Commercial Energy Code Changes

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2024

Rethinking skip connections in Spiking Neural Networks with Time-To-First-Spike coding

Time-To-First-Spike (TTFS) coding in Spiking Neural Networks (SNNs) offers significant advantages in terms of energy efficiency, closely mimicking the behavior of biological neurons. In this work, we delve into the role of skip connections, a widely used concept in Artificial Neural Networks (ANNs), within the domain of SNNs with TTFS coding. Our focus is on two distinct types of skip connection architectures: (1) addition-based skip connections, and (2) concatenation-based skip connections. We find that addition-based skip connections introduce an additional delay in terms of spike timing. On the other hand, concatenation-based skip connections circumvent this delay but produce time gaps between after-convolution and skip connection paths, thereby restricting the effective mixing of information from these two paths. To mitigate these issues, we propose a novel approach involving a learnable delay for skip connections in the concatenation-based skip connection architecture. This approach successfully bridges the time gap between the convolutional and skip branches, facilitating improved information mixing. We conduct experiments on public datasets including MNIST and Fashion-MNIST, illustrating the advantage of the skip connection in TTFS coding architectures. Additionally, we demonstrate the applicability of TTFS coding on beyond image recognition tasks and extend it to scientific machine-learning tasks, broadening the potential uses of SNNs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Towards Enhancing Coding Productivity for GPU Programming Using Static Graphs

The main contribution of this work is to increase the coding productivity of GPU programming by using the concept of Static Graphs. GPU capabilities have been increasing significantly in terms of performance and memory capacity. However, there are still some problems in terms of scalability and limitations to the amount of work that a GPU can perform at a time. To minimize the overhead associated with the launch of GPU kernels, as well as to maximize the use of GPU capacity, we have combined the new CUDA Graph API with the CUDA programming model (including CUDA math libraries) and the OpenACC programming model. We use as test cases two different, well-known and widely used problems in HPC and AI: the Conjugate Gradient method and the Particle Swarm Optimization. In the first test case (Conjugate Gradient) we focus on the integration of Static Graphs with CUDA. In this case, we are able to significantly outperform the NVIDIA reference code, reaching an acceleration of up to 11x thanks to a better implementation, which can benefit from the new CUDA Graph capabilities. In the second test case (Particle Swarm Optimization), we complement the OpenACC functionality with the use of CUDA Graph, achieving again accelerations of up to one order of magnitude, with average speedups ranging from 2x to 4x, and performance very close to a reference and optimized CUDA code. Our main target is to achieve a higher coding productivity model for GPU programming by using Static Graphs, which provides, in a very transparent way, a better exploitation of the GPU capacity. The combination of using Static Graphs with two of the current most important GPU programming models (CUDA and OpenACC) is able to reduce considerably the execution time w.r.t. the use of CUDA and OpenACC only, achieving accelerations of up to more than one order of magnitude. Finally, we propose an interface to incorporate the concept of Static Graphs into the OpenACC Specifications.

58 GEOSCIENCES↗

DOE OSTI2020

Evaluating Building Energy Code Compliance and Savings Potential through Large-Scale Simulation with Models Inferred by Field Data

Building energy code compliance is the crucial link between the actual energy savings and the efficiency prescribed in energy codes. A research project aiming to identify opportunities to reduce energy consumption in new single-family residential construction by increasing compliance with the building energy code was conducted in several states of the United States. The study was comprised of three phases: (1) a baseline study to document typical practice and identify opportunities for improvement based on empirical data gathered from the field; (2) an education and training phase targeting the opportunities identified; and (3) a post-study to assess whether a reduction in average state-wide energy use could be achieved following the education and training phase. We proposed a novel methodology based on large-scale building energy simulation inferred by limited field data to assess the performance of a large population of homes. This paper presents the methodology, findings, and results of this study. The state-wide average energy consumption decreased at Phase III from Phase I for five of the seven states involved in the analysis. The measure-level savings potential analysis shows an overall reduction. Overall, the training and education phase plays a recognizable role in improving compliance with building energy codes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2017

LACEwING: A New Moving Group Analysis Code

We present a new nearby young moving group (NYMG) kinematic membership analysis code, LocAting Constituent mEmbers In Nearby Groups (LACEwING), a new Catalog of Suspected Nearby Young Stars, a new list of bona fide members of moving groups, and a kinematic traceback code. LACEwING is a convergence-style algorithm with carefully vetted membership statistics based on a large numerical simulation of the Solar Neighborhood. Given spatial and kinematic information on stars, LACEwING calculates membership probabilities in 13 NYMGs and three open clusters within 100 pc. In addition to describing the inputs, methods, and products of the code, we provide comparisons of LACEwING to other popular kinematic moving group membership identification codes. As a proof of concept, we use LACEwING to reconsider the membership of 930 stellar systems in the Solar Neighborhood (within 100 pc) that have reported measurable lithium equivalent widths. We quantify the evidence in support of a population of young stars not attached to any NYMGs, which is a possible sign of new as-yet-undiscovered groups or of a field population of young stars.

79 ASTRONOMY AND ASTROPHYSICS↗