Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed 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.

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

At least 1,747 records · Page 97

Coarse-Grained Density Functional Theory Predictions via Deep Kernel Learning

Scalable electronic predictions are critical for soft materials design. Recently, the Electronic Coarse-Graining (ECG) method was introduced to renormalize all-atom quantum chemical (QC) predictions to coarse-grained (CG) resolutions using deep neural networks (DNNs). While DNNs can learn complex representations that prove challenging for kernel-based methods, they are susceptible to overfitting and the overconfidence of uncertainty estimations. Here, we develop ECG within a GPU-accelerated Deep Kernel Learning (DKL) framework to enable CG QC predictions using range-separated hybrid density functional theory (DFT), obtaining a 107 speedup relative to naive all-atom QC. By treating the predicted electronic properties as random Gaussian Processes, DKL incorporates CG mapping degeneracy by learning the distribution of electronic energies as a function of CG configuration. DKL-ECG accurately reproduces molecular orbital energies from range-separated DFT while facilitating efficient training via active learning using the uncertainties provided by DKL. Further, we show that while active learning algorithms enable efficient sampling of a more diverse configurational space relative to random sampling, all explored query methods exhibit comparable performance for the examined system. We attribute this result to the significant overlap of the feature space and output property distributions across multiple temperatures.

97 MATHEMATICS AND COMPUTING↗

Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions

Abstract The potential advantage of machine learning in quantum computers is a topic of intense discussion in the literature. Theoretical, numerical, and experimental explorations will most likely be required to understand its power. There have been different algorithms proposed to exploit the probabilistic nature of variational quantum circuits for generative modeling. In this paper, a hybrid architecture for quantum generative adversarial networks (QGANs) is employed and their robustness in the presence of noise is studied. A simple way of adding different types of noise to the quantum generator circuit is devised, and the noisy hybrid QGANs (HQGANs) are simulated numerically to learn continuous probability distributions, and to show that the performance of HQGANs remains unaffected. The effect of different parameters on the training time is also investigated to reduce the computational scaling of the algorithm and simplify its deployment on a quantum computer. The training on Rigetti's Aspen‐4‐2Q‐A quantum processing unit is then performed, and the results from the training are presented. The authors' results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate‐scale quantum devices.

Anand, Abhinav↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

pnnl/oedisi_dopf

OpenEDI - System Integration (OEDI-SI) - PNNL Distributed Optimal Power Flow (DOPF)

Slay, Tylor↗

Implementation of a fully-balanced periodic tridiagonal solver on a parallel distributed memory architecture

While parallel computers offer significant computational performance, it is generally necessary to evaluate several programming strategies. Two programming strategies for a fairly common problem - a periodic tridiagonal solver - are developed and evaluated. Simple model calculations as well as timing results are presented to evaluate the various strategies. The particular tridiagonal solver evaluated is used in many computational fluid dynamic simulation codes. The feature that makes this algorithm unique is that these simulation codes usually require simultaneous solutions for multiple right-hand-sides (RHS) of the system of equations. Each RHS solutions is independent and thus can be computed in parallel. Thus a Gaussian elimination type algorithm can be used in a parallel computation and the more complicated approaches such as cyclic reduction are not required. The two strategies are a transpose strategy and a distributed solver strategy. For the transpose strategy, the data is moved so that a subset of all the RHS problems is solved on each of the several processors. This usually requires significant data movement between processor memories across a network. The second strategy attempts to have the algorithm allow the data across processor boundaries in a chained manner. This usually requires significantly less data movement. An approach to accomplish this second strategy in a near-perfect load-balanced manner is developed. In addition, an algorithm will be shown to directly transform a sequential Gaussian elimination type algorithm into the parallel chained, load-balanced algorithm.

Eidson, T. M.↗

Learning to Unknot

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an algorithm to randomly generate N-crossing braids and their knot closures and discussing the induced prior on the distribution of knots, we apply binary classification to the UNKNOT decision problem. We find that the Reformer and shared-QK Transformer network architectures outperform fully-connected networks, though all perform at 95% accuracy. Perhaps surprisingly, we find that accuracy increases with the length of the braid word, and that the networks learn a direct correlation between the confidence of their predictions and the degree of the Jones polynomial. Finally, we utilize reinforcement learning (RL) to find sequences of Markov moves and braid relations that simplify knots and can identify unknots by explicitly giving the sequence of unknotting actions. Trust region policy optimization (TRPO) performs consistently well, reducing 80% of the unknots with up to 96 crossings we tested to the empty braid word, and thoroughly outperformed other RL algorithms and random walkers. Studying these actions, we find that braid relations are more useful in simplifying to the unknot than one of the Markov moves.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sea Surface Salinity Distribution in the Southern Ocean as Observed from Space

