Search NASA⌕ Search

SEARCH · Search NASA

Results for “benchmark problem”

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,063 records · Page 59

Axisymmetric curvature-driven instability in a model divertor geometry

A model problem is presented which qualitatively describes a pressure-driven instability which can occur near the null-point in the divertor region of a tokamak where the poloidal field becomes small. The model problem is described by a horizontal slot with a vertical magnetic field which plays the role of the poloidal field. Line-tying boundary conditions are applied at the planes defining the slot. A toroidal field lying parallel to the planes is assumed to be very strong, thereby constraining the possible structure of the perturbations. Axisymmetric perturbations which leave the toroidal field unperturbed are analyzed. Ideal magnetohydrodynamics is used, and the instability threshold is determined by the energy principle. Because of the boundary conditions, the Euler equation is, in general, non-separable except at marginal stability. This problem may be useful in understanding the source of heat transport into the private flux region in a snowflake divertor which possesses a large region of small poloidal field, and for code benchmarking as it yields simple analytic results in an interesting geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Antimatter cosmic rays from dark matter annihilation: First results from an N-body experiment

While the particle hypothesis for dark matter may be very soon investigated at the LHC, and as the PAMELA and GLAST satellites are currently taking new data on charged and gamma cosmic rays, the need of controlling the theoretical uncertainties affecting the possible indirect signatures of dark matter annihilation is of paramount importance. The uncertainties which originate from the dark matter distribution are difficult to estimate because current astrophysical observations provide rather weak dynamical constraints and because, according to cosmological N-body simulations, dark matter is neither smoothly nor spherically distributed in galactic halos. Some previous studies made use of N-body simulations to compute the {gamma}-ray flux from dark matter annihilation, but such a work has never been performed for the antimatter (positron and antiproton) primary fluxes, for which transport processes complicate the calculations. We take advantage of the galaxylike 3D dark matter map extracted from the Horizon Project results to calculate the positron and antiproton fluxes from dark matter annihilation, in a model-independent approach as well as for dark matter particle benchmarks relevant at the LHC scale (from supersymmetric and extradimensional theories). We find that the flux uncertainties arise mainly from fluctuations of the local dark matter density, and are of {approx}1 order of magnitude. We compare our results to analytic descriptions of the dark matter halo, showing how the latter can well reproduce the former. The overall antimatter predictions associated with our benchmark models are shown to lie far below the existing measurements and, in particular, that of the positron fraction recently reported by PAMELA, and far below the background predictions as well. Finally, we stress the limits of the use of an N-body framework in this context.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving Deployment Availability of Energy Storage With Data-Driven AGC Signal Models

Energy Storage (ES) provides great flexibility and large benefits to power system operations and control. When providing ancillary services (e.g., regulation, reserve, etc.), the real-time (RT) deployment of ES is uncertain, and it is important to manage state of charge accordingly. Aiming to improve the ES performance for providing energy and regulation service in the electricity market, we propose two data-driven Automatic Generation Control (AGC) signal models. The first one is a historical-data-driven AGC signal model, which is based on the analysis of the historical AGC signals, and is designed for ES participation in the day-ahead (DA) market. The second one is a prediction-data-driven AGC signal model, which is based on the prediction of the AGC signals, and is designed for ES participation in the RT market. We also develop a deployment availability check model and solution algorithm. The proposed framework is applied to an ES bidding problem in the DA and RT markets. The results indicate that deployment availability and operational performance of the ES are improved with the proposed data-driven AGC models compared to traditional benchmarks.

AGC signal model↗

A Survey of Recent Advances in Transmission Network Switching

