Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational frameworks”

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,477 records · Page 82

Generation of feasible integer solutions on a massively parallel computer using the feasibility pump

Here, we present an approach to parallelize generation of feasible mixed integer solutions of mixed integerlinear programs in distributed memory high performance computing environments. This approachcombines a parallel framework with feasibility pump (FP) as the rounding heuristic. It runs multiple FPinstances with different starting solutions concurrently, while allowing them to share information. Ourcomputational results suggest that the improvement resulting from parallelization using our approach is statistically significant.

97 MATHEMATICS AND COMPUTING↗

Augmented Gaussian random field: Theory and computation

We propose the novel augmented Gaussian random field (AGRF), which is a universal framework incorporating the data of observable and derivatives of any order. Rigorous theory is established. We prove that under certain conditions, the observable and its derivatives of any order are governed by a single Gaussian random field, which is the aforementioned AGRF. As a corollary, the statement "the derivative of a Gaussian process remains a Gaussian process" is validated, since the derivative is represented by a part of the AGRF. Moreover, a computational method corresponding to the universal AGRF framework is constructed. Both noiseless and noisy scenarios are considered. Formulas of the posterior distributions are deduced in a nice closed form. A significant advantage of our computational method is that the universal AGRF framework provides a natural way to incorporate arbitrary order derivatives and deal with missing data. We use four numerical examples to demonstrate the effectiveness of the computational method. The numerical examples are composite function, damped harmonic oscillator, Korteweg-De Vries equation, and Burgers' equation.

Mathematics↗

Ultrascale Visualization Climate Data Analysis Tools (UV-CDAT) Final Report

A partnership across government, academic, and private sectors has created a novel system that enables climate researchers to solve current and emerging data analysis and visualization challenges. The Ultrascale Visualization Climate Data Analysis Tools (UV-CDAT) software project utilizes the Python application programming interface (API) combined with C/C++/Fortran implementations for performance-critical software that offers the best compromise between "scalability" and “ease-of-use.” The UV-CDAT system is highly extensible and customizable for high-performance interactive and batch visualization and analysis for climate science and other disciplines of geosciences. For complex, climate data-intensive computing, UV-CDAT’s inclusive framework supports Message Passing Interface (MPI) parallelism as well as taskfarming and other forms of parallelism. More specifically, the UV-CDAT framework supports the execution of Python scripts running in parallel using the MPI executable commands and leverages Department of Energy (DOE)-funded general-purpose, scalable parallel visualization tools such as ParaView and VisIt. This is the first system to be successfully designed in this way and with these features. The climate community leverages these tools and others, in support of a parallel client-server paradigm, allowing extreme-scale, server-side computing for maximum possible speed-up.

54 ENVIRONMENTAL SCIENCES↗

Probing short-range nucleon-nucleon interactions with an electron-ion collider

For this research, we derive the cross section for exclusive vector meson production in high-energy deeply inelastic scattering off a deuteron target that disintegrates into a proton and a neutron carrying large relative momentum in the final state. This cross section can be expressed in terms of a novel gluon transition generalized parton distribution (T-GPD); the hard scale in the final state makes the T-GPD sensitive to the short-distance nucleon-nucleon interaction. We perform a toy model computation of this process in a perturbative framework and discuss the time scales that allow the separation of initial- and final-state dynamics in the T-GPD. We outline the more general computation based on the factorization suggested by the toy computation: In particular, we discuss the relative role of “pointlike” and “geometric” Fock configurations that control the parton dynamics of short-range nucleon-nucleon scattering. With the aid of exclusive J/ψ production data at the Hadron-Electron Ring Accelerator at DESY, as well as elastic nucleon-nucleon cross sections, we estimate rates for exclusive deuteron photodisintegration at a future Electron-Ion Collider (EIC). Our results, obtained using conservative estimates of EIC integrated luminosities, suggest that center-of-mass energies sNN ~12GeV 2 of the neutron-proton subsystem can be accessed. We argue that the high energies of the EIC can address outstanding dynamical questions regarding the short-range quark-gluon structure of nuclear forces by providing clean gluon probes of such “knockout” exclusive reactions in light and heavy nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Functional protein mining with conformal guarantees

Molecular structure prediction and homology detection offer promising paths to discovering protein function and evolutionary relationships. However, current approaches lack statistical reliability assurances, limiting their practical utility for selecting proteins for further experimental and in-silico characterization. To address this challenge, we introduce a statistically principled approach to protein search leveraging principles from conformal prediction, offering a framework that ensures statistical guarantees with user-specified risk and provides calibrated probabilities (rather than raw ML scores) for any protein search model. Our method (1) lets users select many biologically-relevant loss metrics (i.e. false discovery rate) and assigns reliable functional probabilities for annotating genes of unknown function; (2) achieves state-of-the-art performance in enzyme classification without training new models; and (3) robustly and rapidly pre-filters proteins for computationally intensive structural alignment algorithms. Our framework enhances the reliability of protein homology detection and enables the discovery of uncharacterized proteins with likely desirable functional properties.