Large-scale spatial and temporal variabilities of sea surface salinity (SSS) in the Southern Ocean from 2011 to 2017 were studied using products derived from microwave sensors on board Aquarius, Soil Moisture and Ocean Salinity (SMOS), and Soil Moisture Active and Passive (SMAP) satellites. Four products, three from Aquarius and one from SMOS, were evaluated and shown to be generally consistent within 0.3 to 0.6 psu and agree favorably with in situ measurements. However, although the Aquarius products show consistent seasonality of SSS with high values of 34.45 psu in October and low values of 33.40 psu in May, theSMOS and SMAP products lack such seasonal variations. This may be caused by larger uncertainties in the SMOS and SMAP data due in part to the lack of concurrent scatterometer measurements that is used to correct for roughness effects. The four products provide similar spatial distributions of SSS with root mean square difference from 0.25 to 0.58 psu. Differences among Aquarius products are mainly due to varying salinity retrieval algorithms, smoothing, and masking of sea ice, while the SMOS product showed the highest SSS deviation that is likely due to the bias adjustment done on the data set. Our analyses show that SSS in the Southern Ocean region has significant meridional variations with the lowest SSS near the ice edge and highest at lower latitudes. The SSS is also lowest in summer indicating the predominant influence of sea ice and glacial melt, but it stays low near ice edges even during the growth season. Salinity together with temperature is the key parameters that control the state and circulation of the World's oceans. The large‐scale distribution of the sea surface salinity of the Southern Ocean is quantified for the first time using Aquarius, Soil Moisture and Ocean Salinity, and Soil Moisture Active and Passive satellite microwave data. Seasonal and interannual changes in the distribution as affected by the sea ice cover, surface temperature, and precipitation are evaluated. Comparative studies were done, using four different products that are publicly available, in conjunction with in situ observations to gain insights into the true nature of the distribution and how consistently the sea surface salinity is depicted by the different products. There are general consistencies in the products, and discrepancies are attributed to different algorithms, smoothing techniques, and sea ice masking. Aquarius data are shown to have higher accuracy than Soil Moisture and Ocean Salinity and Soil Moisture Active and Passive products in part because of having concurrent scatterometer that provides accurate correction to roughness effects.

Garcia-Eidell, Cynthia↗

Electrical substation grid testbed for DLT applications of electrical fault detection, power quality monitoring, DERs use cases and cyber-events

Electrical utilities continue to deploy more intelligent electronic devices (IEDs) inside and outside electrical substation, and are associated with customer-owned distributed energy resources (DERs). The integrity and confidentiality of data from these IEDs, like power meters and protective relays, is crucial. Blockchain technology could improve the resilience of microgrids by improving the security of data sharing. The penetration of customer-owned DERs (renewable energy sources) and the increasing deployment of IEDs can lead to integrate power system applications with Distributed Ledger Technology (DLT). In this study, we implemented the electrical faulted phase detection and power quality monitoring algorithms with a Cyber Grid Guard (CGG) system using DLT. In addition, the DERs (wind turbine farms) use case and protective relay cyber-event tests were assessed, by using the CGG system with DLT. In the experimental model, the testbed was created by using a real-time simulator and CGG system with power meters/ protective relays in-the-loop. The data collected from the CGG system and IEDs were compared with the same time stamp source. These results had shown the successful assessment of protection, control and monitoring applications using a CGG system with DLT. In the future, the ESGT with DERs and the CGG system will be used in other power system applications, based on implementing smart contracts between electrical utilities with customer-owned DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

AlgoSCR: an algorithm for solar contamination removal from radio interferometric data

