Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random networks”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Linac_Gen: integrating machine learning and particle-in-cell methods for enhanced beam dynamics at Fermilab

Here, we introduce Linac_Gen, a tool developed at Fermilab, which combines machine learning algorithms with Particle-in-Cell methods to advance beam dynamics in linacs. Linac_Gen employs techniques such as Random Forest, Genetic Algorithms, Support Vector Machines, and Neural Networks, achieving a tenfold increase in speed for phase-space matching in linacs over traditional methods through the use of genetic algorithms. Crucially, Linac_Gen's adept handling of 3D field maps elevates the precision and realism in simulating beam instabilities and resonances, marking a key advancement in the field. Benchmarked against established codes, Linac_Gen demonstrates not only improved efficiency and precision in beam dynamics studies but also in the design and optimization of linac systems, as evidenced in its application to Fermilab's PIP-II linac project. This work represents a notable advancement in accelerator physics, marrying ML with PIC methods to set new standards for efficiency and accuracy in accelerator design and research. Linac_Gen exemplifies a novel approach in accelerator technology, offering substantial improvements in both theoretical and practical aspects of beam dynamics.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

Synchronization of the ERDA-NASA 100 kW wind turbine generator with large utility networks

The synchronizing of a wind turbine generator against an infinite bus under random conditions is studied for the first time. With a digital computer, complete solutions for rotor speed, generator power angle, electromagnetic torque, wind turbine torque, wind turbine blade pitch angle, and armature current are obtained and presented by graphs. Experiments have been recently performed on the ERDA-NASA 100 kW wind turbine. Experimental results matched computer study results very closely and confirmed that the synchronization can be accomplished by means of the existing speed control system and an automatic synchronizer.

Hwang, H. H.↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Entangling Quantum Generative Adversarial Networks

Generative adversarial networks (GANs) are one of the most widely adopted machine learning methods for data generation. In this work, we propose a new type of architecture for quantum generative adversarial networks (an entangling quantum GAN, EQ-GAN) that overcomes limitations of previously proposed quantum GANs. Leveraging the entangling power of quantum circuits, the EQ-GAN converges to the Nash equilibrium by performing entangling operations between both the generator output and true quantum data. In the first multiqubit experimental demonstration of a fully quantum GAN with a provably optimal Nash equilibrium, we use the EQ-GAN on a Google Sycamore superconducting quantum processor to mitigate uncharacterized errors, and we numerically confirm successful error mitigation with simulations up to 18 qubits. Finally, we present an application of the EQ-GAN to prepare an approximate quantum random access memory and for the training of quantum neural networks via variational datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗
DOE OSTI2025

A Study on the Impact of Temperature-Dependent Ferroelectric Switching Behavior in 3D Memory Architecture

The flourishing development of neural networks that require exponentially growing amounts of data has presented an elevated demand for memory footprint. To address this, researchers have been exploring hardware accelerators with innovative memory architectures like 3D memory. These 3D memory architectures offer enhanced storage capacity and processing capabilities, at a cost of rising on-chip temperature during operation. Hafnium Zirconium Oxide (HZO) based Ferroelectric Random Access Memory (FeRAM) is a promising nonvolatile memory candidate in neural network hardware accelerators for its outstanding write performance and reliability. However, its implementation in the architecture regarding the temperature-dependent ferroelectric switching behavior has not been well studied. In this work, we study the thermal impacts on polarization switching through experimental devices and simulation results. We conduct the circuit and architecture-level simulations to showcase that one can exploit this temperature rise to reduce FeRAM's write voltage and write energy due to its unique temperature-activated polarization switching mechanisms. As the on-chip temperature increases to 351K (ambient temperature at 300K) due to neural network workloads, the access energy per bit can be reduced by 27.6% when a dynamic write voltage is applied.

36 MATERIALS SCIENCE↗
DOE OSTI2021

The influence of preexisting host rock damage on fault network localization