59 BASIC BIOLOGICAL SCIENCES↗

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation: Preprint

This paper combines model-based and data-driven methods to develop a hierarchical decentralized robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level is comprised of robust model-based decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data- driven DSE, after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level, and hence to speed up the computational time significantly. The proposed hybrid framework does not depend upon the centralized infrastructure of the control centers, thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator (PDC) locations. Also, the network model is not necessary, thus a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on a 2000-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization-based approaches to control of connected and automated vehicles: Principles, complexities, applications, challenges, and outlook

Safe and optimal motion control for connected and automated vehicles (CAVs) poses a fundamental optimization challenge at the intersection of system complexity, environmental uncertainty, and stringent real-time constraints. Existing surveys address this challenge in isolation – focusing either on specific control techniques or individual uncertainty sources – without providing a unified framework that characterizes the trade-offs among computational tractability, performance verifiability, and adaptive generalization across paradigms. This review addresses that gap by presenting a cohesive analytical framework concentrated on the decision-making and trajectory optimization layers of the CAV autonomy stack. We systematically analyze three major optimization paradigms – first-principles model-based optimization, data-driven methods, and hybrid synergistic architectures – evaluating each against four core complexity axes: problem formulation, constraint handling, optimality guarantees, and robustness. Key applications including platooning, trajectory planning, collision avoidance, and cooperative control are examined to reveal recurring methodological patterns and critical operational constraints that limit real-world performance. Our synthesis identifies verifiable hybrid architectures, incentive-aligned multi-agent cooperation, and hardware-algorithm co-design as the defining research frontiers, and distills a targeted agenda for developing CAV control systems that are simultaneously safe, computationally efficient, and deployable in the full complexity of real-world traffic environments.

