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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Learning and optimization with cascaded VLSI neural network building-block chips

To demonstrate the versatility of the building-block approach, two neural network applications were implemented on cascaded analog VLSI chips. Weights were implemented using 7-b multiplying digital-to-analog converter (MDAC) synapse circuits, with 31 x 32 and 32 x 32 synapses per chip. A novel learning algorithm compatible with analog VLSI was applied to the two-input parity problem. The algorithm combines dynamically evolving architecture with limited gradient-descent backpropagation for efficient and versatile supervised learning. To implement the learning algorithm in hardware, synapse circuits were paralleled for additional quantization levels. The hardware-in-the-loop learning system allocated 2-5 hidden neurons for parity problems. Also, a 7 x 7 assignment problem was mapped onto a cascaded 64-neuron fully connected feedback network. In 100 randomly selected problems, the network found optimal or good solutions in most cases, with settling times in the range of 7-100 microseconds.

Duong, T.↗
NASA NTRS2018

Evaluation of Opportunistic Contact Graph Routing in Random Mobility Environments

Routing in networks where nodes move randomly is particularly challenging due their potentially unpredictable, and rapidly changing topology. Several routing algorithms have been presented in the literature to address the needs of such networks, most of them implementing variants of controlled network flooding in the hope of successful data delivery. In this note, we compare the results of previous routing algorithms with Opportunistic Contact Graph Routing (OCGR), an enhanced version of Contact Graph Routing (CGR) that is suitable for networks where contacts cannot always be scheduled ahead of time. To perform the benchmark, we simulate a network of nodes moving in a certain space according to the Random Waypoint Mobility Model, and then take measurements of bundle delivery probabilty and overhead ratio as metrics of performance and cost respectively. Through this exercise, we demonstrate that the performance of OCGR is highly dependent on the type of network under consideration (e.g. very sparse vs. densely connected) and the assumed mobility model.

Burleigh, Scott↗
DOE OSTI2023

Deep material network via a quilting strategy: visualization for explainability and recursive training for improved accuracy

Recent developments integrating micromechanics and neural networks offer promising paths for rapid predictions of the response of heterogeneous materials with similar accuracy as direct numerical simulations. The deep material network is one such approaches, featuring a multi-layer network and micromechanics building blocks trained on anisotropic linear elastic properties. Once trained, the network acts as a reduced-order model, which can extrapolate the material’s behavior to more general constitutive laws, including nonlinear behaviors, without the need to be retrained. However, current training methods initialize network parameters randomly, incurring inevitable training and calibration errors. Here, we introduce a way to visualize the network parameters as an analogous unit cell and use this visualization to “quilt” patches of shallower networks to initialize deeper networks for a recursive training strategy. The result is an improvement in the accuracy and calibration performance of the network and an intuitive visual representation of the network for better explainability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Revealing the Formation Energy–Exfoliation Energy–Structure Correlation of MAB Phases Using Machine Learning and DFT

MAB phases are popular as high-temperature materials with high damage tolerance and excellent electrical conductivity that are used to exfoliate two-dimensional (2D) transition metal borides (MBenes); a promising material for developing next- generation nanodevices. In this report, we explore the correlation between the formation energy, exfoliation energy and structural factors of MAB phases using DFT and machine learning. In order to do so, we developed three different machine learning models based on the support vector machine, deep neural network, and random forest regressor to study the stability of the MAB phases by calculating their formation energies. Furthermore, our support vector machine and deep neural network models are capable of predicting the formation energies with mean absolute errors less than 0.1 eV/atom. We demonstrated that the stability of a MAB phase for a given transition metal decreases when the A element changes from Al to Tl. The density functional theory (DFT) re- vealed that M-A and M-B bond strength strongly correlates with the stability of MAB phases. In addition, the exfoliation possibility of 2D MBenes becomes higher when the A element changes from Al to Tl due to weakening of M-A and M-B bonds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2004

Network Theory: A Primer and Questions for Air Transportation Systems Applications

A new understanding (with potential applications to air transportation systems) has emerged in the past five years in the scientific field of networks. This development emerges in large part because we now have a new laboratory for developing theories about complex networks: The Internet. The premise of this new understanding is that most complex networks of interest, both of nature and of human contrivance, exhibit a fundamentally different behavior than thought for over two hundred years under classical graph theory. Classical theory held that networks exhibited random behavior, characterized by normal, (e.g., Gaussian or Poisson) degree distributions of the connectivity between nodes by links. The new understanding turns this idea on its head: networks of interest exhibit scale-free (or small world) degree distributions of connectivity, characterized by power law distributions. The implications of scale-free behavior for air transportation systems include the potential that some behaviors of complex system architectures might be analyzed through relatively simple approximations of local elements of the system. For air transportation applications, this presentation proposes a framework for constructing topologies (architectures) that represent the relationships between mobility, flight operations, aircraft requirements, and airspace capacity, and the related externalities in airspace procedures and architectures. The proposed architectures or topologies may serve as a framework for posing comparative and combinative analyses of performance, cost, security, environmental, and related metrics.