Hydrogen intensity mapping is a new field in astronomy that promises to make three-dimensional maps of the matter distribution of the Universe using the redshifted 21cm line of neutral hydrogen gas (HI). Several ongoing and upcoming radio interferometers, such as Tianlai, CHIME, HERA, HIRAX, etc., are using this technique. These instruments are designed to map large swaths of the sky by drift scanning over periods of many months. One of the challenges of the observations is that the daytime data are contaminated by strong radio signals from the Sun. In the case of Tianlai, this results in almost half of the measured data being unusable. We try to address this issue by developing an algorithm for solar contamination removal (AlgoSCR) from the radio data. The algorithm is based on an eigenvalue analysis of the visibility matrix and hence is applicable only to interferometers. We apply AlgoSCR to simulated visibilities, as well as real daytime data from the Tianlai dish array. The algorithm can reduce strong solar contamination by about 95 per cent without seriously affecting other weaker sky signals and thus makes the data usable for certain applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Vertical, meridional, seasonal, and local time dependence of non-LTE effects in stratospheric NO and implications for infrared remote sensing

Calculations have been carried out on possible nonlocal thermodynamic equilibrium (non-LTE) effects previously suggested for stratospheric nitric oxide (NO) associated with the direct photochemical production of vibrationally excited NO by the processes NO2 + hv yields NO(v) + O and O + NO2 yields NO(v) + O2. The calculations, which make use of improved calculations of the NO vibrational state distribution from NO2 photolysis, are carried out as a function of altitude and latitude for a variety of seasons and local times. Non-LTE effects on the order of 30 percent for v = 1 are obtained, maximizing in the middle stratosphere over the equator. The results of the calculations suggest that incorporation of the non-LTE effect into the retrieval algorithm for NO from infrared thermal emission measuring instruments on the Upper Atmosphere Research Satellite will need to be done carefully if correct distributions and variations of NO with altitude, latitude, season, and local time are to be obtained.

Kaye, Jack A.↗

Heterogeneous Multi-Domain Dataset Synthesis to Facilitate Privacy and Risk Assessments in Smart City IoT

The emergence of the Smart Cities paradigm and the rapid expansion and integration of Internet of Things (IoT) technologies within this context have created unprecedented opportunities for high-resolution behavioral analytics, urban optimization, and context-aware services. However, this same proliferation intensifies privacy risks, particularly those arising from cross-modal data linkage across heterogeneous sensing platforms. To address these challenges, this paper introduces a comprehensive, statistically grounded framework for generating synthetic, multimodal IoT datasets tailored to Smart City research. The framework produces behaviorally plausible synthetic data suitable for preliminary privacy risk assessment and as a benchmark for future re-identification studies, as well as for evaluating algorithms in mobility modeling, urban informatics, and privacy-enhancing technologies. As part of our approach, we formalize probabilistic methods for synthesizing three heterogeneous and operationally relevant data streams—cellular mobility traces, payment terminal transaction logs, and Smart Retail nutrition records—capturing the behaviors of a large number of synthetically generated urban residents over a 12-week period. The framework integrates spatially explicit merchant selection using K-Dimensional (KD)-tree nearest-neighbor algorithms, temporally correlated anchor-based mobility simulation reflective of daily urban rhythms, and dietary-constraint filtering to preserve ecological validity in consumption patterns. In total, the system generates approximately 116 million mobility pings, 5.4 million transactions, and 1.9 million itemized purchases, yielding a reproducible benchmark for evaluating multimodal analytics, privacy-preserving computation, and secure IoT data-sharing protocols. To show the validity of this dataset, the underlying distributions of these residents were successfully validated against reported distributions in published research. We present preliminary uniqueness and cross-modal linkage indicators; comprehensive re-identification benchmarking against specific attack algorithms is planned as future work. This framework can be easily adapted to various scenarios of interest in Smart Cities and other IoT applications. By aligning methodological rigor with the operational needs of Smart City ecosystems, this work fills critical gaps in synthetic data generation for privacy-sensitive domains, including intelligent transportation systems, urban health informatics, and next-generation digital commerce infrastructures.

IoT↗

Feedback shift register sequences versus uniformly distributed random sequences for correlation chromatography

Two alternative input sequences are commonly employed in correlation chromatography (CC). They are sequences derived according to the algorithm of the feedback shift register (i.e., pseudo random binary sequences (PRBS)) and sequences derived by using the uniform random binary sequences (URBS). These two sequences are compared. By applying the "cleaning" data processing technique to the correlograms that result from these sequences, we show that when the PRBS is used the S/N of the correlogram is much higher than the one resulting from using URBS.

NASA Discipline Exobiology↗

