SEARCH · Engineering Papers

Results for “range finding algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Baseflow Identification via Explainable AI With Kolmogorov‐Arnold Networks

Abstract Hydrological models often involve constitutive laws that may not be optimal in every application. We propose to replace such laws with the Kolmogorov‐Arnold networks (KANs), a class of neural networks designed to identify symbolic expressions. We demonstrate KAN's potential on the problem of baseflow identification, a notoriously challenging task plagued by significant uncertainty. KAN‐derived functional dependencies of the baseflow components on the aridity index outperform their original counterparts; they demonstrate that water availability, rather than potential evapotranspiration, drives baseflow by constraining actual evapotranspiration under arid conditions. On a test set, they increase the Nash‐Sutcliffe efficiency (NSE) by 65%, decrease the root mean squared error by 29%, and increase the Kling‐Gupta efficiency by 34%. This superior performance is achieved while reducing the number of fitting parameters from three to two. Next, we use data from 378 catchments across the continental United States to refine the water‐balance equation at the mean‐annual scale. The KAN‐derived equations based on the refined water balance outperform both the current aridity index model, with up to a 105% increase in NSE, and the KAN‐derived equations based on the original water balance. While the performance of our model and tree‐based machine learning methods is similar, KANs offer the advantage of simplicity and transparency and require no specific software or computational tools. This case study focuses on the aridity index formulation, but the approach is flexible and transferable to other hydrological processes. Plain Language Summary Equations used in hydrologic model are often suboptimal, resulting in reduced prediction accuracy and efficiency. We implemented Kolmogorov‐Arnold networks (KAN), a machine learning algorithm for deriving symbolic formulations, to estimate groundwater recharge and showed that it outperforms an existing state‐of‐the‐art semi‐empirical formulation. In hydrology, Nash‐Sutcliffe efficiency (NSE), root mean squared error (RMSE), and Kling‐Gupta efficiency (KGE) are commonly used to evaluate model performance. Higher NSE and KGE values indicate better performance, while lower RMSE values are preferable. Our results show that NSE increased by 71%, RMSE decreased by 32%, and KGE improved by 25%. In addition, KAN identifies an optimal functional form and can be used to derive new analytical formulas using the prior knowledge. The KAN‐inspired equation outperformed the original formulation and reduced the fitting parameters. Furthermore, we refined the water‐balance equation at the mean‐annual scale and showed that, based on the new water‐balance equation, KAN can derive new formulations that are superior to the original aridity index formulations (up to 105% increase in NSE) and KAN‐derived equations based on the original water balance. These findings highlight the significant potential of KAN to advance the scientific understanding of a wide range of hydrologic processes. Key Points Kolmogorov‐Arnold networks (KANs) enhance interpretability of machine‐learned hydrological models KAN‐derived symbolic formulations outperform state‐of‐the‐art semi‐empirical aridity indices KAN‐identified functional form yields an analytical index with fewer fitting parameters and improved performance

baseflow↗

DOE OSTI2023

The evolution of HCO + in molecular clouds using a novel chemical post-processing algorithm

Modelling the chemistry of molecular clouds is critical to accurately simulating their evolution. To reduce computational cost, 3D simulations generally restrict their chemistry to species with strong heating and cooling effects. Time-dependent information about the evolution of other species is therefore often neglected. We address this gap by post-processing tracer particles in the SILCC-Zoom molecular cloud simulations. Using a chemical network of 39 species and 301 reactions (including freeze-out of CO and H 2 O) and a novel algorithm to reconstruct a density grid from sparse tracer particle data, we produce time-dependent density distributions for various species. We focus upon the evolution of HCO + , which is a critical formation reactant of CO but is not typically modelled on the fly. We find that ∼ 90 per cent of the HCO + content of the cold molecular gas forms in situ around n HCO + ∼ 10 3 –10 4 cm −3 , over a time-scale of approximately 1 Myr. The remaining ∼ 10 per cent forms at high extinction sites, with minimal turbulent mixing out into the less dense gas. We further show that the dominant HCO + formation pathway is dependent on the visual extinction, with the reaction H 3 + + CO contributing 90 per cent of the total HCO + production above A V, 3D = 3. We produce the very first maps of the HCO + column density, N(HCO + ), and show that it reaches values as high as 10 15 cm −2 . We find that 50 per cent of the HCO + mass is located within AV ∼ 10–30 in a density range of 10 3.5 –10 4.5 cm −3 . Our maps of N(HCO + ) are shown to be in good agreement with recent observations of the W49A star-forming region.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