Optimal Transmission Switching for electric power networks is a research topic of great interest for both researchers and electric power engineers. Transmission switching is commonly considered a corrective mechanism tool for overloaded networks; however in recent years it has been sought as a means to reduce power loss in the network. Ultimately the objective of this analysis is to provide smart tools for power and economic dispatch planning, allowing utilities and engineers to utilize existing infrastructure as a means of automatic control. The optimization problem is a complex multi-objective search including criteria such as system power loss, equality/non-equality constraints, islanding management, and radial topology configuration in the case of distribution networks. Many optimization methods have been adopted for the transmission switching problem in past years using various heuristic search algorithms. The scope of methodology extends from tried and true methods such as simulated annealing to more modern methods like neural network optimization. Solution benchmarks under consideration commonly include solution state accuracy, computational burden and solution time. The objective of this presentation is to provide a comprehensive account of development in transmission switching methodologies. Benchmarking and testing strategies will be discussed as well as application of the Transmission Expansion Planning Tool in finding transmission switching solutions. Limited Discrepancy Search (LOS) and Probe Discrepancy Search (PDS) Algorithms are compared with more classic optimization strategies, as seen in defining literature and publications in this research field.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Transverse beam dynamics in non-linear Fixed Field Alternating Gradient accelerators

In this paper, we present some aspects of the transverse beam dynamics in Fixed Field Ring Accelerators (FFRA): we start from the basic principles in order to derive the linearized transverse particle equations of motion for FFRA, essentially FFAGs and cyclotrons are considered here. This is a simple extension of a previous work valid for linear lattices that we generalized by including the bending terms to ensure its correctness for FFAG lattice. The space charge term (contribution of the internal coulombian forces of the beam) is contained as well, although it is not discussed here. The emphasis is on the scaling FFAG type: a collaboration work is undertaken in view of better understanding the properties of the 150 MeV scaling FFAG at KURRI in Japan, and progress towards high intensity operation. Some results of the benchmarking work between different codes are presented. Analysis of certain type of field imperfections revealed some interesting features about this machine that explain some of the experimental results and generalize the concept of a scaling FFAG to a non-scaling one for which the tune variations obey a well-defined law.

43 PARTICLE ACCELERATORS↗

MPAS-Albany Land Ice (MALI): a variable-resolution ice sheet model for Earth system modeling using Voronoi grids

Abstract. We introduce MPAS-Albany Land Ice (MALI) v6.0, a new variable-resolution land ice model that uses unstructured Voronoi grids on a plane or sphere. MALI is built using the Model for Prediction Across Scales (MPAS) framework for developing variable-resolution Earth system model components and the Albany multi-physics code base for the solution of coupled systems of partial differential equations, which itself makes use of Trilinos solver libraries. MALI includes a three-dimensional first-order momentum balance solver (Blatter–Pattyn) by linking to the Albany-LI ice sheet velocity solver and an explicit shallow ice velocity solver. The evolution of ice geometry and tracers is handled through an explicit first-order horizontal advection scheme with vertical remapping. The evolution of ice temperature is treated using operator splitting of vertical diffusion and horizontal advection and can be configured to use either a temperature or enthalpy formulation. MALI includes a mass-conserving subglacial hydrology model that supports distributed and/or channelized drainage and can optionally be coupled to ice dynamics. Options for calving include eigencalving , which assumes that the calving rate is proportional to extensional strain rates. MALI is evaluated against commonly used exact solutions and community benchmark experiments and shows the expected accuracy. Results for the MISMIP3d benchmark experiments with MALI's Blatter–Pattyn solver fall between published results from Stokes and L1L2 models as expected. We use the model to simulate a semi-realistic Antarctic ice sheet problem following the initMIP protocol and using 2 km resolution in marine ice sheet regions. MALI is the glacier component of the Energy Exascale Earth System Model (E3SM) version 1, and we describe current and planned coupling to other E3SM components.

54 ENVIRONMENTAL SCIENCES↗

Vehicle routing for the last mile of power system restoration

This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ORNL Neutron Cross-Section Measurements Activities

