Search NASA⌕ Search

SEARCH · Search NASA

Results for “code sharing”

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 253 records · Page 14

Synthesis and Crystal Structure of the Zintl Phases Na2CaCdSb2, Na2SrCdSb2 and Na2EuCdSb2

This work details the synthesis and the crystal structures of the quaternary Zintl phases Na2CaCdSb2, Na2SrCdSb2 and Na2EuCdSb2. They are isostructural and their noncentrosymmetric structure is with the space group Pmc21 (Pearson code oP12). All structural work is carried out via single-crystal X-ray diffraction methods. The structure features [CdSb2]4– layers of corner-shared CdSb4 tetrahedra, which are stacked along the b-crystallographic axis and are separated by cations. The results from the structure refinements suggest that in addition to full cation ordering, which is typical for this structure, there also exists a possibility for an accommodation of a small degree of cation disorder.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

msdlive-cli-distro

MSD-LIVE, the MultiSector Dynamics – Living, Intuitive, Value-adding, Environment, is a flexible and scalable data and code management system combined with a distributed computational platform that will enable MSD researchers to document and archive their data, run their models and analysis tools, and share their data, software, and multi-model workflows within a robust Community of Practice. MSD-LIVE will facilitate a new open, collaborative, resource-rich, technology-facilitated, community-driven way of doing MSD research.

Lansing, Carina↗

Shape Optimization for Control and Isolation of Structural Vibrations in Aerospace and Defense Applications

Among the main challenges in shape optimization is the coupling of Finite Element Method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multi-physics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. There are two mathematically equivalent approaches to computing the shape derivative: the volume method, and the boundary method. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. Prior implementations of shape derivatives at Sandia have been based on the volume method. We introduce the strip method, which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. The development of the strip method also offers us the opportunity to share some lessons learned about implementing the volume method and boundary method, to show shape optimization results on problems of interest, and to begin addressing the other main challenges at hand: constraints on optimized shapes, and their interplay with optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗

Ray-tracing analysis for cross-polarization scattering diagnostic on MAST-upgrade spherical tokamak

A combined Doppler backscattering/cross-polarization scattering (DBS/CPS) system is being deployed on MAST-U for simultaneous measurements of local density turbulence, turbulence flows, and magnetic turbulence. In this design, CPS shares the probing beam with the DBS and uses a separate parallel-viewing receiver system. In this study, we utilize a modified GENRAY 3D ray-tracing code to simulate the propagation of the probing and scattered beams. The contributions of different scattering locations along the entire beam trajectories are considered, and the corresponding local B̃ wavenumbers are estimated using the wavevector matching criterion. The wavenumber ranges of the local B̃ that are detectable to the CPS system are explored for simulated L- and H-mode plasmas.

Hong, R. (ORCID:0000000347508015)↗

MCR Container Tools

MathWorks' MATLAB is widely used in academia and industry for prototyping, data analysis, data processing, etc. Many users compile their programs using the MATLAB Compiler to run on workstations/computing clusters via the free MATLAB Compiler Runtime (MCR). The MCR facilitates the execution of code calling Application Programming Interfaces (API) functions from both base MATLAB and MATLAB toolboxes. In a Linux environment, a sizable number of third-party runtime dependencies (i.e. shared libraries) are necessary. Unfortunately, to the MTLAB community's knowledge, these dependencies are not documented, leaving system administrators and/or end-users to find/install the necessary libraries either as runtime errors resulting from them missing or by inspecting the header information of Executable and Linkable Format (ELF) libraries of the MCR to determine which ones are missing from the system. To address various shortcomings, Docker Images based on Community Enterprise Operating System (CentOS) 7, a derivative of Redhat Enterprise Linux (RHEL) 7, containing recent (2015-2017) MCR releases and their dependencies were created. These images, along with a provided sample Docker Compose YAML Script, can be used to create a simulated computing cluster where MATLAB Compiler created binaries can be executed using a sample Slurm Workload Manager script.

Haas, NicholasQ↗

JPype

JPype is a Python module to provide full access to Java from within Python. It allows Python to make use of Java only libraries, exploring and visualization of Java structures, development and testing of Java libraries, scientific computing, and much more. By gaining the best of both worlds using Python for rapid prototyping and Java for strong typed production code, JPype provides a powerful environment for engineering and code development. This is achieved not through re-implementing Python, as Jython has done, but rather through interfacing at the native level in both virtual machines. This shared memory based approach achieves decent computing performance, while providing the access to the entirety of CPython and Java libraries.