The transition from stable to unstable fracture propagation occurs when fractures begin to interact and link. Thus, fracture network coalescence controls how rocks and engineered structures fail. Here, to constrain the factors that influence localization in shear zones under brittle conditions, we build discrete element method models with a rough fault embedded in a shear zone. We add varying numbers of diffuse, randomly-placed weaknesses to examine the influence of diffuse damage on fracture network localization. The number of weaknesses controls the localization behavior of the fault network and the final fault geometry. We quantify localization using the Gini coefficient of the fracture volume, which measures the nonuniformity in a population. Each model generally increases in localization toward failure. However, models with more diffuse damage experience delocalization phases that are superimposed on the overall trend of increasing localization. The observed link between delocalization and host rock damage may help explain the varying localization of low magnitude seismicity in southern California. Models with more diffuse damage produce more complex fault geometries comprised of several parallel strands of wing cracks. The propagation of these wing cracks reduces the shear stress acting on the model boundaries, indicating that this fracture development increases the mechanical efficiency of the system.

58 GEOSCIENCES↗
NASA NTRSDate not supplied

Predicting Air Traffic Management Initiatives Using Supervised Learning

Terminal Traffic Management Initiatives (TMIs) such as Ground Stops (GS) and Ground Delay Programs (GDP) are implemented to manage excess demand or lowered capacity at an airport. Air Traffic Flow Management (TFM) specialists identify situations such as aviation constraints, current and forecasted weather conditions, airport demand and capacity, and initiate TMIs for safe and orderly movement of air traffic. In this paper, we outline supervised learning techniques that can be used to predict and recommend TMIs at an airport based on current weather and airport conditions. Our research involves building classic Machine Learning (ML) models such as Logistic Regression, K-Nearest Neighbor, Random Forest and XGBoost, as well as Long short-term memory (LSTM) networks. We trained the models on 3-year historical data (weather, airport demand, capacity and TMIs) from Newark (EWR) airport which was selected based on its higher TMI implementation rates and varied weather conditions. Although Random Forest and XGBoost algorithms are able to predict if a TMI is needed or not, they have difficulty in predicting specific program type. For this purpose, we found that LSTM time-series forecasting models performed better as they also learn from past TMI program type sequences. This study also lays down the foundation for advanced modeling techniques and architectures to predict TMIs in advance for future periods. The ability to predict TMIs in advance will be highly beneficial to the traffic controllers and managers as this will help them to prepare for and manage TMIs more efficiently.

Manoj Agrawal↗
DOE OSTI2022

A Self-learning Neural Network Approach for Radio Frequency Interference Detection and Removal in Radio Astronomy

In this work, we present a novel neural network (NN) method for the detection and removal of radio frequency interference (RFI) from the raw digitized signal in the signal processing chain of a typical radio astronomy experiment. The main advantage of our method is that it does not require a training set. Instead, our method relies on the fact that the true signal of interest coming from astronomical sources is thermal and therefore described as a Gaussian random process, which cannot be compressed. We employ a variational encoder/decoder network to find the compressible information in the data stream that can explain the most variance with the fewest degrees of freedom. We demonstrate it on a set of toy problems and stored ring buffers from the Baryon Mapping eXperiment prototype. We find that the RFI subtraction is effective at cleaning simulated time streams: While we find that the power spectra of the RFI-cleaned time streams output by the NN suffer from extra signal consistent with additive noise, we find that it is generally around percent level across the band and sub 10% in contaminated spectral channels even when RFI power is an order of magnitude larger than the signal. We discuss the advantages and limitations of this method and possible implementation in the front end of future radio experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Real Space Imaging of Field-Driven Decision-Making in Nanomagnetic Galton Boards

A possible spintronic route to hardware implementation for decision-making involves injecting a domain wall into a bifurcated magnetic nanostrip resembling a Y-shaped junction. A decision is made when the domain wall chooses a particular path through the bifurcation. Recently, it was shown that a structure like a nanomagnetic Galton board, which is essentially an array of interconnected Y-shaped junctions, produces outcomes that are stochastic and therefore relevant to artificial neural networks. However, the exact mechanism leading to the robust nature of randomness is unknown. Here, in this study, we directly image the decision-making process in nanomagnetic Galton boards using Lorentz transmission electron microscopy. We identify that the stochasticity in nanomagnetic Galton boards arises as a culmination of (1) the topology of the injected domain wall, (2) dissimilarly sized vertices, and (3) the strength of the applied field. Our results pave the way to a detailed understanding of stochasticity in nanomagnetic networks.