The Simons Observatory: Combining cross-spectral foreground cleaning with multitracer B -mode delensing for improved constraints on inflation

The Simons Observatory (SO), due to start full science operations in early 2025, aims to set tight constraints on inflationary physics by inferring the tensor-to-scalar ratio r from measurements of cosmic microwave background (CMB) polarization B-modes. Its nominal design including three small-aperture telescopes (SATs) targets a precision σ⁡(r = 0) ≤ 0.003 without delensing. Achieving this goal and further reducing uncertainties requires a thorough understanding and mitigation of other large-scale B-mode sources such as Galactic foregrounds and weak gravitational lensing. We present an analysis pipeline aiming to estimate r by including delensing within a cross-spectral likelihood, and demonstrate it for the first time on SO-like simulations accounting for various levels of foreground complexity, inhomogeneous noise and partial sky coverage. As introduced in an earlier SO delensing paper, lensing B-modes are synthesized using internal CMB lensing reconstructions as well as Planck-like cosmic infrared background maps and LSST-like galaxy density maps. We then extend SO’s power-spectrum-based foreground-cleaning algorithm to include all auto- and cross-spectra between the lensing template and the SAT B-modes in the likelihood function. This allows us to constrain r and the parameters of our foreground model simultaneously. Within this framework, we demonstrate the equivalence of map-based and cross-spectral delensing and use it to motivate an optimized pixel-weighting scheme for power spectrum estimation. We start by validating our pipeline in the simplistic case of uniform foreground spectral energy distributions. In the absence of primordial B-modes, we find that the 1⁢σ statistical uncertainty on r, σ⁡(r), decreases by 37% as a result of delensing. Tensor modes at the level of r = 0.01 are successfully detected by our pipeline. Even when using more realistic foreground models including spatial variations in the dust and synchrotron spectral properties, we obtain unbiased estimates of r both with and without delensing by employing the moment-expansion method. In this case, uncertainties are increased due to the higher number of model parameters, and delensing-related improvements range between 27% and 31%. These results constitute the first realistic assessment of the delensing performance at SO’s nominal sensitivity level.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Toward Consistent High-Fidelity Quantum Learning on Unstable Devices via Efficient In-Situ Calibration

In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. What's worse, recent works reveal that the noise on quantum devices is not stable, that is, the noise is dynamically changing over time. This leads to an imminent challenging problem: At run-time, is there a way to efficiently achieve a consistent high-fidelity quantum system on unstable devices? To study this problem, we take quantum learning (a.k.a., variational quantum algorithm) as a vehicle, which has a wide range of applications, such as combinatorial optimization and machine learning. A straightforward approach is to optimize a variational quantum circuit (VQC) with a parameter-shift approach on the target quantum device before using it; however, the optimization has an extremely high time cost, which is not practical at run-time. To address the pressing issue, in this paper, we proposed a novel quantum pulse-based noise adaptation framework, namely QuPAD. In the proposed framework, first, we identify that the CNOT gate is the fidelity bottleneck of the conventional VQC, and we employ a more robust parameterized multi-qubit gate (i.e., Rzx gate) to replace CNOT gate. Second, by benchmarking Rzx gate with different parameters, we build a fitting function for each coupling qubit pair, such that the deviation between the theoretic output of Rzx gate and its on-device output under a given pulse amplitude and duration can be efficiently predicted. On top of this, an evolutionary algorithm is devised to identify the pulse amplitude and duration of each Rzx gate (i.e., calibration) and find the quantum circuits with high fidelity. Experiments show that the runtime on quantum devices of QuPAD with 8–10 qubits is less than 15 minutes, which is up to 270 x faster than the parameter-shift approach. In addition, compared to the vanilla VQC as a baseline, QuPAD can achieve 59.33% accuracy gain on a classification task, and average 66.34% closer to ground state energy for molecular simulation.

Hu, Zhirui↗

DOE OSTI2025

Record acceleration of the two-dimensional Ising model using a high-performance wafer-scale engine

