Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “physically distributed memory”

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 127 records · Page 7

Physics-Guided Deep Learning for Time-Series State Estimation Against False Data Injection Attacks

The modern power grid is a cyber-physical system. While the grid is becoming more intelligent with emerging sensing and communication techniques, new vulnerabilities are introduced and cyber security becomes a major concern. One type of cyber-attacks - False Data Injection Attacks (FDIAs) - exploits the limitations in traditional power system state estimation, and modifies system states without being detected. In this paper, we propose a physics-guided deep learning (PGDL) approach to defend against FDIAs. The PGDL takes real-time measurements as inputs to neural networks, outputs the estimated states, and reconstructs measurements considering power system physics. A deep recurrent neural network - Long Short-Term Memory (LSTM) - is employed to learn the temporal correlations among states. This hybrid learning model leads to a time-series state estimation method to defend against FDIAs. The simulation results using IEEE 14-bus test system demonstrate the accuracy and robustness of the proposed time-series state estimation under FDIAs.

Cyber security, state estimation, physics-guided d↗

Influence of high energy ball milling on structural parameters, cation distribution and magnetic enhancement of nanosized Co0.3Zn0.7Fe2O4

Highlights: • Magnetic enhancement in mechanically activated nanosized Co{sub 0.3}Zn{sub 0.7}Fe{sub 2}O{sub 4} ferites. • Influence of crystal structure, cation distribution and stress anisotropy on magnetic and hyperfine properties. • A simple method for estimation of cation distribution of ferrites has been proposed. • Probing core-shell type magnetic structure of ferrite nanoparticles by infield Mössbauer and dc magnetic measurement. • Memory effect in the dc magnetization. - Abstract: Herein, we report the role of mechanical activation in modifying the structural, microstructural, magnetic and hyperfine parameters of nanosized Co{sub 0.3}Zn{sub 0.7}Fe{sub 2}O{sub 4} having average particle size ∼16.6 nm synthesized via coprecipitation method followed by high energy ball milling with cation distribution (Zn{sup 2+}{sub 0.61}Fe{sup 3+}{sub 0.39}){sub A} [Co{sup 2+}{sub 0.3}Zn{sup 2+}{sub 0.09}Fe{sup 3+}{sub 1.61}]{sub B}O{sub 4}. The values of the blocking temperature and Curie temperature of the sample are 220 and 270 K, respectively. The values of saturation magnetization at 300 and 5 K are 59 and 88 emu g{sup −1}and those of the coercivity at 100 and 5 K are 400 and 5000 Oe, respectively. The values of the magnetic parameters of the sample are greater than those of its counterparts synthesized by chemical methods. A model for precise estimation of the cation distribution of ferrites has been proposed. Moreover, the memory effect obtained in the dc magnetization of the sample can be used for generating, storing and retrieving binary bit pattern.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient generation of sum-of-products representations of high-dimensional potential energy surfaces based on multimode expansions

The transformation of multi-dimensional potential energy surfaces (PESs) from a grid-based multimode representation to an analytical one is a standard procedure in quantum chemical programs. Within the framework of linear least squares fitting, a simple and highly efficient algorithm is presented, which relies on a direct product representation of the PES and a repeated use of Kronecker products. It shows the same scalings in computational cost and memory requirements as the POTFIT approach. In comparison to customary linear least squares fitting algorithms, this corresponds to a speed-up and memory saving by several orders of magnitude. Different fitting bases are tested, namely, polynomials, B-splines, and distributed Gaussians. Benchmark calculations are provided for the PESs of a set of small molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Microtraps for neutral atoms using superconducting structures in the critical state

Recently demonstrated superconducting atom chips provide a platform for trapping atoms and coupling them to solid-state quantum systems. Controlling these devices requires a full understanding of the supercurrent distribution in the trapping structures. For type-II superconductors, this distribution is hysteretic in the critical state due to the partial penetration of the magnetic field in the thin superconducting film through pinned vortices. We report here an experimental observation of this memory effect. Our results are in good agreement with the predictions of the Bean model of the critical state without adjustable parameters. The memory effect allows to write and store permanent currents in micron-sized superconducting structures and paves the way toward engineered trapping potentials.

74 ATOMIC AND MOLECULAR PHYSICS↗

Schwinger-Dyson equations in large-N quantum field theories and nonlinear random processes