Nelson, KarlE.↗

INN Airfoil Tools

This software package contains code to perform airfoil inverse shape design using a sparsified invertible neural network model. This is a specialized deep learning architecture that enables both network weights to be shared to evaluate forward or inverse passes through the network. As a design tool, this network allows practitioners to specify desired aerodynamic and structural properties and generate shapes that satisfy those properties. The invertible neural network is accompanied with tuned parameters as well as software tools to train new models as needed.

Glaws, Andrew↗

Municipal Portfolio Performance and Policy Opportunities

A wide range of policy tools are in place to enhance energy efficiency in the built environment. However, the lion’s share of today’s energy savings opportunities have to do with energy consumption in existing buildings currently in operation. Many of the policy tools in play, including energy codes, have little to no effect on these existing buildings. New tools and resources are needed to bring existing buildings up to higher levels of energy performance. This project was focused on building a replicable framework, complete with open-source software tools and resources, to empower cities around the country to significantly enhance the energy performance of their own existing buildings and identify opportunities for future improvements. These issues were addressed through the evaluation of the performance of the municipal building stock and policy environments of four mid-size cities: Eugene, Oregon; Providence, Rhode Island; Grand Rapids, Michigan; and Tacoma, Washington. The project team worked closely with these cities to help city staff lead by example and create actionable, implementation-focused strategic energy plans for their own municipal building portfolios and to evaluate and improve city policies. A major focus throughout has been replicability and knowledge transfer (“teaching them to fish” rather than doing the work for the city).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Agentic Diagrammatica: Towards Autonomous Symbolic Computation in High Energy Physics

We present Diagrammatica, a symbolic computation extension to the HEPTAPOD agentic framework, which enables LLM agents to plan and execute multi-step theoretical calculations. Symbolic computation poses a distinctive reliability challenge for LLM agents, as correctness is governed by implicit mathematical conventions that are not encoded in a form that can be easily checked in the computational backend. We identify two complementary remedies, tool-constrained computation and targeted knowledge grounding, and pursue the first as the primary architecture. Concretely, we concentrate the agent's action distribution onto tool calls with convention-fixing semantics, in which the agent specifies a compact, human-auditable diagram specification and a trusted backend performs the symbolic or numerical manipulations exactly. The toolkit provides two complementary calculation paths consuming a shared diagram specification: Naive Dimensional Analysis (NDA) for order-of-magnitude rate estimates and Exact Diagrammatic Analysis (EDA) for tree-level symbolic calculations via automatic FeynCalc code generation, both supplemented by automatic Feynman diagram enumeration and a navigable theory knowledge base. The architecture is validated on two benchmarks: (1) an exhaustive catalog of all tree-level, single-vertex $1\to 2$ partial decay widths across scalar, fermion, and vector parents, with complete massless and threshold limits and Standard Model validation; and (2) an NDA sensitivity study of the muon decay multiplicity $μ^+ \to ν_μ\barν_e + n(e^+e^-) + e^-$, determining the maximum observable $n$ at current and planned muon experiments.

