Search NASA⌕ Search

SEARCH · Search NASA

Results for “interface algorithm”

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 109 records · Page 6

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Development of Microreactor Automated Control System (MACS): Surrogate Plant-level Modeling and Control Algorithms Integration

This report discusses progress on the modeling and integration task as part of the development of Microreactor Automated Control System (MACS). What follows is a discussion of the software tools used to develop a surrogate microreactor plant-level model, MACS module development, and a summary of the findings from integration with a hardware-in-the-loop (HIL) setup at Idaho National Laboratory (INL). Oak Ridge National Laboratory worked with INL to understand available hardware at INL (such as existing control platforms). With this information and using a preliminary framework for MACS with software interfaces defined, surrogate models and initial automated control algorithms were created for integration into the hardware to provide a HIL demonstration platform for MACS. Available reduced order reactor models that leverage existing microreactor neutronics and thermal hydraulics models have been integrated in the surrogate plant-level model. The surrogate model has been evaluated for sensitivity of all parameters and the MACS software modules (including the surrogate model) have been demonstrated to interact with the hardware. The integration, however, pointed to the need for further improvements to the framework—and specifically improvements to the interfaces to ensure that the HIL simulator is capable of longer-term stable operation with MACS in the loop. These improvements will be the focus of future research.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Highly Asynchronous Visitor Queue Graph Toolkit

HavoqGT (Highly Asynchronous Visitor Queue Graph Toolkit) is a framework for expressing asynchronous vertex-centric graph algorithms, and executing them on High Performance Computing (HPC) systems. It provides a vertex 'visitor' interface, where actions are defined at an individual vertex level, and contains a suite of classic graph algorithms. HavoqGT is capable of processing large graphs stored in NVRAM (SSDs) using a memory mapped interface.

Reza, TahsinA.↗

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗

Multidimensional Tests of a Finite-Volume Solver for MHD With a Real-Gas Equation of State

This work considers two algorithms of a finite-volume solver for the MHD equations with a real-gas equation of state (EOS). Both algorithms use a multistate form of Harten-Lax-Van Leer approximate Riemann solver as formulated for MHD discontinuities. This solver is modified to use the generalized sound speed from the real-gas EOS. Two methods are tested: EOS evaluation at cell centers and at flux interfaces where the former is more computationally efficient. A battery of 1D and 2D tests are employed: convergence of 1D and 2D linearized waves, shock tube Riemann problems, a 2D nonlinear circularly polarized Alfvén wave, and a 2D magneto-Rayleigh-Taylor instability test. The cell-centered EOS evaluation algorithm produces unresolvable thermodynamic inconsistencies in the intermediate states leading to spurious solutions while the flux-interface EOS evaluation algorithm robustly produces the correct solution. The linearized wave tests show this inconsistency is associated with the magnetosonic waves and the magneto-Rayleigh-Taylor instability test demonstrates simulation findings where the spurious solution leads to an unphysical simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Mitigate: An Adaptive Network Data Anonymization Tool Using Condensation-Based Differential Privacy

Modern network devices collect a large amount of data that can be analyzed to identify bottlenecks, anomalies, cyber-attacks, etc. Therefore, there is often a need to analyze such collections of network data quite often by an external expert or by the research community. However, these collections of data contain sensitive, proprietary information. In order for the network data to be shared, it must first be anonymized. The overall objective of this project is to develop an innovative privacy management tool to anonymize network data and achieve sufficient privacy, acceptable data utility, and efficient data analysis at the same time. No existing anonymization methods can achieve all of these at the same time. The core of this technology is a differential private clustering algorithm that provides strong privacy protection, preserves data properties important for subsequent analysis, and allows the party receiving the anonymized data to conduct analysis directly on anonymized data without the need of decryption or any extra processing. The research carried out was to design, implement and verify a solution to this problem by completing the following tasks: 1) developing the core technology; 2) developing a context based method that automatically recommends fields that must be anonymized; 3) conducted experiments showing superior results using our approach compared to existing tools, and 4) developed an intuitive but basic user interface. The research that was conducted generated novel algorithmic techniques that utilize state-of-the-art methods such as condensation, differential privacy preservation, clustering, automated tuning based on contextual awareness, and recommendation techniques to specify columns to users for anonymization leading to optimal privacy that allows research analysis on the dataset. Experiments were conducted to evaluate the efficacy of these novel algorithmic techniques by performing analysis on original non-anonymized datasets, then conducting analysis on the same yet anonymized datasets and comparing the results of the analyses. Overall, the anonymized analysis results were within 1% of the original results, verifying that the generated technology not only guarantees a high level of privacy but also enables research analysis as if it were conducted on the original dataset. Potential applications of this technology include anonymization of any type of structured network datasets that contain sensitive identifiers, such as IP addresses, that can be used in multiple applications. For example, to create an AI or machine learning model for cyber security, e.g., to detect attacks, or for performance analysis, e.g., identify bottlenecks or predict performance. In addition, a market analysis that was conducted for potential applications of this technology identified a broader range of applications of our anonymization technology beyond the network sector that includes healthcare, banking, insurance, securities, finance (FISB), data brokering, cloud services, ad sales, and government.

