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 901 records · Page 50

Classification with asymmetric label noise: Consistency and maximal denoising

In many real-world classification problems, the labels of training examples are randomly corrupted. Most previous theoretical work on classification with label noise assumes that the two classes are separable, that the label noise is independent of the true class label, or that the noise proportions for each class are known. In this work, we give conditions that are necessary and sufficient for the true class-conditional distributions to be identifiable. These conditions are weaker than those analyzed previously, and allow for the classes to be nonseparable and the noise levels to be asymmetric and unknown. The conditions essentially state that a majority of the observed labels are correct and that the true class-conditional distributions are “mutually irreducible,” a concept we introduce that limits the similarity of the two distributions. For any label noise problem, there is a unique pair of true class-conditional distributions satisfying the proposed conditions, and we argue that this pair corresponds in a certain sense to maximal denoising of the observed distributions. Our results are facilitated by a connection to “mixture proportion estimation,” which is the problem of estimating the maximal proportion of one distribution that is present in another. We establish a novel rate of convergence result for mixture proportion estimation, and apply this to obtain consistency of a discrimination rule based on surrogate loss minimization. Experimental results on benchmark data and a nuclear particle classification problem demonstrate the efficacy of our approach. MSC 2010 subject classifications: Primary 62H30; secondary 68T10. Keywords and phrases: Classification, label noise, mixture proportion estimation, surrogate loss, consistency.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalability of GlennICE in a Parallel Environment

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries using the input from a user-supplied computational fluid dynamics (CFD) solution for the geometry of interest. The most significant developments in the advancement of GlennICE have been investigating the convergence of the collection efficiency, efficiently finding trajectories, and improving the refinement methodology. Such developments have increased the efficiency of GlennICE for practical engineering application. With the increasing demand for applying GlennICE for more memory-intensive problems, the scalability of GlennICE has yet to be investigated. This paper is aimed at presenting a method to benchmark the scalability of GlennICE utilizing a relevant engineering problem within a parallel environment. This leads to the final goal of investigating whether an increase in the number of processors utilized results in a linear speedup of the GlennICE software.

Computational Icing, Icing, CFD, MPI↗

An entropy-based debiasing approach to quantifying experimental coverage for novel applications of interest in the nuclear community

This manuscript proposes a novel information-theoretic approach to the quantification of experimental relevance, i.e., coverage, to achieve optimal data assimilation results for nuclear engineering applications. Specifically, this work posits the need for a new metric, called coverage (q C ) of an application’s quantity of interest, i.e., eigenvalue or power peaking for an advanced reactor concept, defined herein as the theoretically maximum achievable reduction in the quantity’s uncertainty given measurements from a pool of experiments in a manner that is independent of the data assimilation procedure employed. Currently, reduction in a quantity’s uncertainty is strongly biased by the underlying assumptions of the assimilation procedure to account for the under-determined nature of such problems and the similarity criterion employed to identify relevant experiments. To address this challenge, this work has developed a coverage metric, q C , based on mutual information, which establishes a new conceptual framework for assessing coverage, one that is independent of the model parameters and responses degree of variations in both the experimental and application domains, i.e., linear vs non-linear, and their prior uncertainty distributions, i.e., Gaussian vs. non-Gaussian. The q C is an entropic measure capable of addressing coverage for general nonlinear problems with non-Gaussian uncertainties and inclusive of the measurement uncertainties from multiple experiments. Numerical experiments from manufactured analytical problems as well as a set of benchmarks from the ICSBEP handbook are employed to demonstrate its theoretical and practical performance as compared to the c k -based experiment selection methodology, commonly employed in the neutronic community. The manuscript then employs other well-known adaptations to existing data assimilation methodologies for nonlinear and non-Gaussian problems capable of achieving the coverage posited by q C .

Bayesian data assimilation↗

PRISMATIC CORE COUPLED TRANSIENT BENCHMARK