Holmes, Bruce J.↗
NASA NTRS2002

Development of Novel Composite and Random Materials for Nonlinear Optics and Lasers

A qualitative model explaining sharp spectral peaks in emission of solid-state random laser materials with broad-band gain is proposed. The suggested mechanism of coherent emission relies on synchronization of phases in an ensemble of emitting centers, via time delays provided by a network of random scatterers, and amplification of spontaneous emission that supports the spontaneously organized coherent state. Laser-like emission from powders of solid-state luminophosphors, characterized by dramatic narrowing of the emission spectrum and shortening of emission pulses above the threshold, was first observed by Markushev et al. and further studied by a number of research groups. In particular, it has been shown that when the pumping energy significantly exceeds the threshold, one or several narrow emission lines can be observed in broad-band gain media with scatterers, such as films of ZnO nanoparticles, films of pi-conjugated polymers or infiltrated opals. The experimental features, commonly observed in various solid-state random laser materials characterized by different particle sizes, different values of the photon mean free path l*, different indexes of refraction, etc.. can be described as follows. (Liquid dye random lasers are not discussed here.)

Noginov, Mikhail↗
DOE OSTI2021

Entanglement transitions from restricted Boltzmann machines

The search for novel entangled phases of matter has lead to the recent discovery of a new class of “en- tanglement transitions,” exemplified by random tensor networks and monitored quantum circuits. Most known examples can be understood as some classical ordering transitions in an underlying statistical mechanics model, where entanglement maps onto the free-energy cost of inserting a domain wall. In this paper we study the possibility of entanglement transitions driven by physics beyond such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired variational Ansätze, we investigate under what conditions on the variational parameters these Ansätze can capture an entanglement transition. We study the entanglement scaling of short-range restricted Boltzmann machine (RBM) quantum states with random phases. For uncorrelated random phases, we analytically demonstrate the absence of an entanglement transition and reveal subtle finite-size effects in finite-size numerical simulations. Introducing phases with correlations decaying as 1/r α in real space, we observe three regions with a different scaling of entanglement entropy depending on the exponent α. We study the nature of the transition between these regions, finding numerical evidence for critical behavior. Furthermore, our work establishes the presence of long-range correlated phases in RBM-based wave functions as a required ingredient for entanglement transitions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Self-assembly of cocontinuous nanostructured copolymer templates with compositional and architectural dispersity. Final Report

Cocontinuous nanostructured materials in which multiple domains of different materials simultaneously span three dimensional space offer opportunities to achieve combined properties not possible with a single homogeneous material. These architectures have importance in a broad range of energy-relevant technologies including batteries, supercapacitors, fuel cells, separation membranes, and catalysts. Achieving such structures in polymeric materials has been of long-standing interest in the field, due to both the inherently attractive properties of cocontinuous polymer morphologies as well as their ability to serve as templates for other functional nanostructured materials. Our work on this project has established that randomly-linked polymer architectures constructed from two immiscible polymer strands provide robust and highly tunable approaches to disordered cocontinuous nanostructures. In particular, we developed a detailed understanding of how the parameters (linker functionality and strand length, asymmetry, and dispersity) of randomly-linked networks controlled the breadth of the cocontinuous window over which both phases remain percolated. We further characterized how these nanostructures undergo orientation, while retaining cocontinuity, under mechanical deformation. We also compared their behavior to that of random multi-block polymers of linear architecture, which show similar propensity to form disordered nanostructures, albeit over narrower ranges of parameter space. Finally, we have explored the development of functional polymer nanostructures and composites based in part on the fundamental understanding obtained via this project.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Training Spiking Neural Networks Using Combined Learning Approaches

