Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Software Framework”

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 1,567 records · Page 87

Snake River Plain Play Fairway Analysis - Phase 1 Report

The Snake River volcanic province (SRP) overlies a thermal anomaly that extends deep into the mantle; it represents one of the highest heat flow provinces in North America. Our goals for this Phase 1 study are to: (1) adapt the methodology of Play Fairway Analysis for geothermal exploration to create a formal basis for its application to geothermal systems, (2) assemble relevant data for the SRP from publicly available and private sources, and (3) build a geothermal play fairway model for the SRP and identify the most promising plays, using software tools that are standard in the petroleum industry. The success of play fairway analysis in geothermal exploration depends critically on defining a systematic methodology that is grounded in theory (as developed within the petroleum industry over the last two decades) and within the geologic and hydrologic framework of real geothermal systems. Our preliminary assessment of the data suggests that important undiscovered geothermal resources may be located in several areas of the SRP, including the western SRP (associated with buried lineaments defined by gravity or magnetic anomalies, and capped by extensive deposits of lacustrine sediment), at lineament intersections in the central SRP (along the Banbury-Hagerman trend NW of Twin Falls, and along the northern margin of the Mt Bennett Hills-Camas Prairie area), and along the margins of the eastern SRP. Additional high temperature resources are likely associated with rhyolite domes and crypto-domes in the eastern SRP, but are masked by shallow groundwater flow leading to low upper crustal heat flow values. These blind resources may be exploitable with existing deep drilling technology. Groundwater modeling planned for later phases of the PFA project will address whether temperatures at viable producing depths are sufficient to support electricity production.

15 GEOTHERMAL ENERGY↗

Interaction of loading pattern and nuclear data uncertainties in reactor core calculations

Along with best-estimate calculations for design and safety analysis, understanding uncertainties is important to determine appropriate design margins. In this framework, nuclear data uncertainties and their propagation to full core calculations are a critical issue. To deal with this task, different error propagation techniques, deterministic and stochastic are currently developed to evaluate the uncertainties in the output quantities. Among these is the sampling based uncertainty and sensitivity software XSUSA which is able to quantify the influence of nuclear data covariance on reactor core calculations. In the present work, this software is used to investigate systematically the uncertainties in the power distributions of two PWR core loadings specified in the OECD UAM-Benchmark suite. With help of a statistical sensitivity analysis, the main contributors to the uncertainty are determined. Using this information a method is studied with which loading patterns of reactor cores can be optimized with regard to minimizing power distribution uncertainties. It is shown that this technique is able to halve the calculation uncertainties of a MOX/UOX core configuration. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Plant-wide simulation model for transient studies on the XE-100 - 18464

This paper gives an overview of the plant-wide simulation model that is used by X-energy LLC for developing their plant design and control philosophy, as well as assessing plant upset conditions. The simulation model was created in Flownex{sup R} thermal-fluid system simulation software, which solves mass, momentum and energy equations for compressible, incompressible and homogeneous two-phase flow. The plant model encompasses all major components, from reactor to condenser, including main control loop elements. The paper pays particular attention to the validation of the two-phase flow framework used for the secondary steam cycle. Two steady-state validation cases are done using operational data from the THTR. Validation of transient operation is done by simulating density wave oscillations, a type of system-level boiling phenomenon. This is regarded as a thorough test of transient capability because of the challenges this phenomenon poses to several aspects of the calculation and to the consistency of the code as a whole. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Towards A Theory of Autonomous Reconstitution of Compromised Cyber-Systems