The versatility and wide-ranging applicability of the Ising model, originally introduced to study phase transitions in magnetic materials, have made it a cornerstone in statistical physics and a valuable tool for evaluating the performance of emerging computer hardware. Here, we present a novel implementation of the two-dimensional Ising model on Cerebras Wafer-Scale Engine (WSE) – a revolutionary processor that is opening new frontiers in computing. In our deployment of the checkerboard algorithm, we optimized the Ising model to take advantage of the unique WSE architecture. Specifically, we employed a compressed bit representation storing 16 spins on each int16 word, and efficiently distributed the spins over the processing units enabling seamless weak scaling and limiting communications to only immediate neighboring units. Our implementation can handle up to 754 simulations in parallel, achieving an aggregate of over 61.8 trillion flip attempts per second for Ising models with up to 200 million spins. This represents a gain of up to 148 times over previously reported single-devices with a highly optimized implementation on NVIDIA V100 and up to 88 times in productivity compared to NVIDIA H100. Our findings highlight the significant potential of the WSE in scientific computing, particularly in the field of materials modeling.

Ising model↗

DOE OSTI2022

Finding Fast Transients in Real Time Using a Novel Light-curve Analysis Algorithm

The current data acquisition rate of astronomical transient surveys and the promise for significantly higher rates in the next decade necessitate the development of novel approaches to analyze astronomical data sets and promptly detect objects of interest. The Deeper, Wider, Faster (DWF) program is a survey focused on the identification of fast-evolving transients, such as fast radio bursts, gamma-ray bursts, and supernova shock breakouts. It employs multifrequency simultaneous coverage of the same part of the sky over several orders of magnitude. Using the Dark Energy Camera mounted on the 4 m Blanco telescope, DWF captures a 20 s g -band exposure every minute, at a typical seeing of ~1'' and an air mass of ~1.5. These optical data are collected simultaneously with observations conducted over the entire electromagnetic spectrum—from radio to γ -rays—as well as cosmic-ray observations. In this paper, we present a novel real-time light-curve analysis algorithm, designed to detect transients in the DWF optical data; this algorithm functions independently from, or in conjunction with, image subtraction. We present a sample of fast transients detected by our algorithm, as well as a false-positive analysis. Our algorithm is customizable and can be tuned to be sensitive to transients evolving over different timescales and flux ranges.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

COOL-LAMPS. VII. Quantifying Strong-lens Scaling Relations with 177 Cluster-scale Strong Gravitational Lenses in DECaLS

Abstract We estimate the Einstein-radius-enclosed total mass for 177 cluster-scale strong gravitational lenses identified by the ChicagO Optically selected Lenses Located At the Margins of Public Surveys (COOL-LAMPS) collaboration with lens redshifts ranging from 0.2 ⪅ z ⪅ 1.0 using the brightest-cluster-galaxy (BCG) redshift and an observable proxy for the Einstein radius. We constrain the Einstein-radius-enclosed luminosity and stellar mass by fitting parametric spectral energy distributions to aperture photometry from the Dark Energy Camera Legacy Survey (DECaLS) in the g -, r -, and z -band Dark Energy Camera filters. We find that the BCG redshift, enclosed total mass, and enclosed luminosity are strongly correlated and well described by a planar relationship in 3D space. We find that the enclosed total mass and stellar mass are correlated with a logarithmic slope of 0.50 0 − 0.031 + 0.029 , and the enclosed total mass and stellar-to-total mass fraction are correlated with a logarithmic slope of − 0.49 5 − 0.033 + 0.032 . In tandem with the small radii within which these slopes are constrained, this may suggest invariance in baryon conversion efficiency and feedback strength as a function of cluster-centric radii in galaxy clusters. Additionally, the correlations described here should have utility in ranking strong-lensing candidates in upcoming imaging surveys—such as Rubin/Legacy Survey of Space and Time—in which an algorithmic treatment of strong lenses will be needed due to the sheer volume of data these surveys will produce.

Mork, Simon D. (ORCID:0000000255739131)↗

DOE OSTI2021

How much information on precipitation is contained in satellite infrared imagery?