Spiking neural networks (SNNs), the class of neural networks used in neuromorphic computing, are difficult to train using traditional back-propagation techniques. Spike timingdependent plasticity (STDP) is a biologically inspired learning mechanism that can be used to train SNNs. Evolutionary algorithms have also been demonstrated as a method for training SNNs. In this work, we explore the relationship between these two training methodologies. We evaluate STDP and evolutionary optimization as standalone methods for training networks, and also evaluate a combined approach where STDP weight updates are applied within an evolutionary algorithm. We also apply Bayesian hyperparameter optimization as a meta learner for each of the algorithms. We find that STDP by itself is not an ideal learning rule for randomly connected networks, while the inclusion of STDP within an evolutionary algorithm leads to similar performance, with a few interesting differences. This study suggests future work in understanding the relationship between network topology and learning rules.

Elbrecht, Daniel↗
DOE OSTI2021

Crosslinked Matrimid®-like polyimide membranes with unimodal network structure for enhanced stability and gas separation performance

Gas separation membranes have attracted academic and industrial attention, and crosslinking has been identified to be one of the most effective ways to enhance membrane stability. In this paper, a series of crosslinked Matrimid®-like films with unimodal network structures are prepared via thermally end-linking phenylethnyl-terminated BTDA-DAPI oligomers with well-controlled molecular weight (i.e., 3000–15,000 g/mol), wherein the crosslink density (the inter-crosslink chain length) of resulting unimodal networks is systematically varied by using oligomers with various molecular weight. Comprehensive characterizations of chemical structure, thermal properties, microstructures are performed. Pure-gas permeation measurements are performed focusing on H 2 /CH 4 and CO 2 /CH 4 separations as a function of crosslink density. In sharp contrast to the commonly observed permeability reduction in randomly crosslinked networks, all the crosslinked unimodal films, even when densely crosslinked, present markedly enhanced permeability and well-maintained ideal selectivity relative to the uncrosslinked linear counterpart, leading to almost horizontal movements towards upper bounds along with expectedly enhanced membrane stability. In conclusion, it is concluded that introducing bulky groups at the crosslink sites provide a practical means to counteract the densification effect induced by crosslinking and the construction of unimodal networks exemplifies a fundamentally new strategy to regulate the microstructure and property of crosslinked membranes for gas separations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗
DOE OSTI2022

A Dynamic Pore Network Model for Imbibition Simulation Considering Corner Film Flow

Wetting films can develop in the corners of angular pores under strong wetting conditions. Modeling the dynamics of corner film remains elusive using direct numerical simulations because of the significant scale difference between main meniscus and corner film flow. In this paper, the modified interacting capillary bundle model (ICB), developed in our previous work to describe accurately corner film dynamics in a single square tube, is incorporated into a single-pressure dynamic pore network model (DPNM) to simulate imbibition in strongly wetting porous media with corner film flow. The traditional pore network is decomposed into several layers of interacting subpore networks where the 0th layer of subpore network simulates the main meniscus flow and higher layers the corner film flow. The fluid flow between different layers is captured by interlayer throats. In addition, the snap-off mechanism caused by the thickening of wetting corner film is considered. The accuracy of the developed model is validated for four cases: spontaneous imbibition in a single square tube, wetting fluid redistribution through corner films under a capillary pressure difference, snap off in a narrow throat connecting two large pores, and imbibition dynamics in a real microfluidic porous geometry. The validated model is then used to simulate both spontaneous and controlled imbibition in a pore network with random pore size distribution. Finally, the interaction between corner film and main meniscus flow in porous media is analyzed from a pore-scale perspective.

58 GEOSCIENCES↗
DOE OSTI2024

Vehicle Position Detection Based on Machine Learning Algorithms in Dynamic Wireless Charging

Dynamic wireless charging (DWC) has emerged as a viable approach to mitigate range anxiety by ensuring continuous and uninterrupted charging for electric vehicles in motion. DWC systems rely on the length of the transmitter, which can be categorized into long-track transmitters and segmented coil arrays. The segmented coil array, favored for its heightened efficiency and reduced electromagnetic interference, stands out as the preferred option. However, in such DWC systems, the need arises to detect the vehicle’s position, specifically to activate the transmitter coils aligned with the receiver pad and de-energize uncoupled transmitter coils. This paper introduces various machine learning algorithms for precise vehicle position determination, accommodating diverse ground clearances of electric vehicles and various speeds. Through testing eight different machine learning algorithms and comparing the results, the random forest algorithm emerged as superior, displaying the lowest error in predicting the actual position.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

MLP-NN vs Gauss-Newton files

-Input files for randomly selected subset data (30 instances) from primary dipole-dipole forward modeling data.-Inversion results in surfer grid format as well as in .DAT format.-Scatterplots for MLP-NN vs Gauss-Newton present in the excel sheet.

58 GEOSCIENCES↗
DOE OSTI2024

Graph neural networks for CO 2 solubility predictions in Deep Eutectic Solvents