97 MATHEMATICS AND COMPUTING↗

PyApprox: Enabling efficient model analysis

PyApprox is a Python-based one-stop-shop for probabilistic analysis of scientific numerical models. Easy to use and extendable tools are provided for constructing surrogates, sensitivity analysis, Bayesian inference, experimental design, and forward uncertainty quantification. The algorithms implemented represent the most popular methods for model analysis developed over the past two decades, including recent advances in multi-fidelity approaches that use multiple model discretizations and/or simplified physics to significantly reduce the computational cost of various types of analyses. Simple interfaces are provided for the most commonly-used algorithms to limit a user’s need to tune the various hyper-parameters of each algorithm. However, more advanced work flows that require customization of hyper-parameters is also supported. An extensive set of Benchmarks from the literature is also provided to facilitate the easy comparison of different algorithms for a wide range of model analyses. This paper introduces PyApprox and its various features, and presents results demonstrating the utility of PyApprox on a benchmark problem modeling the advection of a tracer in ground water.

97 MATHEMATICS AND COMPUTING↗

High-throughput ab initio design of atomic interfaces using InterMatch

Forming a hetero-interface is a materials-design strategy that can access an astronomically large phase space. However, the immense phase space necessitates a high-throughput approach for an optimal interface design. Here we introduce a high-throughput computational framework, InterMatch, for efficiently predicting charge transfer, strain, and superlattice structure of an interface by leveraging the databases of individual bulk materials. Specifically, the algorithm reads in the lattice vectors, density of states, and the stiffness tensors for each material in their isolated form from the Materials Project. From these bulk properties, InterMatch estimates the interfacial properties. We benchmark InterMatch predictions for the charge transfer against experimental measurements and supercell density-functional theory calculations. We then use InterMatch to predict promising interface candidates for doping transition metal dichalcogenide MoSe 2 . Finally, we explain experimental observation of factor of 10 variation in the supercell periodicity within a few microns in graphene/α-RuCl 3 by exploring low energy superlattice structures as a function of twist angle using InterMatch. We anticipate our open-source InterMatch algorithm accelerating and guiding ever-growing interfacial design efforts. Moreover, the interface database resulting from the InterMatch searches presented in this paper can be readily accessed online.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multi-material hydrodynamics with algebraic sharp interface capturing

A finite volume method for Eulerian multi-material hydrodynamics with sharp interface capturing is presented here. The pressure-temperature non-equilibrium multi-material system with finite-rate pressure relaxation in mixed-cells is considered here. This pressure closure facilitates material-property-dependent pressure relaxation, rather than instantaneous pressure equilibration, which in turn allows the use of unsplit high-order time-integrators. A modified tangent of hyperbola for interface capturing (THINC) method is used to reconstruct multi-material (> 2) interfaces, on three-dimensional unstructured meshes. A simple modification which extends the THINC reconstruction to interfaces between more than two materials is proposed. It is demonstrated that the modified THINC can capture multi-material interfaces within 2–4 tetrahedral cells. Since no geometric reconstructions are required by the THINC method, the presented multi-material method is algorithmically simple, and computationally efficient. Consistent reconstructions of conserved quantities at material interfaces ensure that conservation and closure laws are satisfied at the discrete level. Through a suite of test problems solved on unstructured meshes, it is demonstrated that the presented method is a promising candidate for accurate and efficient multi-material hydrodynamics computations.

97 MATHEMATICS AND COMPUTING↗

WISP: Watching grid Infrastructure Stealthily through Proxies (Final Technical Report)