Satellite infrared (IR) brightness temperature providing information on the characteristics of cloud tops is one of the primary input data used for estimating precipitation from satellites. Thus, the natural questions to ask are: Does IR imagery contain more information about precipitation in some regions more than others? What are the factors that lead to such differences? Should we expect the amount of information provided by IR imagery to change with respect to temporal or spatial aggregation? Comprehensive analysis of the accuracy of satellite-based precipitation estimates obtained from any given algorithm may provide qualitative answers to the above questions. However, such an approach only offers conclusions within the limited context of the algorithm used to obtain precipitation estimates; that is, patterns caused by the inherent information content of IR imagery are inextricable from those induced by assumptions embedded in the precipitation estimation algorithm. Here, we address the abovementioned questions from a different perspective using an information-theoretic measure, free of structural assumptions and general to a wide range of relationships, to characterize the average and seasonal dependence between IR imagery provided by satellite sensors in the spectral range (10.7–11.5 μm) and precipitation rates in the contiguous United States (CONUS) across distinct temporal and spatial scales. We analyze a total of more than 1.3 billion pairs of IR and precipitation observations over CONUS, and we observe interesting patterns. First, we show that there is a strong inverse relationship (ρ = - 0.73) between the information content of IR data and the number of no-rain observations; however, its robustness varies regionally and seasonally with less significant correlation during the warm season. Second, we demonstrate that the intuitive relationship of increasing dependence between IR and precipitation as a result of temporal or spatial aggregation exhibits a diminishing returns behavior. For instance, temporal aggregation from 1 to 3 h increases the dependence approximately 7 times as much as temporal aggregation from 12 to 24 h. Furthermore, we quantitatively examine and re-confirm several statements previously reported in the literature such as the strong association between IR and precipitation in convective storms and the low association in orographic rainfall. Finally, we conclude by illustrating the potential of the analysis in diagnosis of operational algorithms for estimating precipitation from IR brightness temperature. The findings of this study pinpoint spatial domains and time scales at which IR is not an adequate proxy for estimating precipitation. Thus, they can potentially guide the development of operational algorithms that utilize satellite Infrared imagery for estimating, downscaling and data fusion of precipitation. Finally, the analysis presented here opens up the possibility of developing new methodologies for diagnosis of satellite-based precipitation estimation algorithms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Assessment of Machine Learning for Ultrasonic Nondestructive Evaluation of Alkali–Silica Reaction in Concrete

Alkali–silica reaction (ASR) is a type of material degradation in concrete structures that leads to concrete cracking and rebar corrosion, thereby reducing the material’s structural integrity and the overall structure’s lifetime and raising safety concerns. Ultrasonic nondestructive evaluation (NDE) has been proven to be a valuable technique for assessing concrete properties and monitoring ASR progression in concrete. However, the deployment and analysis of ultrasonic NDE and its data requires specialized expertise, often relying on the engineer’s subjective interpretation. With the surge in computational power, artificial intelligence (AI) and machine learning (ML) algorithms have become popular in automating NDE data analysis. Various industrial sectors are increasingly adopting ML algorithms for NDE data analysis with a growing emphasis on AI–assisted automation. Regulatory agencies are also preparing for this technological shift, anticipating corresponding revisions in standards. Thus, there is an urgent need to identify the capabilities and limitations of current ML technologies for the evaluation of concrete material properties and damage status. Furthermore, the effects of various factors on ML model performance must be thoroughly investigated. The study summarized herein evaluated the effectiveness of two ML models (i.e., support vector regression (SVR) and deep neural network (DNN)) in predicting concrete material damage induced by ASR based on the long-term ultrasonic monitoring data. Four distinct concrete specimens were cast with artificially induced ASR, and over a period exceeding 500 days, ultrasonic signals and expansion data were continuously collected. For the SVR model, wave velocity and 12 other wave features were extracted from the ultrasonic signals, with 6 out of 13 features selected as input for the model. Different combinations of training and testing datasets were designed to explore factors influencing prediction performance, including the range of data within training and testing sets, in addition to various signal preprocessing methodologies. These findings suggest the importance of using a training dataset with a broader data range compared with testing datasets for improved model performance alongside consistent signal preprocessing across datasets.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Dictionary Learning with Accumulator Neurons

The Locally Competitive Algorithm (LCA) uses local competition between non-spiking leaky integrator neurons to infer sparse representations, allowing for potentially real-time execution on massively parallel neuromorphic architectures such as Intel's Loihi processor. Here, we focus on the problem of inferring sparse representations from streaming video using dictionaries of spatiotemporal features optimized in an unsupervised manner for sparse reconstruction. Non-spiking LCA has previously been used to achieve unsupervised learning of spatiotemporal dictionaries composed of convolutional kernels from raw, unlabeled video. We demonstrate how unsupervised dictionary learning with spiking LCA (\hbox{S-LCA}) can be efficiently implemented using accumulator neurons, which combine a conventional leaky-integrate-and-fire (\hbox{LIF}) spike generator with an additional state variable that is used to minimize the difference between the integrated input and the spiking output. We demonstrate dictionary learning across a wide range of dynamical regimes, from graded to intermittent spiking, for inferring sparse representations of both static images drawn from the CIFAR database as well as video frames captured from a DVS camera. On a classification task that requires identification of the suite from a deck of cards being rapidly flipped through as viewed by a DVS camera, we find essentially no degradation in performance as the LCA model used to infer sparse spatiotemporal representations migrates from graded to spiking. We conclude that accumulator neurons are likely to provide a powerful enabling component of future neuromorphic hardware for implementing online unsupervised learning of spatiotemporal dictionaries optimized for sparse reconstruction of streaming video from event based DVS cameras.