Point-spread Function Deconvolution of the IFU Data and Restoration of Galaxy Stellar Kinematics

We present a performance test of the point-spread function (PSF) deconvolution algorithm applied to astronomical integral field unit (IFU) spectroscopy data for restoration of galaxy kinematics. We deconvolve the IFU data by applying the Lucy–Richardson algorithm to the 2D image slice at each wavelength. We demonstrate that the algorithm can effectively recover the true stellar kinematics of the galaxy, by using mock IFU data with a diverse combination of surface brightness profile, signal-to-noise ratio, line-of-sight geometry, and line-of-sight velocity distribution (LOSVD). In addition, we show that the proxy of the spin parameter ${\lambda }_{{R}_{e}}$ can be accurately measured from the deconvolved IFU data. We apply the deconvolution algorithm to the actual SDSS-IV MaNGA IFU survey data. The 2D LOSVD, geometry, and ${\lambda }_{{R}_{e}}$ measured from the deconvolved MaNGA IFU data exhibit noticeable differences compared to the ones measured from the original IFU data. The method can be applied to any other regular-grid IFU data to extract the PSF-deconvolved spatial information.

79 ASTRONOMY AND ASTROPHYSICS↗

Multiobjective optimization of nuclear microreactor reactivity control system operation with swarm and evolutionary algorithms

To improve the marketability of novel microreactor designs, there is a need for automated and optimal control of these reactors. This paper presents a methodology for performing multiobjective optimization of control drum operation for a microreactor under normal and off-nominal conditions. Here, two different case studies are used where the control drum configuration is optimized for the reactor to be critical with some desired power distribution that would satisfy peaking limits. A surrogate model for power distribution is developed based on a feedforward neural network. The process for determining weights for scalarization of the multiobjective optimization problem is also detailed. Six optimization algorithms: evolutionary strategies, differential evolution, grey wolf optimization, Harris hawks optimization, moth flame optimization and particle swarm optimization, are all applied to these cases and the results analyzed. Although all these algorithms will demonstrate optima-seeking behavior, for real-time control it is necessary to identify the best algorithm to efficiently provide reasonable optima without operator interference. The moth flame optimization algorithm was found to perform particularly well on both cases. Overall, it was found that the algorithms capable of supplying the best optima were also the most consistent. Finally, the found optima were verified with the original model used to train surrogates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of an Improved Spatial Metadata Simplification Algorithm

The National Aeronautics and Space Administration's (NASA) Atmospheric Science Data Center (ASDC) at NASA Langley Research Center in Hampton, VA provides atmospheric science data products and services to the science community, including enhanced search and subsetting capabilities for numerous Earth Science datasets. The ASDC is the official Distributed Active Archive Center (DAAC) of record for the Tropospheric Emissions: Monitoring of Pollution (TEMPO) instrument. TEMPO is situated on a geostationary satellite positioned at a longitude near the center of the conterminous United States and focused on North America, making hourly swaths of its field of regard from east to west. Spatial metadata is an essential component for the discovery and distribution of Earth Science data. The simplified polygonal boundaries representing the archived data files ensure that any granule can be identified quickly and accurately by a geospatial query. Historically the Douglas-Peucker algorithm has been used for polygon simplification; however, due to the nature of the algorithm, a buffer must be added to the polygon before simplification to ensure pivotal points are not removed by the algorithm. This adds in additional error to the polygon simplification. ASDC’s goal is to test other methods of polyline simplification, such as Visvalingan-Whyatt and Opheim simplification alongside of Douglas-Peucker and different buffering methods, to produce less error during polygon simplification of TEMPO data swaths, and special spatial query geometries such as EPA non-attainment regions, and geopolitical boundaries.

Spatial Metadata↗

Massively Parallel Assimilation of TOGA/TAO and Topex/Poseidon Measurements into a Quasi Isopycnal Ocean General Circulation Model Using an Ensemble Kalman Filter