lorentz microscopy↗
DOE OSTI2022

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Evaluation of Classifier Complexity for Delay Tolerant Network Routing

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.

Dudukovich, Rachel↗
DOE OSTI2021

Localization dynamics in a centrally coupled system

In systems in which interactions couple a central degree of freedom and a bath, one would expect signatures of the bath's phase to be reflected in the dynamics of the central degree of freedom. This has been recently explored in connection with many-body localized baths coupled with a central qubit or a single-cavity mode - systems with growing experimental relevance in various platforms. Such models also have an interesting connection with Floquet many-body localization via quantizing the external drive, although this has been relatively unexplored. Here we adapt the multilayer multiconfigurational time-dependent Hartree (ML-MCTDH) method, a well-known tree tensor network algorithm, to numerically simulate the dynamics of a central degree of freedom, represented by a d-level system (qudit), coupled to a disordered interacting one-dimensional spin bath. ML-MCTDH allows us to reach ≈10 2 lattice sites, a far larger system size than what is feasible with exact diagonalization or kernel polynomial methods. From the intermediate time dynamics, we find a well-defined thermodynamic limit for the qudit dynamics upon appropriate rescaling of the system-bath coupling. The spin system shows similar scaling collapse in the Edward-Anderson spin-glass order parameter or entanglement entropy at relatively short times. At longer timescales, we see slow growth of the entanglement, which may arise from dephasing mechanisms in the localized system or long-range interactions mediated by the central degree of freedom. Similar signs of localization are shown to appear as well with unscaled system-bath coupling.

1-dimensional spin chains↗
DOE OSTI2025

A Practical Comparison of Data-Driven Prognostics Methods for Energy Systems

This study explores data-driven prognostics for nuclear power plant (NPP) condensers, focusing on tube fouling. We utilized the Asherah nuclear power plant simulator (ANS) to compare four methods: Random Forest (RF), Support Vector Regressor (SVR), Fully Connected Neural Network (FCNN), and Long Short-Term Memory Neural Network (LSTM). By simulating various fouling scenarios in the ANS, we generated data with different degradation rates under transient operations. The models were trained and tested on these data, with performance evaluated visually and numerically including uncertainty assessment. The LSTM model excelled, exhibiting minimal prediction noise and the most accurate remaining useful life estimates across all degradation levels. Its ability to capture long-term dependencies and produce cleaner outputs makes it a strong candidate, although accurate training data across the entire component lifespan are crucial. The RF model emerged as a robust alternative, providing reliable predictions with high confidence. The FCNN and SVR models, while less effective overall, showed potential under specific conditions. FCNN offers a less complex alternative to LSTM and might benefit from larger datasets. SVR excels in precision when the quality of the training data is high. Furthermore, this study highlights the operational benefits of advanced prognostics in the energy sector and emphasizes the need for further research in NPP condenser health management through real-life experiments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Using porous random fields to predict the elastic modulus of unoxidized and oxidized superfine graphite

Nuclear graphite is a candidate material for Generation IV nuclear power plants. Porous materials such as graphite can contain complex networks of pores that influence the material's mechanical and irradiation response. A methodology known as the random finite element method (RFEM) was adapted to create synthetic microstructures and predict the influence of porosity on the elastic properties of graphite during oxidation. RFEM combines random field theory and the finite element method in a Monte Carlo framework to estimate the mechanical response of a given grade of graphite. In this research, the random fields were verified through experimental characterization to predict the elastic response of three nuclear graphite grades, ETU-10, IG-110, and 2114. Finite element models (FEM) were generated using segmentations of x-ray computed tomography (XCT) data known as image-based models (IBMs) to validate and compare with the RFEM results and better understand the effects of uniform oxidation in these graphite grades. The RFEM predictions appear to correlate well with the experimental values of the measured Young’s modulus of the three graphite grades and display the same trends as IBMs.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