Search NASA⌕ Search

SEARCH · Search NASA

Results for “arraying algorithms”

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 145 records · Page 8

Striving to translate shale physics across ten orders of magnitude: What have we learned?

Shales will play an important role in the successful transition of energy from fossil-based resources to renewables in the coming decades. Aside from being a significant source of low-carbon intensity fuels, like natural gas, they also serve as geologic seals of subsurface formations that may be used to isolate nuclear waste, sequester CO 2 , or store intermittent energy (e.g., solar hydrogen). Despite their importance, shales pose significant engineering and environmental challenges due to their nanoporous structure and extreme heterogeneity that spans at least ~10 orders of magnitude in spatial scale. Two challenges inhibit a system-level understanding: (1) the physics of fluid flow and phase behavior in shales are poorly understood due to the dominant molecular interactions between minerals and fluids under confinement, and (2) the apparent lack of scale separation that prevents a reliable (closed) description of the physics at any single scale of observation. In this review, we focus on the latter issue and discuss scale translation, which in its broadest sense is transforming data or simulations from one spatiotemporal scale to another. While effective scale translation is not exclusive to shales, but all geologic porous media, the need for it is especially acute in shales given their high degree of heterogeneity. Classical theories like homogenization, while indispensable, fail when scales are not separated. Other methods, like numerical upscaling, scale-translate in only one direction: small to large, but not the reverse, called downscaling. However, the confluence of advances in three areas are bringing challenging problems such as shales within reach: increased computational power and scalable algorithms; high-resolution imaging and multi-modal data acquisition; and machine learning to process massive amounts of data. While these advances equip geoscientists with a wide array of experimental and computational tools, no individual tool can probe the entire gamut of heterogeneity in shales. Their effective use, therefore, requires an ability to bridge between various data types obtained at different scales. The aim of this review is to present a coherent account of computational and experimental methods that may be used to achieve just that, i.e., to perform scale translation. We provide a broader definition of scale translation, one that transcends classical homogenization and upscaling methods, but is consistent with them and accommodates notions like downscaling and data translation. After a brief introduction to homogenization, we review hybrid methods, numerical upscaling and its recent extensions, multiscale computing, high-resolution imaging, and machine learning. We place particular emphasis on multiscale computing and propose an algorithmic framework to bridge between the pore (micro) and Darcy (macro) scales. Throughout the paper, we draw comparisons between the various methods and highlight their (often hidden) similarities, differences, benefits, and pitfalls. We finally conclude with two case studies on shales that exemplify some of the methods presented.

58 GEOSCIENCES↗

Complex Density Wave Orders and Quantum Phase Transitions in a Model of Square-Lattice Rydberg Atom Arrays

In this work, we describe the zero-temperature phase diagram of a model of a two-dimensional square-lattice array of neutral atoms, excited into Rydberg states and interacting via strong van der Waals interactions. Using the density-matrix renormalization group algorithm, we map out the phase diagram and obtain a rich variety of phases featuring complex density wave orderings, upon varying lattice spacing and laser detuning. While some of these phases result from the classical optimization of the van der Waals energy, we also find intrinsically quantum-ordered phases stabilized by quantum fluctuations. These phases are surrounded by novel quantum phase transitions, which we analyze by finite-size scaling numerics and Landau theories. Our work highlights Rydberg quantum simulators in higher dimensions as promising platforms to realize exotic many-body phenomena.

74 ATOMIC AND MOLECULAR PHYSICS↗

Sensing Service Transformer Secondary Currents using Planar Magnetic Pick-up Coils

The rapid deployment of distributed energy resources (DERs) is creating stresses on utility assets in the distribution networks. The service transformer, which is the most commonly used utility asset is often not monitored, since the cost of available sensing solutions is as high as the transformer itself. This paper presents a method to use an array of printed circuit board coils to intelligently monitor North American pole top service transformers. The approach, uses a novel, self-calibrating algorithm to infer the fixed geometry of the installation, by recording data over an extended period of time. The proposed method can enable rapid installation of a non-intrusive sensor that can be used to monitor loading levels of the distribution transformer. Furthermore, these sensors can help in planning, prognostics and advanced situational awareness for utilities.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Application of automated iterative target detection for standoff hyperspectral imaging