artificial intelligence↗

DOE OSTI2024

A novel methodology for gamma-ray spectra dataset procurement over varying standoff distances and source activities

The adoption of machine learning approaches for gamma-ray spectroscopy has received considerable attention in the literature. Many studies have investigated the deployment of various algorithm architectures to a specific task. However, little attention has been afforded to the development of the datasets leveraged to train the models. Such training datasets typically span a set of environmental or detector parameters to encompass a problem space of interest to a user. Variations in these measurement parameters will also induce fluctuations in the detector response, including expected pile-up and ground scatter effects. Fundamental to this work is the understanding that 1) the underlying spectral shape varies as the measurement parameters change and 2) the statistical uncertainties associated with two spectra impact their level of similarity. While previous studies attribute some arbitrary discretization to the measurement parameters for the generation of their synthetic training data, this work introduces a principled methodology for efficient spectral-based discretization of a problem space. A signal-to-noise ratio (SNR) respective spectral comparison measure and a Gaussian Process Regression (GPR) model are used to predict the spectral similarity across a range of measurement parameters. This innovative approach effectively showcased its capability by dividing a problem space, ranging from 5 cm to 100 cm standoff distances and 5 μCi–100 μCi of 137 Cs, into three unique combinations of measurement parameters. The findings from this work will aid in creating more robust datasets, which incorporate many possible measurement scenarios, reduce the number of required experimental test set measurements, and possibly enable experimental training data collection for gamma-ray spectroscopy.

data science↗

DOE OSTI2022

Complexity Phase Diagram for Interacting and Long-Range Bosonic Hamiltonians

Here, we classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in time, extending previous results to include on-site number-conserving interactions and long-range hopping. Specifically, we construct a complexity phase diagram with easy and hard “phases” and derive analytic bounds on the location of the phase boundary with respect to the evolution time and the degree of locality. We find that the location of the phase transition is intimately related to upper bounds on the spread of quantum correlations and protocols to transfer quantum information. Remarkably, although the location of the transition point is unchanged by on-site interactions, the nature of the transition point does change. Specifically, we find that there are two kinds of transitions, sharp and coarse, broadly corresponding to interacting and noninteracting bosons, respectively. Our Letter motivates future studies of complexity in many-body systems and its interplay with the associated physical phenomena.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Modeling electrokinetic flows with the discrete ion stochastic continuum overdamped solvent algorithm

In this article we develop an algorithm for the efficient simulation of electrolytes in the presence of physical boundaries. In previous work the discrete ion stochastic continuum overdamped solvent (DISCOS) algorithm was derived for triply periodic domains, and was validated through ion-ion pair correlation functions and Debye-Hückel-Onsager theory for conductivity, including the Wien effect for strong electric fields. In extending this approach to include an accurate treatment of physical boundaries we must address several important issues. First, the modifications to the spreading and interpolation operators necessary to incorporate interactions of the ions with the boundary are described. Next we discuss the modifications to the electrostatic solver to handle the influence of charges near either a fixed potential or dielectric boundary. An additional short-ranged potential is also introduced to represent interaction of the ions with a solid wall. Finally, the dry diffusion term is modified to account for the reduced mobility of ions near a boundary, which introduces an additional stochastic drift correction. Herein, several validation tests are presented confirming the correct equilibrium distribution of ions in a channel. Additionally, the methodology is demonstrated using electro-osmosis and induced-charge electro-osmosis, with comparison made to theory and other numerical methods. Notably, the DISCOS approach achieves greater accuracy than a continuum electrostatic simulation method. We also examine the effect of under-resolving hydrodynamic effects using a “dry diffusion” approach, and find that considerable computational speedup can be achieved with a negligible impact on accuracy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Sensor impact evaluation and verification for fault detection and diagnostics in building energy systems: A review