The Prismatic Modular Reactor (PMR) is one of the High Temperature Reactor (HTR) design concepts that have existed for some time. Several prismatic units have operated in the world (DRAGON, Fort St. Vrain, Peach Bottom) and one unit is still in operation (HTTR). The deterministic neutronics and thermal-fluids transient analysis tools and methods currently available for the design and analysis of PMRs have lagged behind the state of the art compared to LWR reactor technologies. This has motivated the development of more accurate and efficient tools for the design and safety evaluations of the PMR. In addition to the work invested in new methods, it is essential to develop appropriate benchmarks to verify and validate the new methods in computer codes. The purpose of this benchmark is to establish a well-defined problem, based on a common given set of data, to compare methods and tools in core simulation and thermal hydraulics analysis with a specific focus on transient events. The benchmark-working group is currently seeking OECD/NEA sponsorship. This benchmark is being pursued and is heavily based on the success of the PBMR-400 exercise.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multidisciplinary benchmarks of a conservative spectral solver for the nonlinear Boltzmann equation

The Boltzmann equation describes the evolution of the phase-space probability distribution of classical particles under binary collisions. Approximations to it underlie the basis for several scholarly fields, including aerodynamics and plasma physics. While these approximations are appropriate in their respective domains, they can be violated in niche but diverse applications which require direct numerical solution of the original nonlinear Boltzmann equation. An expanded implementation of the Galerkin–Petrov conservative spectral algorithm is employed to study a wide variety of physical problems. Enabled by distributed precomputation, solutions of the spatially homogeneous Boltzmann equation can be achieved in seconds on modern personal hardware, while spatially-inhomogeneous problems are solvable in minutes. Here, several benchmarks are presented focusing on accuracy compared to both analytic theoretical predictions and other Boltzmann solvers. These benchmarks span several physical domains including weakly ionized plasma, gaseous fluids, and atomic-plasma interaction.

97 MATHEMATICS AND COMPUTING↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

Systematic comparison of local approaches for isotopically nonstationary metabolic flux analysis

Quantification of reaction fluxes of metabolic networks can help us understand how the integration of different metabolic pathways determine cellular functions. Yet, intracellular fluxes cannot be measured directly but are estimated with metabolic flux analysis (MFA) that relies on the patterns of isotope labeling of metabolites in the network. For metabolic systems, typical for plants, where all potentially labeled atoms effectively have only one source atom pool, only isotopically nonstationary MFA can provide information about intracellular fluxes. There are several global approaches that implement MFA for an entire metabolic network and estimate, at once, a steady-state flux distribution for all reactions with identifiable fluxes in the network. In contrast, local approaches deal with estimation of fluxes for a subset of reactions, with smaller data demand for flux estimation. Here we present a systematic comparative review and benchmarking of the existing local approaches for isotopically nonstationary MFA. The comparison is conducted with respect to the required data and underlying computational problems solved on a synthetic network example. Furthermore, we benchmark the performance of these approaches in estimating fluxes for a subset of reactions using data obtained from the simulation of nitrogen fluxes in the Arabidopsis thaliana core metabolism. The findings pinpoint practical aspects that need to be considered when applying local approaches for flux estimation in large-scale plant metabolic networks.

59 BASIC BIOLOGICAL SCIENCES↗

Uncertainty propagation of p-boxes using sparse polynomial chaos expansions

In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making efficient quantification and propagation of uncertainties an important aspect. In this context, a typical workflow includes the characterization of the uncertainty in the input variables. In this paper, input variables are modelled by probability-boxes (p-boxes), accounting for both aleatory and epistemic uncertainty. The propagation of p-boxes leads to p-boxes of the output of the computational model. A two-level meta-modelling approach is proposed using non-intrusive sparse polynomial chaos expansions to surrogate the exact computational model and, hence, to facilitate the uncertainty quantification analysis. The capabilities of the proposed approach are illustrated through applications using a benchmark analytical function and two realistic engineering problem settings. They show that the proposed two-level approach allows for an accurate estimation of the statistics of the response quantity of interest using a small number of evaluations of the exact computational model. This is crucial in cases where the computational costs are dominated by the runs of high-fidelity computational models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TRACE/PARCS analysis of the OECD/NEA Oskarshamn-2 BWR stability benchmark