To support the Nuclear Criticality Safety Program, neutron cross-section measurements have been initiated using GELINA at the European Commission Joint Research Center IRMM. Concerns about data deficiencies in some existing cross-section evaluations from libraries such as ENDF/B, JEFF, or JENDL for nuclear criticality calculations have been the prime motivator for new cross section measurements. Over the past years, many problems with existing nuclear data have been emerging. An example is the use of the evaluated neutron cross-section data for tungsten in nuclear criticality safety calculations, which exhibit discrepancies in benchmark calculations and show the need for reliable covariance data. We recently measured the neutron total and capture cross sections of 182,183,184,186 W, 63,65 Cu, and natural calcium in the neutron energy range from 100 eV to several hundred keV. This will help to improve the representation of the cross sections since most of the available evaluated data rely only on old measurements. Besides, most of the evaluations in the nuclear data libraries are missing high-fidelity covariance data. New covariance data for the libraries can only be created by a reevaluation of the cross-section data; however, sometimes this impossible because the data used in the analysis and evaluations are no longer available. In such cases, this shortfall can be overcome only by new experimental data included in a new evaluation.

97 MATHEMATICS AND COMPUTING↗

A Variational Nodal Approach to 2D/1D Pin Resolved Neutron Transport: I Diffusion Theory

The variational nodal method (VNM) as implemented in the VARIANT code has been widely employed to fast reactor cores, but much less so for thermal reactors. In what follows we report the initial phase of development of the PANX code (Purdue - Argonne - Northwestern - Xi'an) for three-dimensional pin resolved PWR transport calculations. In two dimensions, prototype modifications of VARIANT using finite elements to obtain heterogeneous nodes and quasi-reflected interface conditions to reduce the high angular-order interface conditions, have been successfully employed to the 2D C5G7 benchmark. In three dimensions, however, the polynomial interface conditions employed in VARIANT smear fuel and coolant at each axial interface, leading to lack of convergence as the axial mesh is refined. This problem is also encountered in the 2D/1D approximations in MOC based methods. The intent of this work is to eliminate these interface homogenization effects from VNM calculations. For clarity, in this work we examine these phenomena in diffusion theory. The next stage of development will incorporate spherical harmonic trial functions to achieve more accurate transport solutions. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

The global version of the gyrokinetic turbulence code GENE

The understanding and prediction of transport due to plasma microturbulence is a key open problem in modern plasma physics, and a grand challenge for fusion energy research. Ab initio simulations of such small-scale, low-frequency turbulence are to be based on the gyrokinetic equations, a set of nonlinear integro-differential equations in reduced (five-dimensional) phase space. In the present paper, the extension of the well-established and widely used gyrokinetic code GENE [F. Jenko, W. Dorland, M. Kotschenreuther, B.N. Rogers, Electron temperature gradient driven turbulence, Phys. Plasmas 7 (2000) 1904-1910] from a radially local to a radially global (nonlocal) version is described. The necessary modifications of both the basic equations and the employed numerical methods are detailed, including, e.g., the change from spectral methods to finite difference and interpolation techniques in the radial direction and the implementation of sources and sinks. In addition, code verification studies and benchmarks are presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Plaster: An Integration, Benchmark and Development Framework for Heterogeneous Metadata Normalization Methods

The recent advances in the automation of metadata normalization and the invention of a unified schema — Brick — alleviate the metadata normalization challenge for deploying portable applications across buildings. Yet, the lack of compatibility between existing metadata normalization methods precludes the possibility of comparing and combining them. While generic machine learning (ML) frameworks, such as MLJAR and OpenML, provide versatile interfaces for standard ML problems, they cannot easily accommodate the metadata normalization tasks for buildings due to the heterogeneity in the inference scope, type of data required as input, evaluation metric, and the building-specific human-in-the-loop learning procedure. We propose Plaster, an open and modular framework that incorporates existing advances in building metadata normalization. It provides unified programming interfaces for various types of learning methods for metadata normalization and defines standardized data models for building metadata and timeseries data. Thus, it enables the integration of different methods via a workflow, benchmarking of different methods via unified interfaces, and rapid prototyping of new algorithms. With Plaster, we 1) show three examples of the workflow integration, delivering better performance than individual algorithms, 2) benchmark/analyze five algorithms over five common buildings, and 3) exemplify the process of developing a new algorithm involving time series features. We believe Plaster will facilitate the development of new algorithms and expedite the adoption of standard metadata schema such as Brick, in order to enable seamless smart building applications in the future.