The utility of hyperspectral imaging (HSI) has been well established for a wide array of applications but has generated a need for automated screening of high volumes of large HSI cubes. We report two important automated algorithms for more efficient standoff processing: atmospheric correction and target detection. The atmospheric correction method is based on a fast asymmetric least squares approach that is applied on a pixel-by-pixel basis. Here, the correction can be applied to entire images without manually identifying regions of interest and utilizes only in-scene information, no ancillary modeling of the atmosphere is required. An iterative target detection approach is also introduced which demonstrates faster speeds relative to moving window approaches. The target detection algorithm classifies each pixel as true target detections, near target detections, clutter, and no-calls. The algorithms were tested on forty images of twenty-two solid mineral targets placed at a 14-meter standoff distance allowing general observations on expected detection performance for a variety of minerals. In addition to identifying anomalous pixels, the inclusion of “no-calls” reduced the number of false detections significantly.

47 OTHER INSTRUMENTATION↗

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗

Deep learning for morphological identification of extended radio galaxies using weak labels

Abstract The present work discusses the use of a weakly-supervised deep learning algorithm that reduces the cost of labelling pixel-level masks for complex radio galaxies with multiple components. The algorithm is trained on weak class-level labels of radio galaxies to get class activation maps (CAMs). The CAMs are further refined using an inter-pixel relations network (IRNet) to get instance segmentation masks over radio galaxies and the positions of their infrared hosts. We use data from the Australian Square Kilometre Array Pathfinder (ASKAP) telescope, specifically the Evolutionary Map of the Universe (EMU) Pilot Survey, which covered a sky area of 270 square degrees with an RMS sensitivity of 25–35 $\mu$ Jy beam $^{-1}$ . We demonstrate that weakly-supervised deep learning algorithms can achieve high accuracy in predicting pixel-level information, including masks for the extended radio emission encapsulating all galaxy components and the positions of the infrared host galaxies. We evaluate the performance of our method using mean Average Precision (mAP) across multiple classes at a standard intersection over union (IoU) threshold of 0.5. We show that the model achieves a mAP $_{50}$ of 67.5% and 76.8% for radio masks and infrared host positions, respectively. The network architecture can be found at the following link: https://github.com/Nikhel1/Gal-CAM

Astronomy & Astrophysics↗

Memristive linear algebra

The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. In particular, we demonstrate that the electrical properties of memristive crossbars uniquely suit them for the evolution of a family of matrix exponentials, which can be exploited for the efficient computation of matrix inverses and online solutions for linear problems. Our results demonstrate that memristive arrays can reduce computational complexity. We also study power consumption and show a tradeoff between precision and energy. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graphically Contracted Function Construction with the Recursive Pairwise Merge Algorithm

A new implementation of a recursive pairwise merge algorithm to construct a GCF from a list of CSF expansion coefficients is presented. The essential new feature is the preallocation of some work arrays used within the intermediate steps of the merge procedure. This results in roughly an order of magnitude improvement in overall efficiency and also approximately eliminates a factor of n, the molecular orbital dimension, from the original implementation. Initial application of this merge procedure to a series of H m molecules shows that the GCF wave functions can be represented well both with delocalized canonical Hartree-Fock orbitals and with localized molecular orbitals. Finally, for a given wave function complexity, as measured by the average facet count, $\bar{\text {f}}$, the delocalized Hartree-Fock orbitals show smaller errors for small $\bar{\text {f}}$ values, while the localized orbitals show smaller errors for larger $\bar{\text {f}}$ values.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Recognizing Blazars Using Radio Morphology from the VLA Sky Survey

Abstract Blazars are radio-loud active galactic nuclei whose jets have a very small angle to our line of sight. Observationally, the radio emissions are mostly compact or compact-core with a one-sided jet. With 2.″5 resolution at 3 GHz, the Very Large Array Sky Survey (VLASS) enables us to resolve the structure of some blazar candidates in the sky north of decl. −40°. We introduce an algorithm to classify radio sources as either blazar-like or non-blazar-like based on their morphology in the VLASS images. We apply our algorithm to three existing catalogs, including one of the known blazars (Roma-BzCAT) and two blazar candidates identified by Wide-field Infrared Survey Explorer colors and radio emission (WIBRaLS, KDEBLLACS). We show that in all three catalogs, there are objects with morphologies inconsistent with being blazars. Considering all the catalogs, more than 12% of the candidates are unlikely to be blazars, based on this analysis. Notably, we show that 3% of the Roma-BzCATconfirmedblazars could be a misclassification based on their VLASS morphology. The resulting table with all sources and their radio morphological classification is available online.