On February 25, 1999, the Oskarshamn-2 NPP experienced a stability event which culminated in diverging power oscillations with a decay ratio of about 1.4. The event was successfully modeled by the TRACE/PARCS coupled code system, and further analysis of the event is described in this paper. The results show very good agreement with the plant data, capturing the entire behavior of the transient including the onset of instability, growth of the oscillations (decay ratio) and oscillation frequency. This provides confidence in the prediction of other parameters which are not available from the plant records. The event provides coupled code validation for a challenging BWR stability event, which involves the accurate simulation of neutron kinetics (NK), thermal-hydraulics (TH), and TH/NK. coupling. The success of this work has demonstrated the ability of the 3-D coupled systems code TRACE/PARCS to capture the complex behavior of BWR stability events. The problem was released as an international OECD/NEA benchmark, and it is the first benchmark based on measured plant data for a stability event with a DR greater than one. Interested participants are invited to contact authors for more information. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

REVIEW OF RESULTS FOR THE OECD/NEA PHASE VII BENCHMARK: STUDY OF SPENT FUEL COMPOSITIONS FOR LONG TERM DISPOSAL

This paper summarizes the problem specification and compares participants results for the OECD/NEA/WPNCS Expert Group on Burn-up Credit Criticality Safety Phase VII Benchmark Study of Spent Fuel Compositions for Long-Term Disposal. The Phase VII benchmark was developed to study the ability of relevant computer codes and associated nuclear data to predict spent fuel isotopic compositions and corresponding keff values in a cask configuration over the time duration relevant to spent nuclear fuel (SNF) disposal. The benchmark was divided into two sets of calculations: (1) decay calculations out to 1,000,000 years for provided pressurized-water-reactor (PWR) UO2 discharged fuel compositions and (2) burnup credit criticality calculations for a representative cask model at selected time steps. Contributions from 15 organizations and companies in 10 countries were submitted to the Phase VII benchmark exercise. This paper provides a description of the Phase VII benchmark and detailed comparisons of the participants isotopic compositions and keff values that were calculated with a diversity of computer codes and nuclear data sets. Differences observed in the calculated time-dependent nuclide densities are attributed to different decay data or code-specific numerical approximations. The variability of the keff results is consistent with the evaluated uncertainty associated with cross-section data.

Radulescu, Georgeta↗

Benchmarking of Software and Methods for Use in Transient Multidimensional Fuel Performance with Spatial Reactor Kinetics

The key physics involved in accurate prediction of reactor-fuel-element behavior includes neutron transport and thermal hydraulics. The thermal hydraulic feedback mechanism is primarily provided through cross sections to the neutron transport that are temperature and density dependent. Historically, this coupling was primarily seen only in reactor simulators, which are well suited to model the reactor core, giving only a coarse treatment to individual fuel pins as well as simple models for thermal distribution calculations. This poor resolution on the primary coupling mechanisms can lead to conservatisms that should be removed to improve fuel design and performance. This work seeks to address the resolution of space-time-dependent neutron kinetics with thermal feedback within the fuel pin scale in the multiphysics framework. The specific application of this new capability is transient performance analysis of space-time-dependent temperature distribution of fuel elements. The coupling between the neutron transport and the thermal feedback is extremely important in this highly coupled problem, primarily applicable to reactivity-initiated-accidents (RIAs) and loss-of-coolant-accidents (LOCAs). The capability developed will include the coupling of the time-dependent neutron transport with the time-dependent thermal diffusion capability. An improvement in resolution and coupling is proposed by developing neutron transport models that are internally coupled with high fidelity within fuel pin thermal calculations in a multiphysics framework. Good agreement is shown with benchmarks and problems from the literature of RIAs and LOCAs for the tools used.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Numerical methods for the inverse problem of density functional theory

Here, the inverse problem of Kohn–Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the numerical methods for solving each problem are substantially different. We examine both problems in this tutorial with a special emphasis on the algorithms and error analysis needed for solving the inverse problem. Two inversion methods based on partial differential equation constrained optimization and constrained variational ideas are introduced. We compare and contrast several different inversion methods applied to one-dimensional finite and periodic model systems.