The complex interdependencies of cyber systems (sensors and communications), physical grids and associated electricity market operations make protecting electric power grids a significant challenge. The energy sector is constantly under new, targeted, advanced and dangerous cyber-attacks that have the potential to result in the loss of human life. These threats are further exacerbated by our need to modernize the grid. One focus of cyber security research in smart grids is the securing of the SCADA system through advanced intrusion detection systems (IDS) and bad data detection algorithms in state estimation. These methods either require full knowledge of the system topology and parameters or fail to understand the physical behaviors under attack. WISP (Watching grid Infrastructure Stealthily through Proxies) is designed to provide additional protection to the power grid using only publicly available data. In particular, WISP exploits the spatio-temporal nature of the real time locational marginal prices (LMPs), in conjunction with other information such as bids, weather, outages and load data to analyze anomalous power pricing behaviors and then correlate those observations to localize regions of interest and identify potential cyber events. WISP is non-intrusive as the tool is deployed as a service in the Cloud or on premise and provides reliable information to system operators for enhanced situational awareness, without impeding energy delivery functions. The WISP technology comprises three modules: the data-driven anomaly detection core, the vulnerability and risk analysis and the root cause analysis. The data-driven anomaly detection core performs the tasks of feature selection, anomaly detection and attack region localization. The vulnerability and risk analysis module provides system level information of the vulnerable variables and times, assisting the operators in selecting monitoring and protection nodes. The root cause analysis module takes the detection results and identifies potential operational conditions that contribute to the detected anomalies. In Phase I, we have demonstrated the feasibility and effectiveness of WISP. We developed a realistic electricity market simulator capable of generating normal and attack market data under various operational conditions. We developed a series of cyber-attack detection and analysis algorithms and evaluated them under multiple data sources. Finally, we integrated all modules into an end-to-end software, providing functions for data management, data analytics and visualization. Specifically, we have achieved: (i) real-time data acceptance from external utility interfaces with >99% acceptance rate; (ii) high performance anomaly detection algorithms with >98% detection accuracy and <0.1% false alarm rate; and (iii) ultra-low computing delay <50 milliseconds. Additionally, our team developed algorithms to identify the vulnerable variables in electricity market operations and root cause analysis functions to identify major contributors to the price spikes. These ancillary modules are necessary when deploying WISP in real world industry environment. In Phase II, we have demonstrated the effectiveness of WISP software on realistic largescale power systems. We performed red team testing for the Phase I WISP software and identified software vulnerabilities and implemented corresponding mitigation solutions. We adapted the electricity market simulator for the Texas synthetic 2000-bus system and generated datasets for the false data injection attacks. We created database and visualization interfaces for the Texas system and the ISO New England system. We performed software optimization in terms of operation efficiency, computing speed and detection accuracy. Finally, we tested the software on the Texas system and the ISO New England system and evaluated the detection performance. Overall, we achieved above 89% detection rate, below 3% false alarm rate and below 37 seconds of end-to-end detection delay.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Metall: A persistent memory allocator for data-centric analytics

Data analytics applications transform raw input data into analytics-specific data structures before performing analytics. Unfortunately, such data ingestion steps are often more expensive than analytics. In addition, various types of NVRAM devices are already used in many HPC systems today. Such devices will be useful for storing and reusing data structures beyond a single process life cycle. We developed Metall, a persistent memory allocator built on top of the memory-mapped file mechanism. Metall enables applications to transparently allocate custom C++ data structures into various types of persistent memories. Metall incorporates a concise and high-performance memory management algorithm inspired by Supermalloc and the rich C++ interface developed by Boost.Interprocess library. On a dynamic graph construction workload, Metall achieved up to 11.7x and 48.3x performance improvements over Boost.Interprocess and memkind (PMEM kind), respectively. We also demonstrate Metall’s high adaptability by integrating Metall into a graph processing framework, GraphBLAS Template Library. Here this study’s outcomes indicate that Metall will be a strong tool for accelerating future large-scale data analytics by allowing applications to leverage persistent memory efficiently.

97 MATHEMATICS AND COMPUTING↗

CVEVOLVE

CVEvolve is an agentic AI system for autonomous algorithm discovery for scientific data processing. It creates workflows where large language model agents freely set up and configure development environments and evaluation harnesses, develop and improve data processing algorithms with designed exploration-exploitation balancing mechanisms, log history and findings in a structured database, and run holdout testing to ensure algorithm generalizability. CVEvolve offers a zero-code interface and does not require users to provide structured data and evaluation scripts.