Muzahid, Abu Jafar Md [University of Tennessee, Kn↗

Evaluating the Interplay between Trajectory Segmentation and Mode Inference Error

Travel behavior changes are essential to transportation decarbonization. Travel diaries, consisting of sequences of trips between places, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of Global Positioning System tracking surveys. These algorithms have typically been validated using prompted recall of presegmented trips, thus disregarding the continuity of mode inference. Phone operating systems have adopted battery-conserving techniques, but the resulting data collection errors have not been studied extensively. We introduce a framework to evaluate the accuracy of trip length computations and mode inference by analyzing continuous mode-segmented trajectories for groups of trips. We then use the framework to identify the input data quality and the impact of postprocessing. Our primary inputs to this evaluation are MobilityNet, a public dataset containing information from three artificial timelines covering 15 different travel modes, and sample open-source travel diary creation algorithms from the OpenPATH project. Our framework concretely shows that the variance of the distance error drops from (0.217, 0.0848) to (o.011, 0.0407) (Android, iOS) after postprocessing. Similarly, the weighted F-scores for mode inference increase from (0.25, 0.29) to (0.60, 0.74) (iOS, Android) between random forest and geographic information system-based models. We hope that this standardized method will be adapted to evaluate other, potentially proprietary, travel diary algorithms. Finally, the results can be used to understand and improve the state of the art in the travel diary creation field.

33 ADVANCED PROPULSION SYSTEMS↗

General bootstrap equations in 4D CFTs

We provide a framework for generic 4D conformal bootstrap computations. It is based on the unification of two independent approaches, the covariant (embedding) formalism and the non-covariant (conformal frame) formalism. We construct their main ingredients (tensor structures and differential operators) and establish a precise connection between them. We supplement the discussion by additional details like classification of tensor structures of n-point functions, normalization of 2-point functions and seed conformal blocks, Casimir differential operators and treatment of conserved operators and permutation symmetries. Lastly, we implement our framework in a Mathematica package and make it freely available.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance of Heterogeneous Algorithm Scheduling in CMSSW

The CMS experiment started to utilize Graphics Processing Units (GPU) to accelerate the online reconstruction and event selection running on its High Level Trigger (HLT) farm in the 2022 data taking period. The projections of the HLT farm to the High-Luminosity LHC foresee a significant use of compute accelerators in the LHC Run 4 and onwards in order to keep the cost, size, and power budget of the farm under control. This direction of leveraging compute accelerators has synergies with the increasing use of HPC resources in HEP computing, as HPC machines are employing more and more compute accelerators that are predominantly GPUs today. In this work we review the features developed for the CMS data processing framework, CMSSW, to support the effective utilization of both compute accelerators and many-core CPUs within a highly concurrent task-based framework. We measure the impact of various design choices for the scheduling of heterogeneous algorithms on the event processing throughput, using the Run-3 HLT application as a realistic use case.

Bocci, Andrea↗

A Combined Experimental-Computational Study on the Effect of Topology on Carbon Dioxide Adsorption in Zeolitic Imidazolate Frameworks

We report CO2 adsorption data for four zeolitic imidazolate frameworks (ZIFs) to 55 bar, namely ZIF-7, ZIF-11, ZIF-93, and ZIF-94. Modification of synthetic conditions allows access to different topologies with the same metal ion and organic link: ZIF-7 (ZIF-94) having sod topology and ZIF-11 (ZIF-93) having the rho topology. The varying topology, with fixed metal ion and imidazolate functionality, makes these systems ideal for studying the effect of topology on gas adsorption in ZIFs. The experiments show that the topologies with the smaller pores (ZIF-7 and 94) have larger adsorptions than their counterparts (ZIF-11 and 93, respectively) at low pressures (<1 bar); however, the reverse is true at higher pressures where the larger-pore structures have significantly higher adsorption. Molecular modeling and heat of adsorption measurements indicate that while the binding potential wells for the smaller-pore structures are deeper than those of the larger-pore structures, they are relatively narrow and cannot accommodate multiple CO2 occupancy, in contrast to the much broader potential wells seen in the larger pore structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Gravitational Wave Scattering via the Born Series: Scalar Tidal Matching to 𝒪⁡(𝐺 7 ) and Beyond

We introduce a novel method to compute gravitational wave amplitudes within the framework of effective field theory. By reinterpreting the Feynman diagram expansion as a Born series, our method offers several key advantages. It directly yields partial wave amplitudes, streamlining the matching with black hole perturbation theory. Long-distance gravitational interactions are unambiguously factorized from short-distance tidal effects, including dissipation, which are systematically incorporated via an in-in worldline effective action. Crucially, at every order in perturbation theory, integrals are expressed in terms of harmonic polylogarithms, enabling an end-to-end computation scalable to arbitrary orders. We illustrate the method with new predictions for scalar black hole Love numbers and their renormalization group equations to 𝒪⁡(𝐺 7 ).

effective field theory↗

Beam Hardening Artifact Reduction in X-Ray CT Reconstruction of 3D Printed Metal Parts Leveraging Deep Learning and CAD Models

Nondestructive evaluation (NDE) of additively manufactured (AM) parts is important for understanding the impacts of various process parameters and qualifying the built part. X-ray computed tomography (XCT) has played a critical role in rapid NDE and characterization of AM parts. However, XCT of metal AM parts can be challenging because of artifacts produced by standard reconstruction algorithms as a result of a confounding effect called “beam hardening.” Beam hardening artifacts complicate the analysis of XCT images and adversely impact the process of detecting defects, such as pores and cracks, which is key to ensuring the quality of the parts being printed. In this work, we propose a novel framework based on using available computer-aided design (CAD) models for parts to be manufactured, accurate XCT simulations, and a deep-neural network to produce high-quality XCT reconstructions from data that are affected by noise and beam hardening. Using extensive experiments with simulated data sets, we demonstrate that our method can significantly improve the reconstruction quality, thereby enabling better detection of defects compared with the state of the art. We also present promising preliminary results of applying the deep networks trained using CAD models to experimental data obtained from XCT of an AM jet-engine turbine blade.

Ziabari, Amir↗

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗

Entanglement entropy of a color flux tube in (1+1)D Yang–Mills theory

In recent work Amorosso et al. (2024), we computed a novel flux tube entanglement entropy (FTE) of the color flux tube stretched between a heavy quark-antiquark pair on a Euclidean lattice in (2+1)D Yang–Mills theory. Our numerical results suggested that FTE can be partitioned into an internal color entanglement entropy and a vibrational entropy corresponding to the transverse excitations of a QCD string, with the latter described by a thin string model. Since the color flux tube does not have transverse excitations in (1+1)D Yang–Mills theory, we use this simpler framework to perform an exact analytical computation of the contribution of the internal color degrees of freedom to FTE. For the multipartite partitioning of the color flux tube, we find the remarkable result that FTE depends only on the dimension of the color group representation and the number of times the flux tube crosses the boundary between the traced and untraced spatial regions but not on the string length. Our proof is independent of whether the replica and region boundaries on the lattice are placed on vertices or in plaquette centers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