We propose a stochastic method for solving Schwinger-Dyson equations in large-N quantum field theories. Expectation values of single-trace operators are sampled by stationary probability distributions of the so-called nonlinear random processes. The set of all the histories of such processes corresponds to the set of all planar diagrams in the perturbative expansions of the expectation values of singlet operators. We illustrate the method on examples of the matrix-valued scalar field theory and the Weingarten model of random planar surfaces on the lattice. For theories with compact field variables, such as sigma models or non-Abelian lattice gauge theories, the method does not converge in the physically most interesting weak-coupling limit. In this case one can absorb the divergences into a self-consistent redefinition of expansion parameters. A stochastic solution of the self-consistency conditions can be implemented as a 'memory' of the random process, so that some parameters of the process are estimated from its previous history. We illustrate this idea on the two-dimensional O(N) sigma model. The extension to non-Abelian lattice gauge theories is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Weather prediction using a genetic memory

Kanaerva's sparse distributed memory (SDM) is an associative memory model based on the mathematical properties of high dimensional binary address spaces. Holland's genetic algorithms are a search technique for high dimensional spaces inspired by evolutional processes of DNA. Genetic Memory is a hybrid of the above two systems, in which the memory uses a genetic algorithm to dynamically reconfigure its physical storage locations to reflect correlations between the stored addresses and data. This architecture is designed to maximize the ability of the system to scale-up to handle real world problems.

Rogers, David↗

A fast solver for the gyrokinetic field equation with adiabatic electrons

Describing turbulence and microinstabilities in fusion devices is often modelled with the gyrokinetic equation. During the time evolution of the distribution function a field equation for the electrostatic potential needs to be solved. In the case of adiabatic electrons it contains a flux-surface-average term resulting in an integro-differential equation. Its numerical solution is time and memory intensive for three-dimensional configurations. Here a new algorithm is presented which only requires the numerical inversion of a simpler differential operator and a subsequent addition of a correction term. This new procedure is as fast as solving the equation without the surface average.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Improved characteristics of amorphous indium-gallium-zinc-oxide-based resistive random access memory using hydrogen post-annealing

The authors report an improvement in resistive switching (RS) characteristics of amorphous indium-gallium-zinc-oxide (a-IGZO)-based resistive random access memory devices using hydrogen post-annealing. Because this a-IGZO thin film has oxygen off-stoichiometry in the form of deficient and excessive oxygen sites, the film properties can be improved by introducing hydrogen atoms through the annealing process. After hydrogen post-annealing, the device exhibited a stable bipolar RS, low-voltage set and reset operation, long retention (>10{sup 5 }s), good endurance (>10{sup 6} cycles), and a narrow distribution in each current state. The effect of hydrogen post-annealing is also investigated by analyzing the sample surface using X-ray photon spectroscopy and atomic force microscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Communication-Optimal Framework for Contracting Distributed Tensors

Tensor contractions are extremely compute intensive generalized matrix multiplication operations encountered in many computational science fields, such as quantum chemistry and nuclear physics. Unlike distributed matrix multiplication, which has been extensively studied, limited work has been done in understanding distributed tensor contractions. In this paper, we characterize distributed tensor contraction algorithms on torus networks. We develop a framework with three fundamental communication operators to generate communication-efficient contraction algorithms for arbitrary tensor contractions. We show that for a given amount of memory per processor, our framework is communication optimal for all tensor contractions. We demonstrate performance and scalability of our framework on up to 262,144 cores of BG/Q supercomputer using five tensor contraction examples.

communication efficiency↗

A Neural Network Parametrization of Volumetric Cloud Fraction Profiles Using Satellite Observations and MERRA-2 Reanalysis Meteorological Data

Clouds play a crucial role in regulating the hydrologic cycle and Earth's radiative energy budget, yet they are often poorly represented in global climate models (GCMs). This study applies deep machine learning techniques to develop a physical parameterization of volumetric cloud fraction (VCF), the fraction of a 3-D grid volume occupied by clouds using satellite lidar-radar measurements. The neural network (NN) captures the complicated relationships between observed VCF profiles and collocated meteorological variables from MERRA-2 reanalysis data. Our results show that the NN model, particularly a sequence-to-sequence long short-term memory (LSTM) network with a sixfactor loss function, effectively learns the underlying cloud physical processes. The NN model outperforms MERRA-2 reanalysis in representing low-level clouds in tropical and subtropical regions and low- and middle-level clouds over midlatitude storm-track regions, and also improves VCF histograms. These improvements are reflected in the vertical distributions of zonally, meridionally, and globally averaged VCFs, geographic distributions of low-, middle-, and high-level clouds, and seasonal variations in monthly-mean VCF. Furthermore, the NN predictions effectively capture the El Niño-Southern Oscillation (ENSO) effects and other interannual variations. The NN parameterization is further evaluated through a sensitivity analysis, in which a single predictor is perturbed at a time. This reveals that relative humidity (RH) is the dominant factor influencing variations in globally averaged VCF at low and middle altitudes, followed by temperature. At higher altitudes, temperature becomes the primary driver of VCF through its effect on RH. Changes in wind components had minimal impact on globally averaged VCF.