A massively parallel ensemble Kalman filter (EnKF)is used to assimilate temperature data from the TOGA/TAO array and altimetry from TOPEX/POSEIDON into a Pacific basin version of the NASA Seasonal to Interannual Prediction Project (NSIPP)ls quasi-isopycnal ocean general circulation model. The EnKF is an approximate Kalman filter in which the error-covariance propagation step is modeled by the integration of multiple instances of a numerical model. An estimate of the true error covariances is then inferred from the distribution of the ensemble of model state vectors. This inplementation of the filter takes advantage of the inherent parallelism in the EnKF algorithm by running all the model instances concurrently. The Kalman filter update step also occurs in parallel by having each processor process the observations that occur in the region of physical space for which it is responsible. The massively parallel data assimilation system is validated by withholding some of the data and then quantifying the extent to which the withheld information can be inferred from the assimilation of the remaining data. The distributions of the forecast and analysis error covariances predicted by the ENKF are also examined.

Keppenne, Christian L.↗

Version 4 of the SMAP Level-4 Soil Moisture Algorithm and Data Product

The NASA Soil Moisture Active Passive (SMAP) mission Level-4 Soil Moisture (L4_SM) product provides global, 3-hourly, 9-km resolution estimates of surface (0-5 cm) and root-zone (0-100 cm) soil moisture with a mean latency of ~2.5 days. The underlying L4_SM algorithm assimilates SMAP radiometer brightness temperature (Tb) observations into the NASA Catchment land surface model using a spatially-distributed ensemble Kalman filter. Version 4 of the L4_SM modeling system includes a reduction in the upward recharge of surface soil moisture from below under non-equilibrium conditions, resulting in reduced bias and improved dynamic range of L4_SM surface soil moisture compared to earlier versions. This change and additional technical modifications to the system reduce the mean and standard deviation of the observation-minus-forecast Tb residuals and overall soil moisture analysis increments while maintaining the skill of the L4_SM soil moisture estimates versus independent in situ measurements; the average, bias-adjusted RMSE in Version 4 is 0.039 m(exp 3) m(exp -3) for surface and 0.026 m(exp 3) m(exp -3) for root-zone soil moisture. Moreover, the coverage of assimilated SMAP observations in Version 4 is near-global owing to the use of additional satellite Tb records for algorithm calibration. L4_SM soil moisture uncertainty estimates are biased low (by 0.01-0.02 m(exp 3) m(exp -3)) against actual errors (computed versus in situ measurements). L4_SM runoff estimates, an additional product of the L4_SM algorithm, are biased low (by 35 mm year (exp -1)) against streamflow measurements. Compared to Version 3, bias in Version 4 is reduced by 46% for surface soil moisture uncertainty estimates and by 33% for runoff estimates.

RMSE↗

Optimal Estimation Inversion of Ionospheric Electron Density from GNSS-POD Limb Measurements: Part I-Algorithm and Morphology

GNSS-LEO radio links from Precise Orbital Determination (POD) and Radio Occultation (RO) antennas have been used increasingly in characterizing the global 3D distribution and variability of ionospheric electron density (N e ). In this study, we developed an optimal estimation (OE) method to retrieve N e profiles from the slant total electron content (hTEC) measurements acquired by the GNSS-POD links at negative elevation angles (ε < 0°). Although both OE and onion-peeling (OP) methods use the Abel weighting function in the N e inversion, they are significantly different in terms of performance in the lower ionosphere. The new OE results can overcome the large N e oscillations, sometimes negative values, seen in the OP retrievals in the E-region ionosphere. In the companion paper in this Special Issue, the HmF2 and NmF2 from the OE retrieval are validated against ground-based ionosondes and radar observations, showing generally good agreements in NmF2 from all sites. Nighttime hmF2 measurements tend to agree better than the daytime when the ionosonde heights tend to be slightly lower. The OE algorithm has been applied to all GNSS-POD data acquired from the COSMIC-1 (2006–2019), COSMIC-2 (2019–present), and Spire (2019–present) constellations, showing a consistent ionospheric N e morphology. The unprecedented spatiotemporal sampling of the ionosphere from these constellations now allows a detailed analysis of the frequency–wavenumber spectra for the N e variability at different heights. In the lower ionosphere (~150 km), we found significant spectral power in DE1, DW6, DW4, SW5, and SE4 wave components, in addition to well-known DW1, SW2, and DE3 waves. In the upper ionosphere (~450 km), additional wave components are still present, including DE4, DW4, DW6, SE4, and SW4. The co-existence of eastward- and westward-propagating wave4 components implies the presence of a stationary wave4 (SPW4), as suggested by other earlier studies. Further improvements to the OE method are proposed, including a tomographic inversion technique that leverages the asymmetric sampling about the tangent point associated with GNSS-LEO links.

GNSS constellation↗