Sensors are the key information source for fault detection and diagnostics (FDD) in buildings. However, sensors are often not properly designed, installed, calibrated, located, and maintained, which negatively impacts FDD performance. Several sensor-related FDD topics have been widely studied, covering a wide range of fault types and applications. However, it is difficult to get a clear picture of the technical development of sensor-related topics in FDD. A systematic review of sensor topics is needed to summarize the existing research in a logical way, draw conclusions on the current development, and predict the future development of sensors in building FDD. To address this gap, we conducted a comprehensive literature review of more than 100 FDD-sensor-related papers. In this article, we subdivide the FDD tasks into building-level, system-level, and component-level FDD, and review sensor-related topics in each category. Our major conclusions are: (a) current data-driven FDD research focuses more on FDD algorithms than sensors, (b) sensor “hardware” research topics are less studied than sensor “software” topics, (c) very few papers focus on sensor engineering as an integral aspect of FDD development, and (d) some important sensor topics, such as sensor cost-effectiveness and sensor schema/layout/location, are not well studied. Finally, we discuss the need for a systematic framework of FDD sensors and models to integrate sensor design/selection, sensor data analysis/mining, feature selection, physics-based or data-driven algorithm development, sensor fault detection, sensor calibration, and sensor maintenance. Finally, expert interviews are conducted to validate the above findings and conclusions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2020

Measurement of groomed jet substructure observables in p+p collisions at $\sqrt{s} =$ 200 GeV with STAR

In this letter, measurements of the shared momentum fraction ( z g ) and the groomed jet radius ( R g ), as defined in the SoftDrop algorithm, are reported in p+p collisions at s = 200 GeV collected by the STAR experiment. These substructure observables are differentially measured for jets of varying resolution parameters from R = 0.2 – 0.6 in the transverse momentum range 15 < p T , jet < 60 GeV/ c . These studies show that, in the p T , jet range accessible at s = 200 GeV and with increasing jet resolution parameter and jet transverse momentum, the z g distribution asymptotically converges to the DGLAP splitting kernel for a quark radiating a gluon. The groomed jet radius measurements reflect a momentum-dependent narrowing of the jet structure for jets of a given resolution parameter, i.e., the larger the p T , jet , the narrower the first splitting. For the first time, these fully corrected measurements are compared to Monte Carlo generators with leading order QCD matrix elements and leading log in the parton shower, and to state-of-the-art theoretical calculations at next-to-leading-log accuracy. We observe that PYTHIA 6 with parameters tuned to reproduce RHIC measurements is able to quantitatively describe data, whereas PYTHIA 8 and HERWIG 7, tuned to reproduce LHC data, are unable to provide a simultaneous description of both z g and R g , resulting in opportunities for fine parameter tuning of these models for p+p collisions at RHIC energies. We also find that the theoretical calculations without non-perturbative corrections are able to qualitatively describe the trend in data for jets of large resolution parameters at high p T , jet , but fail at small jet resolution parameters and low jet transverse momenta.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Analysis of Polarized Dust Emission Using Data from the First Flight of SPIDER

Using data from the first flight of Spider and from the Planck High Frequency Instrument, we probe the properties of polarized emission from interstellar dust in the Spider observing region. Component-separation algorithms operating in both the spatial and harmonic domains are applied to probe their consistency and to quantify modeling errors associated with their assumptions. Analyses of diffuse Galactic dust emission spanning the full Spider region demonstrate (i) a spectral energy distribution that is broadly consistent with a modified-blackbody (MBB) model with a spectral index of β d = 1.45 ± 0.05 (1.47 ± 0.06) for E (B)-mode polarization, slightly lower than that reported by Planck for the full sky; (ii) an angular power spectrum broadly consistent with a power law; and (iii) no significant detection of line-of-sight polarization decorrelation. Tests of several modeling uncertainties find only a modest impact (~10% in σ r ) on Spider's sensitivity to the cosmological tensor-to-scalar ratio. The size of the Spider region further allows for a statistically meaningful analysis of the variation in foreground properties within it. Assuming a fixed dust temperature T d = 19.6 K, an analysis of two independent subregions of that field results in inferred values of β d = 1.52 ± 0.06 and β d = 1.09 ± 0.09, which are inconsistent at the 3.9σ level. Furthermore, a joint analysis of Spider and Planck 217 and 353 GHz data within one subregion is inconsistent with a simple MBB at more than 3σ, assuming a common morphology of polarized dust emission over the full range of frequencies. This evidence of variation may inform the component-separation approaches of future cosmic microwave background polarization experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