Finding my Drumbeat: Applying Lessons Learned from Remo Ruffini to Understanding Astrophysical Transients
Explore the source record for details and available documents.
Fryer, Christopher Lee↗
SEARCH · Search NASA
Results for “Findings”
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.
Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics
Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.
97 MATHEMATICS AND COMPUTING↗
FIND: A Synthetic weather generator to control drought Frequency, Intensity, and Duration
Water systems worldwide are experiencing climate change-induced shifts in drought properties like frequency, intensity, and duration, affecting water security and reliability. To develop and test effective drought preparedness plans, researchers often use synthetic weather generators to create hydrological scenarios that explore drought variability beyond historical records. Existing weather generators typically allow users to adjust streamflow statistics like percentiles or temporal correlation but do not directly control drought properties of frequency, intensity, and duration. To fill this gap, we propose FIND (Frequency, INtensity, and Duration) synthetic weather generator. FIND incorporates a standardized drought index to directly and in dependently control drought frequency, intensity, and duration in generated streamflow time series while preserving observed hydrological variability. Use cases for FIND include i) water systems analysis applications that seek to train and test drought strategies under historical and plausible future drought conditions, and ii) bottom-up vulnerability studies relating system vulnerability outcomes to specific changes in drought properties of frequency, intensity, and duration. Here, we demonstrate FIND’s versatility through three experiments: replicating historically observed drought properties, generating streamflow scenarios for multiple sites preserving correlation between their drought conditions, and generating a set of scenarios with direct and independent changes in drought properties. FIND source code is openly available for applications beyond the scope of this paper.
42 ENGINEERING↗
A Comparison of Void-finding Algorithms Using Crossing Numbers
We study how well void-finding algorithms identify cosmic void regions and whether we can quantitatively and qualitatively compare the voids they find with dynamical information from the underlying matter distribution. Using the ORIGAMI algorithm to determine the number of dimensions along which dark matter particles have undergone shell crossing (crossing number) in N-body simulations from the AbacusSummit simulation suite, we identify dark matter particles that have undergone no shell crossing as belonging to voids. We then find voids in the corresponding halo distribution using two different void-finding algorithms: VoidFinder and V 2 , a ZOBOV-based algorithm. The resulting void catalogs are compared to the distribution of dark matter particles to examine how their crossing numbers depend on void proximity. While both algorithms' voids have a similar distribution of crossing numbers near their centers, we find that beyond 0.25 times the effective void radius, voids found by VoidFinder exhibit a stronger preference for particles with low crossing numbers than those found by V 2 . We examine two possible methods of mitigating this difference in efficacy between the algorithms. While we are able to partially mitigate the ineffectiveness of V 2 by using the distance from the void edge as a measure of centrality, we conclude that VoidFinder more reliably identifies dynamically distinct regions of low crossing number.
79 ASTRONOMY AND ASTROPHYSICS↗
Cluster cosmology without cluster finding
ABSTRACT We propose that observations of supermassive galaxies contain cosmological statistical constraining power similar to conventional cluster cosmology, and we provide promising indications that the associated systematic errors are comparably easier to control. We consider a fiducial spectroscopic and stellar mass complete sample of galaxies drawn from the Dark Energy Spectroscopic Instrument (DESI) and forecast how constraints on Ωm–σ8 from this sample will compare with those from number counts of clusters based on richness λ. At fixed number density, we find that massive galaxies offer similar constraints to galaxy clusters. However, a mass-complete galaxy sample from DESI has the potential to probe lower halo masses than standard optical cluster samples (which are typically limited to λ ≳ 20 and Mhalo ≳ 1013.5 M⊙ h−1); additionally, it is straightforward to cleanly measure projected galaxy clustering wp for such a DESI sample, which we show can substantially improve the constraining power on Ωm. We also compare the constraining power of M*-limited samples to those from larger but mass-incomplete samples [e.g. the DESI Bright Galaxy Survey (BGS) sample]; relative to a lower number density M*-limited samples, we find that a BGS-like sample improves statistical constraints by 60 per cent for Ωm and 40 per cent for σ8, but this uses small-scale information that will be harder to model for BGS. Our initial assessment of the systematics associated with supermassive galaxy cosmology yields promising results. The proposed samples have a ∼10 per cent satellite fraction, but we show that cosmological constraints may be robust to the impact of satellites. These findings motivate future work to realize the potential of supermassive galaxies to probe lower halo masses than richness-based clusters and to potentially avoid persistent systematics associated with optical cluster finding.
(cosmology): large-scale structure of Universe↗
Finding the Pareto front for high-entropy-alloy catalysts
Finding catalysts that have both high activity and high stability presents a long-standing challenge. Since optimizing activity and stability are conflicting objectives, the best one can do is find the Pareto front that yields optimal tradeoffs between these features. On the Pareto front, there is a trade-off where a portion of catalytic activity must be sacrificed to gain further stability and vice versa . Here, we provide a method to optimize the front by designing a multi-objective genetic algorithm that combines machine learning, graph neural network calculations, and density functional calculations. The application considered is the oxygen evolution reaction catalyzed by high-entropy alloys. We find that the Pareto front generally contains alloys with diverse elements, but that enhancing stability inevitably inflicts a toll on activity. We compare the general conclusions of our work to a survey of 545 experiments.
Zhang, Chengyi [Univ. of Auckland (New Zealand)]↗
A Bayesian approach to strong lens finding in the era of wide-area surveys
ABSTRACT The arrival of the Vera C. Rubin Observatory’s Legacy Survey of Space and Time (LSST), Euclid-Wide and Roman wide-area sensitive surveys will herald a new era in strong lens science in which the number of strong lenses known is expected to rise from $\mathcal {O}(10^3)$ to $\mathcal {O}(10^5)$. However, current lens-finding methods still require time-consuming follow-up visual inspection by strong lens experts to remove false positives which is only set to increase with these surveys. In this work, we demonstrate a range of methods to produce calibrated probabilities to help determine the veracity of any given lens candidate. To do this we use the classifications from citizen science and multiple neural networks for galaxies selected from the Hyper Suprime-Cam survey. Our methodology is not restricted to particular classifier types and could be applied to any strong lens classifier which produces quantitative scores. Using these calibrated probabilities, we generate an ensemble classifier, combining citizen science, and neural network lens finders. We find such an ensemble can provide improved classification over the individual classifiers. We find a false-positive rate of 10−3 can be achieved with a completeness of 46 per cent, compared to 34 per cent for the best individual classifier. Given the large number of galaxy–galaxy strong lenses anticipated in LSST, such improvement would still produce significant numbers of false positives, in which case using calibrated probabilities will be essential for population analysis of large populations of lenses and to help prioritize candidates for follow-up.
79 ASTRONOMY AND ASTROPHYSICS↗
Testing the Jump Finding Code for NEXUS Qubit Analysis
We evaluate a new jump finding code to test the efficiency of this code in finding jumps of all sizes and understand how noise is mistaken for jumps and vice versa. We look at two parameters that impact the efficiency of the code. The two parameters, the jump threshold and smoothing, are then optimized to find the most efficient combination with the highest fraction of true positives and true negatives.
Wagner, Grace↗
Replication Package for "Union-Find and Usability: A Case Study and Analysis of Rust Formal Verifier
This replication package is a case study on automated deductive verification for Rust for practical programs. It is a companion artifact to a corresponding usability study on verification titled "Union-Find and Usability: A Case Study and Analysis of Rust Formal Verifiers". It seeks to answer the question "Can Rust developers today use Rust verifiers to verify their code?". To answer this question, the study contrasts the verification experience of two mature Rust verifiers, Creusot and Prusti, by using the tools to develop a verified implementation of union-find in Rust. The union-find implementation is based on real-world code as used in the popular egg E-graph library. The artifact consists of two different verified libraries, one using Creusot and one using Prusti. The libraries have similar Rust interfaces and high-level proofs but differ in their details: Creusot and Prusti have different annotation languages and support different proof styles. Each implementation can be verified with its respective tool and compiles as a traditional Rust development.
Sarracino, John↗
Testing the Jump Finding Code for NEXUS Qubit Analysis
At Fermilab, the NEXUS dilution refrigerator is repeating the same experiment from Wilen et al. 1 underground to further investigate the effect of ionizing radiation and cosmic ray muons on qubit decoherence. This refrigerator is 100m underground in the MINOS cavern to significantly lower the incident rate of cosmic ray muons, meaning the majority of incidents is due to ionizing radiation. To gain a better understanding of how the rate of ionizing radiation affects the qubits, we use 4 radiation configurations to collect data from the chip. In this work, we examine the efficiency of our jump detection code to find jumps of various sizes. We do so using simulated data with a known number of injected jumps of known sizes. These jumps are charge offsets of the qubit, thought to be due to quasiparticle poisoning. To test this, we run the jump finding code on an array of simulated data in which two main parameters, the smoothing factor and the threshold at which a charge offset is considered a jump, are changed to test an array of these parameters. We then perform a χ2 analysis to find the best combination of these two parameters.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
From natural language to control signals: a conceptual framework for semantic channel finding in complex experimental infrastructure
Modern experimental platforms such as particle accelerators, fusion devices, telescopes, and industrial process control systems expose tens to hundreds of thousands of control and diagnostic channels, accumulated over decades of hardware evolution. Operators and AI systems alike depend on informal expert knowledge, inconsistent naming conventions, and scattered documentation to locate the signals required for monitoring, troubleshooting, and automated control, creating a persistent bottleneck for reliability, scalability, and emerging language-model-driven interfaces. We formalize semantic channel finding, the task of mapping natural-language intent to concrete control-system signals, as a general problem in complex experimental infrastructure, and introduce a four-paradigm conceptual framework to guide architecture selection based on facility-specific data regimes. The paradigms span (i) direct in-context lookup over small, curated channel dictionaries, (ii) constrained hierarchical navigation through structured trees, (iii) interactive agent exploration using iterative reasoning and tool-based database queries, and (iv) ontology-grounded semantic search that decouples channel meaning from facility-specific naming conventions. We demonstrate the practical feasibility of each paradigm through proof-of-concept implementations at four operational facilities spanning two orders of magnitude in scale: from compact free-electron lasers to large synchrotron light sources, operating under diverse control-system architectures ranging from clean hierarchical naming schemes to legacy environments with decades of heterogeneous conventions. Where evaluated against expert-curated operational queries, these instantiations achieve 90%–97% accuracy, validating the framework’s applicability across real-world deployment scenarios. To accelerate adoption across the broader scientific and industrial control-system community, we release open-source, plug-and-play implementations of all three interactive paradigms-direct lookup, hierarchical navigation, and middle-layer exploration-within the Osprey framework, together with tools for channel database generation, interactive testing, and minimal-configuration deployment. This work establishes semantic channel finding as a foundational capability for human-centric and agentic AI interfaces at large-scale facilities, providing both a systematic framework for architecture design and practical resources to enable adoption without building custom infrastructure from scratch.
channel finding↗
Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling
A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.
Moltex static salt reactor↗
A simple data-driven level finding method of many-electron atoms and heavy nuclei based on statistical outlier detection
Here, we report a simple and pure data-driven method to find new energy levels of quantum many-body systems only from observed line wavelengths. In our method, all the possible combinations are computed from known energy levels and wavelengths of unidentified lines. As each excited state exhibits many transition lines to different lower levels, the true levels should be reconstructed coincidentally from many level-line combinations, while the wrong combinations distribute randomly. Such a coincidence can be easily detected statistically. We demonstrate this statistical method by finding new levels for various atomic and nuclear systems from unidentified line lists available online.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Finding Your Niche: An Evolutionary Approach to HPC Topologies
Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.
network interconnects, graph search, meta-heuristi↗
Advancing Grid Resilience through Smart Charge Management: Findings from Maryland’s Pilot
This report presents research findings from a four-year Smart Charge Management (SCM) pilot program conducted by Maryland’s largest electric utilities—Baltimore Gas and Electric (BGE), Potomac Electric Power Company (Pepco), and Delmarva Power & Light (DPL)—to evaluate strategies for optimizing electric vehicle (EV) charging loads and enhancing grid stability. Supported by the U.S. Department of Energy (DOE), Argonne National Laboratory collaborated with all project partners and examined the effectiveness of Time-of-Use (TOU) and Load Balancing (LB) strategies in managing peak demand, deferring costly infrastructure upgrades, and reducing grid constraints at the feeder level. Using charging data from over 4,600 EV drivers, the study analyzed SCM’s impact on the distribution systems of BGE and Pepco, which consists of over 2000 feeders. Unlike prior research that focused on system-wide trends or synthetic feeders, this analysis offers granular, feeder-level insights based on real-world operational data. It highlights how transformer density, load profiles, and infrastructure constraints influence smart charging performance. Results show feeder-level conditions play a crucial role in SCM effectiveness, with most feeders benefiting more from LB, while TOU-based SCM may be sufficient for others. By 2035, LB reduced peak charging loads by 27% on average, compared to 23% under TOU-based SCM, though some feeders saw reductions exceeding 35%, while others experienced minimal impact. Feeders with higher transformer utilization and limited capacity benefited more from LB, which more effectively distributed charging demand during off-peak hours. Beyond reducing grid constraints, SCM offers long-term operational and financial benefits. By shifting EV charging demand strategically, utilities can optimize asset utilization, delay infrastructure investments, and enhance grid performance. In terms of infrastructure upgrade deferrals, at the feeder level, LB consistently reduced peak charging loads and resulting infrastructure upgrade costs, particularly in high EV enrollment areas, decreasing the number of overloaded transformers by up to 35%, while TOU-based SCM achieved 20-30% reductions depending on feeder characteristics. At the system level, LB has the potential to defer total upgrade costs by $\$$186 million for BGE, compared to $\$$159 million under TOU-based SCM. For Pepco, TOU-based SCM performed slightly better, deferring upgrade costs by $\$$30 million, compared to $\$$29 million under LB. Section 4.5 reviews some of the system differences between BGE and Pepco. However, as EV adoption scales, TOU-based SCM will introduce secondary peak charging loads, reinforcing the need for more advanced, adaptive SCM approaches to prevent new grid challenges. As EV adoption continues to grow, feeder-level managed charging strategies will be essential for mitigating grid stress, improving infrastructure efficiency, and maintaining energy affordability for consumers. This report provides critical insights for utilities, Public Utility Commissions (PUCs), and state agencies on the role of feeder-specific smart charging in infrastructure planning, policy development, and grid modernization. The findings underscore the importance of tailored, data-driven SCM solutions that align with local grid conditions, ensuring a resilient, cost-effective transition to increasing EV adoption while safeguarding distribution system performance.
24 POWER TRANSMISSION AND DISTRIBUTION↗
The Impact of Void-finding Algorithms on Galaxy Classification
We explore how the definition of a void influences the conclusions drawn about the impact of the void environment on galactic properties using two void-finding algorithms in the Void Analysis Software Toolkit: Voronoi Voids (V 2 ), a Python implementation of ZOnes Bordering On Voidness (ZOBOV); and VoidFinder, an algorithm that grows and merges spherical void regions. Using the Sloan Digital Sky Survey Data Release 7, we find that galaxies found in VoidFinder voids tend to be bluer and fainter and to have higher (specific) star formation rates than galaxies in denser regions. Conversely, galaxies found in V 2 voids show less significant differences when compared to galaxies in denser regions, less consistent with the large-scale environmental effects on galaxy properties expected from both simulations and previous observations. These results align with previous simulation results that show V 2 -identified voids “leak” into the dense walls between voids because their boundaries extend up to the density maxima in the walls. As a result, when using ZOBOV-based void-finders, galaxies likely to be part of wall regions are instead classified as void galaxies, a misclassification that can be critical to our understanding of galaxy evolution.
cosmic web↗
On Finding Black Holes in Photometric Microlensing Surveys
There are expected to be millions of isolated black holes in the galaxy resulting from the deaths of massive stars. Measuring the abundance and properties of this remnant population would shed light on the end stages of stellar evolution and the evolution paths of black hole systems. Detecting isolated black holes is currently only possible via gravitational microlensing, which has so far yielded one definitive detection. The difficulty in finding microlensing black holes lies in having to choose a small subset of events, based on characteristics of their light curves, to allocate expensive and scarce follow-up resources to confirm the identity of the lens. Current methods either rely on simple cuts in parameter space without using the full distribution information or are only effective on small subsets of events. In this paper, we present a new lens classification method. The classifier takes in posterior constraints on light-curve parameters and combines them with a Galactic simulation to estimate the lens class probability. This method is flexible and can be used with any set of microlensing light-curve parameters, making it applicable to large samples of events. We make this classification framework available via the popclass Python package. We apply the classifier to ~10,000 microlensing events from the Optical Gravitational Lensing Experiment survey and find 23 high-probability black hole candidates. Our classifier also suggests that the only known isolated black hole is an observational outlier, according to current Galactic models, and the allocation of astrometric follow-up on this event was a high-risk strategy.
79 ASTRONOMY AND ASTROPHYSICS↗
Finding a contaminant source in a volume of flowing fluid
A method includes: mapping a boundary of a volume of flowing fluid; partitioning the volume by a computational mesh; finding a contaminant location at a first sensor that is disposed within the volume; obtaining a measured velocity of the flowing fluid within the volume; generating a reversed velocity vector field within the mesh, in response to the measured velocity; time stepping the contaminant location from the first sensor along the reversed velocity vector field until the contaminant location intersects the boundary of the volume; and finding a contaminant source at the intersection of the time stepped contaminant location with the boundary of the volume.
Lopez-Marrero, Vanessa↗