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,369 records · Page 76

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↗

A Quantum Volume Metric for Qudit Quantum Computers

Qudit-based quantum computers, such as the high-Q superconducting radio frequency resonator cavities being pursued by the SQMS Center hosted at Fermilab, may provide computational advantages relative to qubit-based machines for some problems. However, the novel system’s hardware and software will present different errors that must be understood and mitigated, along with other unforeseen inefficiencies across the entire stack. It is essential to benchmark these qudit platforms against existing systems. We propose such a benchmark by generalizing the qubit-based quantum volume metric to qudit devices. In particular, we show that the performance depends on the available gateset used to compile unitary operations, as well as realistic noise sources.

Quantum Computing↗

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↗

Optimal Financing Decision in a Contract Food Supply Chain with Capital Constraint

To solve the financing problem of the food producers, we consider a two‐echelon contract food supply chain composed of a family farm with capital constraints and a food processing enterprise. With no capital constraints as the benchmark model, we analyze optimal decisions of the family farm and the food processing enterprise in the case of bank financing with bank participation only and bank financing with “government, bank, and insurance” coparticipation. Then, we discuss how the risk of yield uncertainty influences the optimal decisions and profits of the family farm and the food processing enterprise under different financing situation. Meanwhile, the reason why the government subsidizes agriculture is explored, and the policy of minimum purchase price of the food is initiated when the market price is too low. Finally, the numerical examples and sensitivity analysis are presented. The results show that the bank financing with “government, bank, and insurance” coparticipation improves the welfare of supply chain members more obviously than the bank financing with bank participation only; when the rice price is too low, the policy of minimum purchase price of food is initiated, which increases the revenue and the growing enthusiasm of the family farm; the profits of the family farm and the food processing enterprise will decrease as the risk of yield uncertainty increases in the case of bank financing, and the risk of yield uncertainty will be reduced for the family farm when bank financing with “government, bank, and insurance” coparticipation.

Luo, Ying (ORCID:0000000158101443)↗

Advanced Data Structures for Improved Cyber Resilience and Awareness in Untrusted Environments: LDRD Report

This report summarizes the work performed under the project "Advanced Data Structures for Improved Cyber Resilience and Awareness in Untrusted Environments." The goal of the project was to design, analyze, and test new data structures for cybersecurity applications. We had two major thrusts: 1) using new/improved write-optimized data structures and/or algorithms to better man- age and analyze high-speed massive-volume cyberstreams, and 2) adding security features to data structures at minimum cost. Write optimization allows data structures to better use secondary memory to store and search a larger amount of useful information. Secondary memory is large compared to main memory, but data movement to and from secondary memory must be carefully managed to run quickly enough to keep up with fast streams. The first thrust included managing cyberstreams in parallel, both multi-threaded and distributed, and improving the benchmarking infrastructure for testing new streaming data structures. We considered both (near) real-time discovery of particular patterns, and improved logging for improved forensics. We considered two kinds of security-feature problem. The first was high-performance history- independent external-memory data structures. These provide certain protections to data if a disk is stolen. We also prove some trade-offs between speed and security in this setting. The second data-security problem is more secure data look-up in secret-shared data bases. This report summarizes the project's major accomplishments, with the background to under- stand these accomplishments. It gathers the abstracts and references for the six refereed publications that have appeared as part of this work. We summarize several accomplishments that will be submitted for publication. We then archive one piece of partial work that is not likely to be published in the near future: validation of history-independent data structure implementations.

97 MATHEMATICS AND COMPUTING↗

Updates to Nek5000: RANS wall functions, NRC support, and documentation

As a key part of the U.S. Department of Energy’s Nuclear Energy Advanced Modeling and Simulation program (NEAMS), the next generation of tools for nuclear reactor design are being developed. A primary metric for success of this program is the adoption of those tools by industry stakeholders. To help meet this metric for Nek5000, development efforts this year have focused on the expansion of the available Reynolds-averaged Navier-Stokes (RANS) turbulence models to include wall function models, continued support of the U.S. Nuclear Regulatory Commission in simulating a hydrogen mitigation benchmark experiment, and expansion of the Nek5000 documentation to enhance the code’s usability. The implementation of wall functions is intended to significantly decrease time to-solution for a wide range of problems and it has been identified as an important feature by stakeholders across the nuclear community. The initial implementation of standard and pressure corrected wall functions has been tested in Nek5000 on the classical problems of channel flow and a backward facing step. It has also been tested on a 2D molten salt fast reactor core and a T-junction. The recommended formulation of choosing y + = 30 as a boundary value combined with a Neumann-Neumann formulation of the boundary condition for k and τ produces the most consistent results compared to a wall resolved approach. The collaboration with the NRC is a continuing exercise that has been ongoing for multiple years. This year we have concluded investigations into appropriate inlet conditions, showing that fully developed turbulent conditions are adequate for the full PANDA domain. We have also concluded simulations for an unobstructed jet and are now refocusing to the original obstructed jet case. The expansion of the code documentation has also been an ongoing effort over the past few years to address feedback from the various stakeholders. The documentation now more fully covers many of the available features and closes identified SQA gaps. Finally we report on three training sessions that were offered over the past year in an effort to expand the Nek5000 user base.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