Astronomy & Astrophysics↗

An introduction to financial option pricing on a qudit-based quantum computer

The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

Bornman, Nicholas↗

PyDA: A Hands-On Introduction to Dynamical Data Assimilation with Python

Dynamic data assimilation offers a suite of algorithms that merge measurement data with numerical simulations to predict accurate state trajectories. Meteorological centers rely heavily on data assimilation to achieve trustworthy weather forecast. With the advance in measurement systems, as well as the reduction in sensor prices, data assimilation (DA) techniques are applicable to various fields, other than meteorology. However, beginners usually face hardships digesting the core ideas from the available sophisticated resources requiring a steep learning curve. In this tutorial, we lay out the mathematical principles behind DA with easy-to-follow Python module implementations so that this group of newcomers can quickly feel the essence of DA algorithms. We explore a series of common variational, and sequential techniques, and highlight major differences and potential extensions. We demonstrate the presented approaches using an array of fluid flow applications with varying levels of complexity.

97 MATHEMATICS AND COMPUTING↗

A Search for Pulsars around Sgr A* in the First Event Horizon Telescope Data Set

In 2017 the Event Horizon Telescope (EHT) observed the supermassive black hole at the center of the Milky Way, Sagittarius A* (Sgr A*), at a frequency of 228.1 GHz (λ = 1.3 mm). The fundamental physics tests that even a single pulsar orbiting Sgr A* would enable motivate searching for pulsars in EHT data sets. The high observing frequency means that pulsars—which typically exhibit steep emission spectra—are expected to be very faint. However, it also negates pulse scattering, an effect that could hinder pulsar detections in the Galactic center. Additionally, magnetars or a secondary inverse Compton emission could be stronger at millimeter wavelengths than at lower frequencies. We present a search for pulsars close to Sgr A* using the data from the three most sensitive stations in the EHT 2017 campaign: the Atacama Large Millimeter/submillimeter Array, the Large Millimeter Telescope, and the IRAM 30 m Telescope. We apply three detection methods based on Fourier-domain analysis, the fast folding algorithm, and single-pulse searches targeting both pulsars and burst-like transient emission. We use the simultaneity of the observations to confirm potential candidates. No new pulsars or significant bursts were found. Being the first pulsar search ever carried out at such high radio frequencies, we detail our analysis methods and give a detailed estimation of the sensitivity of the search. We conclude that the EHT 2017 observations are only sensitive to a small fraction (≲2.2%) of the pulsars that may exist close to Sgr A*, motivating further searches for fainter pulsars in the region.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies

Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025

Bombieri, Lisa (ORCID:0009000950422897)↗

Muon track reconstruction in a segmented bolometric array using multi-objective optimization

Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless double-beta decay or direct dark matter detection, such experiments also have the capability to search for exotic particles that leave track-like signatures across their volume. However, the segmented nature of such detector arrays often sets the spatial resolution and makes the problem of reconstructing track-like paths non-trivial. Here, in this paper, we present an algorithm that improves reconstruction of track-like events in segmented detectors using multi-objective optimization — a computational technique that optimizes more than one cost function at a time without specifying a quantitative weighting between them. Such a technique allows the reconstruction of tracks through a detector and the determination of path-lengths through individual elements. When combined with the reconstructed energy depositions in each element this allows for a calculation of the stopping power of track-like particles and opens the door to searches for particles with abnormal stopping power like monopoles or lightly-ionizing particles (LIPs). Results are presented which evaluate the precision of the reconstruction tools as they currently stand against Monte Carlo generated data. The algorithm is presented in the context of the CUORE experiment, but has applications to other segmented calorimeter detectors.

47 OTHER INSTRUMENTATION↗

Genetic algorithm optimization of tin–copper graded shielding for improved plutonium safeguards measurements