Menzo, Tony [Alabama U.; Fermilab] (ORCID:00000002↗

Phase diagram of the three-dimensional subsystem toric code

Subsystem quantum error-correcting codes typically involve measuring a sequence of noncommuting parity check operators. They can sometimes exhibit greater fault tolerance than conventional codes, which use commuting checks. However, unlike subspace codes, it is unclear if subsystem codes—in particular their advantages—can be understood in terms of ground-state properties of a physical Hamiltonian. In this paper, we address this question for the three-dimensional subsystem toric code (3D STC), as recently constructed by Kubica and Vasmer [], which exhibits single-shot error correction. Motivated by a conjectured relation between single-shot properties and thermal stability, we study the zero- and finite-temperature phases of an associated noncommuting Hamiltonian. By mapping the Hamiltonian model to a pair of 3D Z 2 gauge theories coupled by a kinetic constraint, we find various phases at zero temperature, all separated by first-order transitions: There are 3D toric code-like phases with deconfined point-like excitations in the bulk, and there are phases with a confined bulk supporting a 2D toric code on the surface when appropriate boundary conditions are chosen. The latter is similar to the surface topological order present in 3D STC. However, the similarities between the single-shot correction in 3D STC and the confined phases are only partial: they share the same sets of degrees of freedom, but they are governed by different dynamical rules. Instead, we argue that the process of single-shot error correction can more suitably be associated with a path (rather than a point) in the zero-temperature phase diagram, a perspective, which inspires alternative measurement sequences enabling single-shot error correction. Moreover, since none of the above-mentioned phases survives at nonzero temperature, the single-shot error-correction property of the code does not imply thermal stability of the associated Hamiltonian phase. Published by the American Physical Society 2024

Li, Yaodong (ORCID:0000000337421944)↗

SEAS Communication Engine: An Extensible, Flexible Wrapper for Co-Simulation Agents

When modeling and analyzing the power grid and other large scale systems, researchers often express scenarios as optimization problems and feed them into advanced software solvers. In order to allow multiple solvers to communicate with each other and share data from different domains, the National Renewable Energy Laboratory (NREL) and associated Department of Energy (DOE) labs have developed a software framework called the Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS). HELICS allows cosimulation via a collection of client libraries for different languages that can be called from the appropriate optimization software. However, these client libraries do not provide a higher level of abstraction beyond reading and writing data off of the shared HELICS bus. In this paper, we describe a new software library called the SEAS Communication Engine that exposes a higher-level API for running cosimulation problems. The SEAS Engine provides a class-based abstraction on top of the Python HELICS client, in order to allow users to implement their domain-specific cosimulations without needing to interact with core HELICS primitives. This will make adoption of HELICS and cosimulation in general easier, by exposing a simpler API. In the second part of the paper, we validate our library on a collection of different simulation examples, including the canonical IEEE 13 Bus Feeder. Lastly, we demonstrate using the SEAS Engine to directly call domain-specific code written in the Julia programming language. Our hope is that this will serve as a template for easily calling software in different programming languages via the SEAS Engine, thereby avoiding code duplication and complexity.

co-simulation↗

UEMtomaton: A Source-Available Platform to Aid in Start-up of Ultrafast Electron Microscopy Labs