The ability to maintain mission-critical operations in cyber-systems in the face of disruptions is critical. Faults in cyber systems can come from accidental sources (e.g., natural failure of a component) or deliberate sources (e.g., an intelligent adversary). Natural and intentional manipulation of data, computing, or coordination are the most impactful ways that an attacker can prevent an infrastructure from realizing its mission goals. Under these conditions, the ability to reconstitute critical infrastructure becomes important. Specifically, the question is: Given an intelligent adversary, how can cyber systems respond to keep critical infrastructure operational? In cyber systems, the distributed nature of the system poses serious difficulties in maintaining operations, in part due to the fact that a centralized command and control apparatus is unlikely to provide a robust framework for resilience. Resilience in cyber-systems, in general, has several components, and requires the ability to anticipate and withstand attacks or faults, as well as recover from faults and evolve the system to improve future resilience. The recovery effort (and any subsequent evolution) may require significant reconfiguration of the system (at all levels – hardware, software, services, permissions, etc.) if the system is to be made resilient to further attack or faults. This is especially important in the case of ongoing attacks, where reconfiguration decisions must be taken with care to avoid further compromising the system while maintaining continuity of operations. Collectively, we will label this recovery and evolution process as “reconstitution”. Currently, reconstitution is performed manually, generally after-the-fact, and usually consists of either standing up redundant systems, check-points (rolling back the configuration to a “clean” state), or re-creating the system using “gold-standard” copies. For enterprise systems, such reconstitution may be performed either directly on hardware, or using virtual machines. A significant challenge within this context is the ability to verify that the reconstitution is performed in a manner that renders the cyber-system resilient to ongoing and future attacks or faults. Fundamentally, the need is to determine optimal configuration of the cyber system when a fault is determined to be present. While existing theories for fault tolerance (for example, Byzantine fault tolerance) can guarantee resilience under certain conditions, in practice, these theories can break down in the face of an intelligent adversary. Further, it is difficult, in a dynamically evolving environment, to determine whether the necessary conditions for resilience have been met, resulting in difficulties in achieving resilient operation. In addition, existing theories do not sufficiently take into account the cost for attack and defense (the adversary is generally assumed to have infinite resources and time), hierarchy of importance (all network resources are assumed to be equally important), and the dynamic nature of some attacks (i.e., as the attack evolves, can resilience be maintained?). Alternative approaches to resilience based on a centralized command and control structure suffer from a single-point-failure. This paper presents preliminary research towards concepts for effective autonomous reconstitution of compromised cyber systems. We describe a mathematical framework as a first step towards a theoretical basis for autonomous reconstitution in dynamic cyber-system environments. We then propose formulating autonomous reconstitution as an optimization problem and describe some of the challenges associated with this formulation. This is followed by a brief discussion on potential solutions to these challenges.

asymmetric resilience↗

Effect of Flexibility in Molecular Simulations of Carbon Dioxide Adsorption and Diffusion in a Cuprous Triazolate Framework

Using fixed atom force fields to model gas adsorption in flexible metal organic frameworks (MOFs) is known to pose difficulties in accurately reproducing and predicting experimental results. This paper studies the difference in accuracy between flexible and fixed atom force fields in reproducing CO 2 adsorption measurements in MAF-2 ([Cu(etz)]∞ (MAF-2, Hetz) 3,5-diethyl-1,2,4-triazole), an NbO-type triazolate scaffold with a bcu cavity system and attached ethyl groups. The flexible force field used to run the hybrid molecular dynamics and grand canonical Monte Carlo calculations were generated using the QuickFF software incorporating van der Waals parameters from the Universal Force Field (UFF) and density derived electrostatic and chemical (DDEC) charges. The fixed atom force field used was composed of UFF van der Waals parameters together with DDEC charges. The calculations were run at 298 K and at pressures of 0.1, 0.3, 0.5, 0.8, and 1 bar. It was observed that for this MOF the rigid force field overpredicted gas adsorption, whereas the flexible force field values closely matched experimental data. In the flexible structure, the freely moving ethyl groups of MAF-2 hindered adsorption, reducing the interaction energy between CO 2 and the N atoms of the triazolate framework as well as reducing the size of the largest cavity diameter. Here, the combination of these factors led to improved prediction of adsorption values with the flexible forcefield as compared to the rigid forcefield, demonstrating the need for modeling MOFs in a way more indicative of their behavior.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

RVA. 3-D Visualization and Analysis Software to Support Management of Oil and Gas Resources