99 GENERAL AND MISCELLANEOUS↗

Separable physics-informed DeepONet: Breaking the curse of dimensionality in physics-informed machine learning

The deep operator network (DeepONet) has shown remarkable potential in solving partial differential equations (PDEs) by mapping between infinite-dimensional function spaces using labeled datasets. However, in scenarios lacking labeled data, the physics-informed DeepONet (PI-DeepONet) approach, which utilizes the residual loss of the governing PDE to optimize the network parameters, faces significant computational challenges, particularly due to the curse of dimensionality. This limitation has hindered its application to high-dimensional problems, making even standard 3D spatial with 1D temporal problems computationally prohibitive. Additionally, the computational requirement increases exponentially with the discretization density of the domain. Here, to address these challenges and enhance scalability for high-dimensional PDEs, we introduce the Separable physics-informed DeepONet (Sep-PI-DeepONet). This framework employs a factorization technique, utilizing sub-networks for individual one-dimensional coordinates, thereby reducing the number of forward passes and the size of the Jacobian matrix required for gradient computations. By incorporating forward-mode automatic differentiation (AD), we further optimize computational efficiency, achieving linear scaling of computational cost with discretization density and dimensionality, making our approach highly suitable for high-dimensional PDEs. We demonstrate the effectiveness of Sep-PI-DeepONet through three benchmark PDE models: the viscous Burgers’ equation, Biot’s consolidation theory, and a parameterized heat equation. Our framework maintains accuracy comparable to the conventional PI-DeepONet while reducing training time by two orders of magnitude. Notably, for the heat equation solved as a 4D problem, the conventional PI-DeepONet was computationally infeasible (estimated 289.35 h), while the Sep-PI-DeepONet completed training in just 2.5 h. These results underscore the potential of Sep-PI-DeepONet in efficiently solving complex, high-dimensional PDEs, marking a significant advancement in physics-informed machine learning.

Neural operator↗

Occupancy sensing in buildings: A review of data analytics approaches

A review of the literature pertaining to building occupancy detection, counting, and tracking - three areas under the umbrella of building occupancy estimation - is presented with a focus on mathematical approaches and corresponding metrics. The idea is to provide the reader with a background on the hardware and techniques used for occupancy inference, subsequent to data collection, with emphasis placed on the algorithmic characterization of occupancy estimation. The various approaches employed by researchers to tackle the problem are surveyed and summarized, including: data collection, cleaning processes, algorithm utilization and categorization, as well as data structuring and organization. The scope of prediction and performance metrics are used to establish a benchmarking system through a comprehensive summary of (indoor) occupancy estimation, presented in the context of the mathematical tools utilized.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ContScout: sensitive detection and removal of contamination from annotated genomes

Contamination of genomes is an increasingly recognized problem affecting several downstream applications, from comparative evolutionary genomics to metagenomics. Here we introduce ContScout, a precise tool for eliminating foreign sequences from annotated genomes. It achieves high specificity and sensitivity on synthetic benchmark data even when the contaminant is a closely related species, outperforms competing tools, and can distinguish horizontal gene transfer from contamination. A screen of 844 eukaryotic genomes for contamination identified bacteria as the most common source, followed by fungi and plants. Furthermore, we show that contaminants in ancestral genome reconstructions lead to erroneous early origins of genes and inflate gene loss rates, leading to a false notion of complex ancestral genomes. Taken together, we offer here a tool for sensitive removal of foreign proteins, identify and remove contaminants from diverse eukaryotic genomes and evaluate their impact on phylogenomic analyses.

59 BASIC BIOLOGICAL SCIENCES↗

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mini-apps for high performance data analysis

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Sukumar, Sreenivas R.↗

On-demand data analytics in HPC environments at leadership computing facilities: Challenges and experiences

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Harney, John↗