97 MATHEMATICS AND COMPUTING↗

Cross Section Generation Capability in Griffin

The Griffin code is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. The code reads multigroup cross sections in the ISOXML format generated from external deterministic or Monte Carlo cross section generation codes. The implementation of the cross section generation capability in Griffin was initiated last year by plugging in the cross section application programming interface (CSAPI) and reviewing the methodologies for treating particulate fuels. The focus this year was on improving the CSAPI integration and implementing advanced self-shielding methods for applications to advanced reactor problems with TRISO fuels. First, the process for cross section library generation was updated to accurately and rigorously produce isotopic cross section data. Second, the equivalent Dancoff factor cell method performing slowing down calculations on the fly for the resonance treatment was implemented in CSAPI to improve the accuracy of effective multigroup cross sections in the resonance energy range. Third, the iterative local spatial self-shielding method was implemented under the calculation framework of the equivalent Dancoff factor cell method to accurately deal with the double heterogeneity effect of particulate fuel. The updated CSAPI with the advanced self-shielding methods, together with the cross section libraries generated based on the improved process, were tested for pin-cell, unit-cell, and fuel assembly problems with various resonance self-shielding conditions based on very high temperature reactor, high temperature test reactor, and Empire benchmark cores, indicating that the updated CSAPI in Griffin is able to produce multigroup cross sections accurately and efficiently. We also showed that the methodology worked well for pebble bed fuel from HTR-10, but the capability still needs to be fully integrated into CSAPI. In the future, further benchmark tests will be performed for various thermal reactor core problems, including particulate fuel-based pebble bed reactors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SoK: What does it Mean to Benchmark Database Forensics?

Relational Database Management Systems are the backbone of modern enterprises and public-sector services, and are thus frequent targets of security incidents, insider threats, and thorough regulatory audits. Consequently, databases have become key sources of digital evidence, requiring investigators to reconstruct past activity from audit logs, transaction logs, and backups. Although benchmarking frameworks such as those developed by the Transaction Processing Performance Council (TPC) are widely used to evaluate database performance, they do not capture forensic requirements such as evidentiary completeness, tamper-evidence, chain of custody, or regulatory compliance under GDPR and CCPA. This survey examines the emerging domain of forensic database benchmarking. We gathered prior research on database forensics, secure logging, and tamper-evident data structures; we analyze modern forensic-ready features in commercial and open-source systems (SQL Server Ledger, Oracle Blockchain Tables, PostgreSQL pgAudit, Db2 Audit, Aurora Database Activity Streams, Oracle Real Application Security and IBM Guardium) and assess why existing benchmarks are insufficient. We propose forensic workloads, metrics, and methodologies that incorporate adversarial stressors, deleted-record recovery, and backup analysis. We also identify open research problems and call for a community-driven forensic benchmark suite. The result is an idea for evaluating not only database performance but also forensic soundness, bridging the gap between system engineering, compliance, and digital investigations.

Lenard, Ben↗

Robust Recovery of Temporally Smooth Signals From Under-Determined Multiple Measurements

In this study, we consider the problem of recovering jointly sparse vectors from underdetermined measurements that are corrupted by both additive noise and outliers. This can be viewed as the robust extension of the Multiple Measurement Vector (MMV) problem. To solve this problem, we propose two general approaches. As a benchmark, the first approach preprocesses the input for outlier removal and then employs state-of-the-art technologies for signal recovery. The second approach, as the main contribution of this paper, is based on formulation of an innovative regularized fitting problem. By solving the regularized fitting problem, we jointly remove outliers and recover the sparse vectors. Furthermore, by exploiting temporal smoothness among the sparse vectors, we improve noise robustness of the proposed approach and avoid the problem of over-fitting. Extensive numerical results are provided to illustrate the excellent performance of the proposed approach.

47 OTHER INSTRUMENTATION↗

Machine Learning meets Algebraic Combinatorics: A Suite of Benchmark Datasets to Accelerate AI for Mathematics Research