A free software application, RVA, has been developed as a plugin to the US DOE-funded ParaView visualization package, to provide support in the visualization and analysis of complex reservoirs being managed using multi-fluid EOR techniques. RVA, for Reservoir Visualization and Analysis, was developed as an open-source plugin to the 64 bit Windows version of ParaView 3.14. RVA was developed at the University of Illinois at Urbana-Champaign, with contributions from the Illinois State Geological Survey, Department of Computer Science and National Center for Supercomputing Applications. RVA was designed to utilize and enhance the state-of-the-art visualization capabilities within ParaView, readily allowing joint visualization of geologic framework and reservoir fluid simulation model results. Particular emphasis was placed on enabling visualization and analysis of simulation results highlighting multiple fluid phases, multiple properties for each fluid phase (including flow lines), multiple geologic models and multiple time steps. Additional advanced functionality was provided through the development of custom code to implement data mining capabilities. The built-in functionality of ParaView provides the capacity to process and visualize data sets ranging from small models on local desktop systems to extremely large models created and stored on remote supercomputers. The RVA plugin that we developed and the associated User Manual provide improved functionality through new software tools, and instruction in the use of ParaView-RVA, targeted to petroleum engineers and geologists in industry and research. The RVA web site (http://rva.cs.illinois.edu) provides an overview of functions, and the development web site (https://github.com/shaffer1/RVA) provides ready access to the source code, compiled binaries, user manual, and a suite of demonstration data sets. Key functionality has been included to support a range of reservoirs visualization and analysis needs, including: sophisticated connectivity analysis, cross sections through simulation results between selected wells, simplified volumetric calculations, global vertical exaggeration adjustments, ingestion of UTChem simulation results, ingestion of Isatis geostatistical framework models, interrogation of joint geologic and reservoir modeling results, joint visualization and analysis of well history files, location-targeted visualization, advanced correlation analysis, visualization of flow paths, and creation of static images and animations highlighting targeted reservoir features.

97 MATHEMATICS AND COMPUTING↗

Portable SHMEMCache: A High-Performance Key-Value Store on OpenSHMEM and MPI

The integration of Big Data frameworks and HPC capabilities has drawn enormous interests in recent years. SHMEMCache is a distributed key-value store built on the OpenSHMEM global address space. It has solved several practical issues in leveraging OpenSHMEM’s one-sided operations for a distributed key-value store and providing efficient key-value operations on both commodity machines and supercomputers. However, being based solely on OpenSHMEM, SHMEMCache cannot leverage one-sided operations from a variety of software packages. This results in several limitations for SHMEMCache. First, we cannot make SHMEMCache available to a wider range of platforms. Second, an opportunity for potential performance improvement is missed. Third, there is a lack of deep understanding about how different one-sided operations can fit in with SHMEMCache and other distributed key-values in general. For example, the one-sided operations in OpenSHMEM and MPI have many differences in their interfaces, memory semantics and synchronization methods, all of which can have distinct implications and also increase the complexity in supporting both OpenSHMEM and MPI for SHMEMCache. Therefore, we have taken on an effort on leveraging different one-sided operations for SHMEMCache and proposed a design of portable SHMEMCache. Based on this new framework, we have supported both OpenSHMEM and MPI for SHMEMCache. We have also conducted an extensive set of experiments to compare the performance of the two versions on both commodity machines and the Titan supercomputer.

Computer Science↗

Constructing Self-Labeled Materials Imaging Datasets from Open Access Scientific Journals with EXSCLAIM!

Due to recent improvements in image resolution and acquisition speeds, materials microscopy is experiencing an explosion in imaging data. Yet, despite the volume of images generated, the overall accessibility landscape is highly fragmented, as researchers who do release images to the public, often only do so as snapshots of their larger private dataset in context of scientific journal publications. The effort to automatically consolidate images and descriptive information from web-based platforms has garnered broad attention from the computer vision, language technologies, and chemistry/materials informatics communities. However, these methods are problematic for scientific figures because over 30% of figures are compound in nature, and it is the individual images themselves, paired with relevant context, that are necessary for construction a proper labeled dataset. To this end, we outline in this paper the design of a software pipeline for the automatic EXtraction, Separation, and Caption-based natural Language Annotation of IMages from scientific figures (EXSCLAIM!). Successful consolidation of materials imaging across literature sources will enhance navigation and searchability of materials microscopy images for both novice and experienced researchers, as well as establish the framework necessary for users to search by images, text, or some combination of both.

36 MATERIALS SCIENCE↗

Using a Coarse-Grained Modeling Framework to Identify Oligomeric Motifs with Tunable Secondary Structure

Coarse-grained modeling can be used to explore general theories that are independent of specific chemical detail. In this paper, we present cg_openmm, a Python-based simulation framework for modeling coarse-grained hetero-oligomers and screening them for structural and thermodynamic characteristics of cooperative secondary structures. cg_openmm facilitates the building of coarse-grained topology and random starting configurations, setup of GPU-accelerated replica exchange molecular dynamics simulations with the OpenMM software package, and features a suite of postprocessing thermodynamic and structural analysis tools. In particular, native contact analysis, heat capacity calculations, and free energy of folding calculations are used to identify and characterize cooperative folding transitions and stable secondary structures. In this work, we demonstrate the capabilities of cg_openmm on a simple 1–1 Lennard-Jones coarse-grained model, in which each residue contains 1 backbone and 1 side-chain bead. By scanning both nonbonded and bonded force-field parameter spaces at the coarse-grained level, we identify and characterize sets of parameters which result in the formation of stable helices through cooperative folding transitions. Furthermore, we show that the geometries and stabilities of these helices can be tuned by manipulating the force-field parameters.

36 MATERIALS SCIENCE↗

Kubernetes for the Deep Underground Neutrino Experiment Data Acquisition

The Deep Underground Neutrino Experiment (DUNE) is a next-generation long-baseline neutrino experiment based in the USA which is expected to start taking data in 2029. DUNE aims to precisely measure neutrino oscillation parameters by detecting neutrinos from the LBNF beamline (Fermilab) at the Far Detector, 1,300 kilometres away, in South Dakota at the Sanford Underground Research Facility. The Far Detector will consist of four cryogenic Liquid Argon Time Projection Chamber detectors of 17 kT, each producing more than 1 TB/sec of data. The main requirements for the data acquisition system are the ability to run continuously for extended periods of time, with a 99% up-time requirement, and the functionality to record both beam neutrinos and low energy neutrinos from the explosion of a neighbouring supernova, should one occur during the lifetime of the experiment. The key challenges are the high data rates that the detectors generate and the deep underground environment, which places constraints on power and space. To overcome these challenges, DUNE plans to use a highly optimised C++ software suite and a server farm of about 110 nodes continuously running about two hundred multicore processes located close to the detector, 1.5 kilometres underground. Thirty nodes will be at the surface and will run around two hundred processes simultaneously. DUNE is studying the use of the Kubernetes framework to manage containerised workloads and take advantage of its resource definitions and high up-time services to run the DAQ system. Progress in deploying these systems at the CERN neutrino platform on the prototype DUNE experiments is reported.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A formally certified end-to-end implementation of Shor’s factorization algorithm

Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. While hardware-level decoherence errors have garnered significant attention, a less recognized obstacle to correctness is that of human programming errors—“bugs.” Techniques familiar to most programmers from the classical domain for avoiding, discovering, and diagnosing bugs do not easily transfer, at scale, to the quantum domain because of its unique characteristics. To address this problem, we have been working to adapt formal methods to quantum programming. With such methods, a programmer writes a mathematical specification alongside the program and semiautomatically proves the program correct with respect to it. The proof’s validity is automatically confirmed—certified—by a “proof assistant.” Formal methods have successfully yielded high-assurance classical software artifacts, and the underlying technology has produced certified proofs of major mathematical theorems. As a demonstration of the feasibility of applying formal methods to quantum programming, we present a formally certified end-to-end implementation of Shor’s prime factorization algorithm, developed as part of a framework for applying the certified approach to general applications. By leveraging our framework, one can significantly reduce the effects of human errors and obtain a high-assurance implementation of large-scale quantum applications in a principled way.

Science & Technology - Other Topics↗

Linear response of light deformed nuclei investigated by self-consistent quasiparticle random-phase approximation

We present a calculation of the properties of vibrational states in deformed, axially-symmetric even-even nuclei, within the framework of a fully self-consistent quasiparticle random phase approximation (QRPA). The same Skyrme energy density and density-dependent pairing functionals are used to calculate the mean field and the residual interaction in the particle-hole and particle-particle channels. We have tested our software in the case of spherical nuclei against fully self-consistent calculations published in the literature, finding excellent agreement. We investigate the consequences of neglecting the spin-orbit and Coulomb residual interactions in QRPA. Furthermore we discuss the improvement obtained in the QRPA result associated with the removal of spurious modes. Isoscalar and isovector responses in the deformed {sup 24-26}Mg, {sup 34}Mg isotopes are presented and compared to experimental findings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Towards Scalable Optimal Sequence Homology Detection

Abstract—The field of bioinformatics and computational biol- ogy is experiencing a data revolution — experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. This has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a funda- mental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large- scale optimal homology detection on massively parallel super- computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 × 107 optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

Daily, Jeffrey A.↗

UnitTesterSG

UnitTesterSG is a unit testing framework that is designed for nested and/or scientific/engineering data structures. It is designed primarily for testing the outputs if a single function or simulation run by storing the expected results file such that comparisons to the stored output can be made with unit tests after the function or software has been edited. This module is designed to be able to unit test arrays, strings, as well as nested and deeply nested objects (including arrays with tuples inside, arrays with strings inside, etc.). The module is compatable with nested objects, and thus has a dependency on the nestedObjectsFunctions module within. The module takes *calculated* results and then compares them to *expected* results. If no expected results are available (or they do not match the calculated results) the module then offers to store the calculated results as expected results for next time.

Savara, Aditya [Oak Ridge National Lab. (ORNL), Oa↗

A Polyhedral Transformation Framework for Compiler Optimization (Final Project Report)

The project developed the polyhedral compiler transformation module PolyOpt/Fortran in the ROSE compiler framework. PolyOpt/Fortran performs automated transformation of affine loop nests within FORTRAN programs for enhanced data locality and parallel execution. A FORTAN version of the Polybench library was also developed by the project. A third development was a dynamic analysis approach to gauge vectorization potential within loops of programs; software (DDVec) for automated instrumentation and dynamic analysis of programs was developed.

97 MATHEMATICS AND COMPUTING↗

Opportunities in AI/ML for the Rubin LSST Dark Energy Science Collaboration

The Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST) will produce unprecedented volumes of heterogeneous astronomical data (images, catalogs, and alerts) that challenge traditional analysis pipelines. The LSST Dark Energy Science Collaboration (DESC) aims to derive robust constraints on dark energy and dark matter from these data, requiring methods that are statistically powerful, scalable, and operationally reliable. Artificial intelligence and machine learning (AI/ML) are already embedded across DESC science workflows, from photometric redshifts and transient classification to weak lensing inference and cosmological simulations. Yet their utility for precision cosmology hinges on trustworthy uncertainty quantification, robustness to covariate shift and model misspecification, and reproducible integration within scientific pipelines. This white paper surveys the current landscape of AI/ML across DESC's primary cosmological probes and cross-cutting analyses, revealing that the same core methodologies and fundamental challenges recur across disparate science cases. Since progress on these cross-cutting challenges would benefit multiple probes simultaneously, we identify key methodological research priorities, including Bayesian inference at scale, physics-informed methods, validation frameworks, and active learning for discovery. With an eye on emerging techniques, we also explore the potential of the latest foundation model methodologies and LLM-driven agentic AI systems to reshape DESC workflows, provided their deployment is coupled with rigorous evaluation and governance. Finally, we discuss critical software, computing, data infrastructure, and human capital requirements for the successful deployment of these new methodologies, and consider associated risks and opportunities for broader coordination with external actors.

Aubourg, Eric [APC, Paris] (ORCID:000000025592023X↗

Accelerating Development of EV Batteries Through Computer-Aided Engineering (Presentation)

The Department of Energy's Vehicle Technology Program has launched the Computer-Aided Engineering for Automotive Batteries (CAEBAT) project to work with national labs, industry and software venders to develop sophisticated software. As coordinator, NREL has teamed with a number of companies to help improve and accelerate battery design and production. This presentation provides an overview of CAEBAT, including its predictive computer simulation of Li-ion batteries known as the Multi-Scale Multi-Dimensional (MSMD) model framework. MSMD's modular, flexible architecture connects the physics of battery charge/discharge processes, thermal control, safety and reliability in a computationally efficient manner. This allows independent development of submodels at the cell and pack levels.

25 ENERGY STORAGE↗

Cam Cal - Version 1.0

The camcal package provides camera calibration utilities and C++ drivers to support visual targeting within the Umbra framework. The camera calibration model combines a 4-parameter distortion model, an intrinsic matrix and an extrinsic matrix representation. A table look up allows all of these matrices to be updated based upon a "zoom" parameter which moves between 0 (full -wide) and 1(full-zoom). The software includes a TclfTk Gui tool for calibrating zoom cameras, camera functions for implementing the active sketch visual targeting paradigm, and a SoS (System of System) class that wraps up this functionality.

Source record↗