Deep Eutectic Solvents (DESs) are a promising class of solvents for CO 2 capture. DESs are complex mixtures that can be designed to optimize CO solubility and overall capture process efficiency. However, the vast design landscape of DES mixtures makes experimental investigation prohibitive; as such, there is a need for computational models that can quickly and efficiently navigate the design space and inform data collection efforts. In this work, we propose Graph Neural Network (GNN) models for predicting CO 2 solubility for DESs; the GNN leverages a mixture graph representation that captures the molecular structure of the DES components as well as their intermolecular interactions. Here, we compare the GNN framework against alternative architectures (neural networks, graph convolution networks, and random forests) and data representations (molecular fingerprints, sigma profiles, and graphs). We show that the proposed approach offers superior predictive performance; specifically, we show that solubility can be predicted reliably directly from molecular structure (without the need of using sigma profiles as proposed in previous studies). This result is important, as obtaining sigma profiles requires expensive density functional theory computations. We also explored the ability of GNNs to predict solubility for new DES mixtures and operating conditions. We found that the model extrapolates across temperature reliably. However, we also found deficiencies in the ability of the model to predict solubility for DES mixtures, pressures, and molar ratio not included in the training sets; we show that this is due to an inherent lack of chemical diversity in datasets available in the literature. The proposed computational capabilities can thus help navigate the design space of DES and inform data collection efforts. Our models, data, and benchmarks are shared as Python code implemented in Jupyter notebooks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Entanglement negativity and replica symmetry breaking in general holographic states

The entanglement negativity $\mathcal{E}$(A : B) is a useful measure of quantum entanglement in bipartite mixed states. In random tensor networks (RTNs), which are related to fixed-area states, it was found in ref. [1] that the dominant saddles computing the even Rényi negativity $\mathcal{E}$ (2k) generically break the ℤ 2k replica symmetry. This calls into question previous calculations of holographic negativity using 2D CFT techniques that assumed ℤ 2k replica symmetry and proposed that the negativity was related to the entanglement wedge cross section. In this paper, we resolve this issue by showing that in general holographic states, the saddles computing $\mathcal{E}$ (2k) indeed break the ℤ 2k replica symmetry.

AdS-CFT Correspondence↗
DOE OSTI2024

Constrained HRT Surfaces and their Entropic Interpretation

Abstract Consider two boundary subregionsAandBthat lie in a common boundary Cauchy surface, and consider also the associated HRT surfaceγ B forB. In that context, the constrained HRT surfaceγ A:B can be defined as the codimension-2 bulk surface anchored toAthat is obtained by a maximin construction restricted to Cauchy slices containingγ B . As a result,γ A:B is the union of two pieces,$$ {\gamma}_{A:B}^B $$ γ A : B B and$$ {\gamma}_{A:B}^{\overline{B}} $$ γ A : B B ¯ lying respectively in the entanglement wedges ofBand its complement$$ \overline{B} $$ B ¯ . Unlike the area$$ \mathcal{A}\left({\gamma}_A\right) $$ A γ A of the HRT surfaceγ A , at least in the semiclassical limit, the area$$ \mathcal{A}\left({\gamma}_{A:B}\right) $$ A γ A : B ofγ A:B commutes with the area$$ \mathcal{A}\left({\gamma}_B\right) $$ A γ B ofγ B . To study the entropic interpretation of$$ \mathcal{A}\left({\gamma}_{A:B}\right) $$ A γ A : B , we analyze the Rényi entropies of subregionAin a fixed-area state of subregionB. We use the gravitational path integral to show that then ≈1 Rényi entropies are then computed by minimizing$$ \mathcal{A}\left({\gamma}_A\right) $$ A γ A over spacetimes defined by a boost angle conjugate to$$ \mathcal{A}\left({\gamma}_B\right) $$ A γ B . In the case where the pieces$$ {\gamma}_{A:B}^B $$ γ A : B B and$$ {\gamma}_{A:B}^{\overline{B}} $$ γ A : B B ¯ intersect at a constant boost angle, a geometric argument shows that then ≈1 Rényi entropy is then given by$$ \frac{\mathcal{A}\left({\gamma}_{A:B}\right)}{4G} $$ A γ A : B 4 G . We discuss how then ≈1 Rényi entropy differs from the von Neumann entropy due to a lack of commutativity of then→ 1 andG →0 limits. We also discuss how the behaviour changes as a function of the width of the fixed-area state. Our results are relevant to some of the issues associated with attempts to use standard random tensor networks to describe time dependent geometries.

Physics↗