Cherukara, MatthewJoseph [Argonne National Laborat↗

SAS4A/SASSYS-1 Verification Testing for Sodium Fast Reactor Application: Acceptance Testing Report

AS4A/SASSYS-1 (SAS) is a simulation tool used to perform deterministic analyses of anticipated events as well as design basis and beyond design basis accidents for advanced liquid-metal-cooled nuclear reactors. With its origin as SAS1A in the late 1960s, the SAS series of codes has been under continuous use and development for over sixty years and represents a critical investment in safety analysis capabilities for the U.S. Department of Energy. To support the dedication effort, this report has been generated to provide a detailed description of the available verification testing. The verification testing presented in this report captures functionality testing, focusing mainly on the testing of specific functions and algorithms for accuracy and precision of output, and interface testing, focusing mainly on the testing of critical input parameters and their valid ranges. Although SAS was developed to support the analysis of any liquid-metal-cooled nuclear reactor, the testing described in this document primarily focuses on the verification of SAS capabilities as they relate to a generic pool-type Sodium Fast Reactor (SFR).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PID-Regulated Heating System for PIP-II Reference Line

The Proton Improvement Project-2 centers on building a new superconducting linear particle accelerator (Linac) at Fermilab. At the heart of the accelerator is the reference line, a critical system that defines the ideal path for the particle beam as it passes through magnets, RF cavities, and other beamline elements. Temperature stability is crucial for the reliable operation of RF components, such as mixers and filters. Fluctuations affect key performance parameters like conversion loss, isolation, and linearity. To mitigate any drift caused by ambient temperature changes, a heating plate assembly is utilized to maintain key components at a controlled temperature of 40°C. The system utilizes an aluminum 36”x36”x0.5” heat plate powered by a MOSFET-based control circuit, delivering approximately 460 W of thermal energy through a resistor array. Real-time temperature feedback is provided by a PT100 Resistance Temperature Detector (RTD), which interfaces with a Proportional–Integral–Derivative (PID) control algorithm to maintain closed-loop temperature regulation. The control signal actively modulates the gate voltage of an N channel MOSFET, dynamically adjusting power delivery in response to deviations from the temperature setpoint. Simulations and LTspice models validate the functionality and responsiveness of the circuit under varying conditions. The prototype has successfully demonstrated stable thermal control, paving the way for integration into the PIP-II infrastructure. The final design will feature an expanded resistor array, as well as communication with a PLC for continuous data acquisition and diagnostics. This work directly supports Fermilab’s broader mission by contributing to the stability and reliability of core accelerator systems, enhancing the precision of particle beam delivery for future physics experiments.

Mosher, Alexander [Fermilab]↗

A Multicomponent Reactive Transport Model for Integrated Surface‐Subsurface Hydrology Problems

Abstract Despite the widespread use of integrated hydrology models in a variety of applications, consideration of multicomponent reactive transport is still not common. The implementation of these processes requires coupling transport at the surface‐subsurface interface and efficient solution of the non‐linear geochemical model that is consistent with the integrated hydrology solution. The Advanced Terrestrial Simulator provides a flexible multiphysics framework that facilitated this process. In this work, the integrated reactive transport process kernel (PK) was weakly coupled to the integrated hydrology PK. In turn, integrated transport and reactions were coupled using an operator splitting approach. This splitting enabled an explicit solution of the integrated transport problem, including a novel algorithm to calculate exchange fluxes across the surface‐subsurface interface and a point‐by‐point solution of the geochemical problem. Geochemical capabilities were added using well‐established external codes, but rather than using a custom interface to each, a generic interface was used that clearly specifies the variables and operations used by the chemistry PK. The implementation is demonstrated with two example simulations: transport of a tracer in a soil column as it saturates over time and water ponds on the surface and reactive transport in a hillslope driven by successive wet‐dry cycles that result in infiltration, runoff and exfiltration processes.

54 ENVIRONMENTAL SCIENCES↗

GPU-accelerated multitiered iterative phasing algorithm for fluctuation X-ray scattering

The multitiered iterative phasing (MTIP) algorithm is used to determine the biological structures of macromolecules from fluctuation scattering data. It is an iterative algorithm that reconstructs the electron density of the sample by matching the computed fluctuation X-ray scattering data to the external observations, and by simultaneously enforcing constraints in real and Fourier space. This paper presents the first ever MTIP algorithm acceleration efforts on contemporary graphics processing units (GPUs). The Compute Unified Device Architecture (CUDA) programming model is used to accelerate the MTIP algorithm on NVIDIA GPUs. The computational performance of the CUDA-based MTIP algorithm implementation outperforms the CPU-based version by an order of magnitude. Furthermore, the Heterogeneous-Compute Interface for Portability (HIP) runtime APIs are used to demonstrate portability by accelerating the MTIP algorithm across NVIDIA and AMD GPUs.

97 MATHEMATICS AND COMPUTING↗

High speed two-dimensional event detection and imaging using an analog interface and a massively parallel processor

A quantitative pulse count (event detection) algorithm with linearity to high count rates is accomplished by combining a high-speed, high frame rate camera with simple logic code run on a massively parallel processor such as a GPU or a FPGA. The parallel processor elements examine frames from the camera pixel by pixel to find and tag events or count pulses. The tagged events are combined to form a combined quantitative event image.

Waugh, Justin↗