Shan Zeng↗

A Scalable Graph Analytics Framework for Programming with Big Data in R (pbdR)

Many disciplines such as biology, economics, engineering, physics, and the social sciences represent their data as graphs to capture patterns, trends, and associations. There are are many commercially available graph libraries in different programming languages to analyze these complex graphs. But there is no distributed graph library package in R - the popular statistical programming language to analyze graphs that bigger than a single machine's memory. Many domain experts prefer R over the numerous other alternatives. Towards this, we present a distributed graph analytics framework for R called programming with big graph using R (pBGR.) Our proposed framework leverages the Programming with Big Data in R (pbdR) ecosystem that provides scalable R packages for distributed computing in data science. We present an early prototype implementation of this framework using the distributed-memory parallel graph library CombBLAS and evaluate the framework's performance on leadership class computing platforms. Our experimental results demonstrate that the proposed framework is capable of performing large-scale parallel graph mining through the easyto-use R language. This enhanced graph processing capability coupled with other statistical tools already available in R, should be valuable to many domain experts.

Hasan, S M Shamimul↗

Knowledge-guided graph machine learning for spatially distributed prediction of daily discharge and nitrogen export dynamics

Spatially distributed prediction of streamflow and nitrogen export dynamics is essential for precision management of agricultural watersheds. While temporal deep learning models such as Long Short-Term Memory (LSTM) have shown strong performance at basin scales, their ability to generalize spatially is limited by insufficient representation of spatial dependencies and flow paths, particularly under data-scarce conditions. To address this gap, we propose HydroGraphNet, a knowledge-guided graph machine learning framework that integrates process-based knowledge and explicit spatial learning into temporal modeling. This framework incorporates directed graph topology to encode watershed connectivity and upstream inflows, with mass balance constraints to improve physical consistency. To enhance generalization in sparsely monitored regions, HydroGraphNet is pretrained on synthetic data generated by the SWAT+ (Soil and Water Assessment Tool Plus) model. We evaluated HydroGraphNet in the Upper Sangamon River Basin (44 HUC-12 subwatersheds, 2001–2020) against two LSTM baselines: a lumped basin-level model and a distributed variant. When benchmarked on SWAT+ simulations in pretraining, HydroGraphNet improved test NSEs by 8.9% (discharge) and 13.7% (NO₃–N load) in temporal extrapolation, and by 27.1% and 34.7% in spatial extrapolation, relative to the Lumped LSTM baseline. After fine-tuning with USGS monitoring data, the model achieved mean test NSE (KGE) scores of 0.768 (0.861) for discharge and 0.626 (0.664) for NO₃–N load, substantially outperforming baselines. Attribution analysis further highlighted the importance of upstream inflow representation and graph-based spatial learning in capturing cross-subwatershed dependencies. The model also reproduced seasonal hydrological and biogeochemical patterns consistent with known processes, demonstrating its robustness and process fidelity for spatially distributed prediction. Altogether, HydroGraphNet advances the integration of physical knowledge and spatially explicit learning in hydrological modeling, offering a generalizable framework for distributed modeling to support spatially targeted water quality management in data-scarce watersheds.

54 ENVIRONMENTAL SCIENCES↗

A second-order distributed memory parallel fast sweeping method for the Eikonal equation

The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. In this work, we present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first-order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first-order, where the largest amount of mesh points ran on 144 cores (512 GB) was ≈20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predictive Modeling in Plasma Reactor and Process Design