Plutonium nuclear material safeguards is essential to ensure that states do not divert plutonium to clandestine nuclear weapons programs. Traditional safeguards methods rely on correlated neutron measurements. Detection systems based on organic scintillators, which are sensitive to fast neutrons and photons, are gaining support for use in safeguards applications due to increased capabilities and shorter measurement times compared to the current state-of-the-art. A drawback of organic scintillators in plutonium measurements is data throughput limitations; 241 Am builds up in plutonium samples and emits 60-keV gamma rays with a high specific activity. In this work, a genetic algorithm is used to design graded shielding made of tin and copper to attenuate the 60-keV gamma rays. The shield is designed to limit the attenuation of the higher-energy, fission photons, because fission photons can be used as a signature. The genetic algorithm optimization takes days to run, while a complete search space exploration would take years. The genetic algorithm was run for different levels of 60-keV gamma-ray attenuation, and the thickness of the required shielding layers was determined at each level. Tin–copper shielding was placed in front of an array of organic scintillation detectors for a measurement of approximately 4.5 kg of alpha-phase, weapons-grade plutonium, an AmLi source, and a 252 Cf source. We show that the shield successfully attenuated low-energy, non-fission gamma rays, which significantly improved the organic scintillator performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An Analysis of Published DAS Studies for Application to SPE Phase III

Distributed Acoustic Sensing (DAS) is an emerging technology capable of recording the acoustic wavefield at unprecedented spatial resolution. However, this new tool requires significant refinements before it becomes operational for explosion monitoring objectives. Recent studies have shown significant development of array processing with DAS data. In this report we explore three such array processing methods including DAS strain-rate data versus geophone measured ground motion, beamforming for event parameters, and machine learning based denoising. Prior to applying these algorithms to the Source Physics Experiment Phase II and Phase III data, we validate these methods through replication analysis.

47 OTHER INSTRUMENTATION↗

Detection and Association of Operational Events using DAS and Seismometers (FY 2025 Mid-Year Report)

This mid-year report summarizes ongoing work to identify anomalous vibration signals indicative of potential containment breaches. This work includes compiling continuous seismic datasets and testing and refining underground detection and geolocation techniques. In the first two quarters of FY25, we have completed two project work plan tasks: (1) creating a database of continuous waveforms and ground truth event data from multiple modalities and (2) refining and implementing a detection and association algorithm to create a catalog of anomalous underground activities. This report contains a summary of the seismic database including the continuous seismic data collected by a dense array of surface seismic stations above Pleasant Gap Mine, and continuous seismic data collected using subsurface distributed acoustic sensing (DAS) in the subsurface at Sanford Underground Research Facility (SURF) and the ground truth information gathered from both sites. This report also includes results from refining and applying a dynamic power spectral density detector to both continuous seismic datasets. Finally, the report provides an initial catalog of subsurface operational events from both sensing modalities.

58 GEOSCIENCES↗

Distilling particle knowledge for fast reconstruction at high-energy physics experiments

Knowledge distillation is a form of model compression that allows artificial neural networks of different sizes to learn from one another. Its main application is the compactification of large deep neural networks to free up computational resources, in particular on edge devices. In this article, we consider proton-proton collisions at the High-Luminosity Large Hadron Collider (HL-LHC) and demonstrate a successful knowledge transfer from an event-level graph neural network (GNN) to a particle-level small deep neural network (DNN). Our algorithm, DistillNet, is a DNN that is trained to learn about the provenance of particles, as provided by the soft labels that are the GNN outputs, to predict whether or not a particle originates from the primary interaction vertex. The results indicate that for this problem, which is one of the main challenges at the HL-LHC, there is minimal loss during the transfer of knowledge to the small student network, while improving significantly the computational resource needs compared to the teacher. This is demonstrated for the distilled student network on a CPU, as well as for a quantized and pruned student network deployed on a field programmable gate array. Our study proves that knowledge transfer between networks of different complexity can be used for fast artificial intelligence (AI) in high-energy physics that improves the expressiveness of observables over non-AI-based reconstruction algorithms. Such an approach can become essential at the HL-LHC experiments, e.g. to comply with the resource budget of their trigger stages.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