The use of benchmark datasets has become an important engine of progress in machine learning (ML) over the past 15 years. Recently there has been growing interest in utilizing machine learning to drive advances in research-level mathematics. However, off-the-shelf solutions often fail to deliver the types of insights required by mathematicians. This suggests the need for new ML methods specifically designed with mathematics in mind. The question then is: what benchmarks should the community use to evaluate these? On the one hand, toy problems such as learning the multiplicative structure of small finite groups have become popular in the mechanistic interpretability community whose perspective on explainability aligns well with the needs of mathematicians. While toy datasets are a useful benchmark for initial work, they lack the scale, complexity, and sophistication of many of the principal objects of study in modern mathematics. To address this, we introduce a new collection of benchmark datasets, Algebraic Combinatorics Benchmarks (ACBench), representing either classic or open problems in algebraic combinatorics, a subfield of mathematics that studies discrete structures arising from abstract algebra. After describing the datasets, we discuss the challenges involved in constructing “good” mathematics benchmarks, describe baseline model performance, and discuss some of the insights these datasets can provide that may be of interest even to those who are not interested in mathematics research itself.

97 MATHEMATICS AND COMPUTING↗

Accurate quantum chemical calculations

An important goal of quantum chemical calculations is to provide an understanding of chemical bonding and molecular electronic structure. A second goal, the prediction of energy differences to chemical accuracy, has been much harder to attain. First, the computational resources required to achieve such accuracy are very large, and second, it is not straightforward to demonstrate that an apparently accurate result, in terms of agreement with experiment, does not result from a cancellation of errors. Recent advances in electronic structure methodology, coupled with the power of vector supercomputers, have made it possible to solve a number of electronic structure problems exactly using the full configuration interaction (FCI) method within a subspace of the complete Hilbert space. These exact results can be used to benchmark approximate techniques that are applicable to a wider range of chemical and physical problems. The methodology of many-electron quantum chemistry is reviewed. Methods are considered in detail for performing FCI calculations. The application of FCI methods to several three-electron problems in molecular physics are discussed. A number of benchmark applications of FCI wave functions are described. Atomic basis sets and the development of improved methods for handling very large basis sets are discussed: these are then applied to a number of chemical and spectroscopic problems; to transition metals; and to problems involving potential energy surfaces. Although the experiences described give considerable grounds for optimism about the general ability to perform accurate calculations, there are several problems that have proved less tractable, at least with current computer resources, and these and possible solutions are discussed.

Bauschlicher, Charles W., Jr.↗

An iterative finite difference method for solving the quantum hydrodynamic equations of motion

The quantum hydrodynamic equations of motion associated with the de Broglie-Bohm description of quantum mechanics describe a time evolving probability density whose 'fluid' elements evolve as a correlated ensemble of particle trajectories. These equations are intuitively appealing due to their similarities with classical fluid dynamics and the appearance of a generalized Newton's equation of motion in which the total force contains both a classical and quantum contribution. However, the direct numerical solution of the quantum hydrodynamic equations (QHE) is fraught with challenges: the probability 'fluid' is highly-compressible, it has zero viscosity, the quantum potential ('pressure') is non-linear, and if that weren't enough the quantum potential can also become singular during the course of the calculations. Collectively these properties are responsible for the notorious numerical instabilities associated with a direct numerical solution of the QHE. The most successful and stable numerical approach that has been used to date is based on the Moving Least Squares (MLS) algorithm. The improved stability of this approach is due to the repeated local least squares fitting which effectively filters or reduces the numerical noise which tends to accumulate with time. However, this method is also subject to instabilities if it is pushed too hard. In addition, the stability of the MLS approach often comes at the expense of reduced resolution or fidelity of the calculation (i.e., the MLS filtering eliminates the higher-frequency components of the solution which may be of interest). Recently, a promising new solution method has been developed which is based on an iterative solution of the QHE using finite differences. This method (referred to as the Iterative Finite Difference Method or IFDM) is straightforward to implement, computationally efficient, stable, and its accuracy and convergence properties are well understood. A brief overview of the IFDM will be presented followed by a couple of benchmark applications on one- and two-dimensional Eckart barrier scattering problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