The steady rise in the number of ultrafast electron microscopy (UEM) labs, in addition to the opacity and lack of detailed descriptions of current approaches that would enable point-by-point construction, has created an opportunity for sharing common methods and instrumentation for (for example) automating data acquisition to assist in efficient lab start-up and to learn about common and robust protocols. In the spirit of open sharing of methods, we provide here a description of an entry-level method and user interface (UI) for automating UEM experiments, and we provide access to the source code and scripts (source-available) for ease of implementation or as a starting reference point for those entering or seeking to enter the field (https://github.com/CEMSFlannigan/UEMtomaton/releases/tag/v1.0). Core instrumentation and physical connections in the UEM lab at Minnesota are described. Interface communication schemes consisting of duo server-client pairs between critical components – the optical delay stage and the UEM digital camera – are presented, with emphasis placed on describing the logic and communications sequence designed to conduct automated series acquisitions. An application designed and programmed with C++/CLI as Windows Forms in Microsoft Visual Studio – dubbed UEMtomaton – is also presented. Key to the UI layout is centralization of the automation tasks and establishment of communication within the software rather than by interfacing with each individual workstation. It is our hope that this note provides useful insight for current and future UEM researchers, particularly with respect to generalizability and portability of the approach to emerging labs. Here, we note that while this basic, entry-level approach is certainly not the most sophisticated or comprehensive of those currently in use, we feel there is nevertheless value in clearly communicating a proven straightforward method to hopefully lower the barrier to entry into the field.

47 OTHER INSTRUMENTATION↗

Intrinsic cooperativity potentiates parallel cis-regulatory evolution

Convergent evolutionary events in independent lineages provide an opportunity to understand why evolution favors certain outcomes over others. We studied such a case where a large set of genes—those coding for the ribosomal proteins—gained cis-regulatory sequences for a particular transcription regulator (Mcm1) in independent fungal lineages. We present evidence that these gains occurred because Mcm1 shares a mechanism of transcriptional activation with an ancestral regulator of the ribosomal protein genes, Rap1. Specifically, we show that Mcm1 and Rap1 have the inherent ability to cooperatively activate transcription through contacts with the general transcription factor TFIID. Because the two regulatory proteins share a common interaction partner, the presence of one ancestral cis-regulatory sequence can ‘channel’ random mutations into functional sites for the second regulator. At a genomic scale, this type of intrinsic cooperativity can account for a pattern of parallel evolution involving the fixation of hundreds of substitutions.

54 ENVIRONMENTAL SCIENCES↗

Neutronics Code Benchmark for Fluoride-Salt-Cooled Reactors

The fluoride-salt-cooled high-temperature reactor (FHR) is an advanced reactor design that aims to improve on the efficiency, cost, safety and non-proliferation security of nuclear energy, while exploiting existing technologies to minimize the design and licensing burden. FHRs share many design features with the high-temperature gas-cooled reactor (HTGR), namely using the same fuel form: a bed of graphite spheres, each with thousands of small coated fuel particles (TRISO) dispersed throughout it. However, rather than using a gas as a coolant, the FHR uses a molten salt which changes the behavior of the system; in particular, from a neutronics perspective, the coolant is no longer effectively transparent to neutrons, but rather contributes both to neutron moderation and absorption. It is difficult to perform exploratory reactor physics experiments for new reactor concepts, as the regulation and cost surrounding a fuel experiment is often highly restrictive and prohibitive. As such, researchers and design engineers must rely heavily on simulation capability to develop a working knowledge for how the reactor physics of a pre-prototypical reactor might behave. It is then essential to have confidence that simulation codes provide credible results. As there are no instances of FHRs deployed to date, nor are there any experimental data available on neutron behavior of pebble fuel immersed in salt, the first step is to perform a code-to-code verification of idealized scenarios that capture the physics involved with an FHR system. This summary describes the development of a code-to-code benchmark for FHR with the purpose of code verification and presents preliminary results. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Spatial inequities in access to medications for treatment of opioid use disorder highlight scarcity of methadone providers under counterfactual scenarios

Access to treatment and medication for opioid use disorder (MOUD) is essential in reducing opioid use and associated behavioral risks, such as syringe sharing among persons who inject drugs (PWID). Syringe sharing among PWID carries high risk of transmission of serious infections such as hepatitis C and HIV. MOUD resources, such as methadone provider clinics, however, are often unavailable to PWID due to barriers like long travel distance to the nearest methadone provider and the required frequency of clinic visits. The goal of this study is to examine the uncertainty in the effects of travel distance in initiating and continuing methadone treatment and how these interact with different spatial distributions of methadone providers to impact co-injection (syringe sharing) risks. A baseline scenario of spatial access was established using the existing locations of methadone providers in a geographical area of metropolitan Chicago, Illinois, USA. Next, different counterfactual scenarios redistributed the locations of methadone providers in this geographic area according to the densities of both the general adult population and according to the PWID population per zip code. We define different reasonable methadone access assumptions as the combinations of short, medium, and long travel distance preferences combined with three urban/suburban travel distance preference. Our modeling results show that when there is a low travel distance preference for accessing methadone providers, distributing providers near areas that have the greatest need (defined by density of PWID) is best at reducing syringe sharing behaviors. However, this strategy also decreases access across suburban locales, posing even greater difficulty in regions with fewer transit options and providers. As such, without an adequate number of providers to give equitable coverage across the region, spatial distribution cannot be optimized to provide equitable access to all PWID. Our study has important implications for increasing interest in methadone as a resurgent treatment for MOUD in the United States and for guiding policy toward improving access to MOUD among PWID.

59 BASIC BIOLOGICAL SCIENCES↗

Threadsafe Dynamic Neighbor Lists for Monte Carlo Ray Tracing

Monte Carlo (MC) transport codes offer high-fidelity modeling of particle transport physics, but their high computational cost makes them impractical for many applications. For some applications such as multiphysics and depletion that use finely discretized geometries, a large portion of this computational cost is attributable to ray tracing. Neighbor lists are a well-known method for accelerating ray-tracing calculations in a MC code, but despite their prevalence, little work has been published on the details of their implementation. The fine details can have a significant impact on performance, particularly when using shared-memory parallelism. This paper addresses these details of implementation with a discussion of different neighbor list schemes and their impact on software runtime. Performance tests were run by using OpenMC on a pin-cell problem discretized with up to 200 axial regions. The results demonstrate that switching from surface-based to cell-based neighbor lists leads to a 10 faster calculation rate for the most fine discretization. Finally, using a threadsafe shared-memory data structure results in a 20% faster calculation rate versus simple threadprivate neighbor lists. Results here show that a data structure that is contiguous in memory improves performance by only 1% to 2% over noncontiguous linked lists.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