Research continues toward the improvement and increased understanding of high-density plasma tools. Such reactor systems are lauded for their independent control of ion flux and energy enabling high etch rates with low ion damage and for their improved ion velocity anisotropy resulting from thin collisionless sheaths and low neutral pressures. Still, with the transition to 300 mm processing, achieving etch uniformity and high etch rates concurrently may be a formidable task for such large diameter wafers for which computational modeling can play an important role in successful reactor and process design. The inductively coupled plasma (ICP) reactor is the focus of the present investigation. The present work attempts to understand the fundamental physical phenomena of such systems through computational modeling. Simulations will be presented using both computational fluid dynamics (CFD) techniques and the direct simulation Monte Carlo (DSMC) method for argon and chlorine discharges. ICP reactors generally operate at pressures on the order of 1 to 10 mTorr. At such low pressures, rarefaction can be significant to the degree that the constitutive relations used in typical CFD techniques become invalid and a particle simulation must be employed. This work will assess the extent to which CFD can be applied and evaluate the degree to which accuracy is lost in prediction of the phenomenon of interest; i.e., etch rate. If the CFD approach is found reasonably accurate and bench-marked with DSMC and experimental results, it has the potential to serve as a design tool due to the rapid time relative to DSMC. The continuum CFD simulation solves the governing equations for plasma flow using a finite difference technique with an implicit Gauss-Seidel Line Relaxation method for time marching toward a converged solution. The equation set consists of mass conservation for each species, separate energy equations for the electrons and heavy species, and momentum equations for the gas. The sheath is modeled by imposing the Bohm velocity to the ions near the walls. The DSMC method simulates each constituent of the gas as a separate species which would be analogous in CFD to employing separate species mass, momentum, and energy equations. All particles including electrons are moved and allowed to collide with one another with the stipulation that the electrons remain tied to the ions consistent with the concept of ambipolar diffusion. The velocities of the electrons are allowed to be modified during collisions and are not confined to a Maxwellian distribution. These benefits come at a price in terms of computational time and memory. The DSMC and CFD are made as consistent as possible by using similar chemistry and power deposition models. Although the comparison of CFD and DSMC is interesting, the main goal of this work is the increased understanding of high-density plasma flowfields that can then direct improvements in both techniques. This work is unique in the level of the physical models employed in both the DSMC and CFD for high-density plasma reactor applications. For example, the electrons are simulated in the present DSMC work which has not been done before for low temperature plasma processing problems. In the CFD approach, for the first time, the charged particle transport (discharge physics) has been self-consistently coupled to the gas flow and heat transfer.

Hash, D. B.↗

Model fusion with physics-guided machine learning: Projection-based reduced-order modeling

The unprecedented amount of data generated from experiments, field observations, and large-scale numerical simulations at a wide range of spatiotemporal scales has enabled the rapid advancement of data-driven and especially deep learning models in the field of fluid mechanics. Although these methods are proven successful for many applications, there is a grand challenge of improving their generalizability. This is particularly essential when data-driven models are employed within outer-loop applications like optimization. In this work, we put forth a physics-guided machine learning (PGML) framework that leverages the interpretable physics-based model with a deep learning model. Leveraging a concatenated neural network design from multi-modal data sources, the PGML framework is capable of enhancing the generalizability of data-driven models and effectively protects against or inform about the inaccurate predictions resulting from extrapolation. We apply the PGML framework as a novel model fusion approach combining the physics-based Galerkin projection model and long- to short-term memory (LSTM) network for parametric model order reduction of fluid flows. We demonstrate the improved generalizability of the PGML framework against a purely data-driven approach through the injection of physics features into intermediate LSTM layers. Our quantitative analysis shows that the overall model uncertainty can be reduced through the PGML approach, especially for test data coming from a distribution different than the training data. Moreover, we demonstrate that our approach can be used as an inverse diagnostic tool providing a confidence score associated with models and observations. The proposed framework also allows for multi-fidelity computing by making use of low-fidelity models in the online deployment of quantified data-driven models.

42 ENGINEERING↗

Plasma enhanced multistate storage capability of single ZnO nanowire based memory

Multiple-state storage (MSS) is common for resistive random access memory, but the effects of plasma treatment on the MSS and the switching properties have been scarcely investigated. We have demonstrated a stable four-state storage capability of single zinc oxide nanowire (ZnO NW) treated by argon plasma. The electrical switching is attributed to the electron trapping and detrapping from the oxygen vacancies (V{sub o}s). The MSS relates to the electrical-thermal induced distribution of the V{sub o}s which determines electron transport behavior to show different resistance states. Additionally, programming (set and reset) voltages decrease with plasma treatment due to the thickness modulation of the interface barrier.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ELSI: A unified software interface for Kohn–Sham electronic structure solvers

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. As a result, comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