Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Complex 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 1,153 records · Page 64

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗

Phase Equilibrium of Water with Hexagonal and Cubic Ice Using the SCAN Functional

Machine learning models are rapidly becoming widely used to simulate complex physicochemical phenomena with ab initio accuracy. Here, we use one such model as well as direct density functional theory (DFT) calculations to investigate the phase equilibrium of water, hexagonal ice (Ih), and cubic ice (Ic), with an eye toward studying ice nucleation. The machine learning model is based on deep neural networks and has been trained on DFT data obtained using the SCAN exchange and correlation functional. We use this model to drive enhanced sampling simulations aimed at calculating a number of complex properties that are out of reach of DFT-driven simulations and then employ an appropriate reweighting procedure to compute the corresponding properties for the SCAN functional. This approach allows us to calculate the melting temperature of both ice polymorphs, the driving force for nucleation, the heat of fusion, the densities at the melting temperature, the relative stability of ices Ih and Ic, and other properties. We find a correct qualitative prediction of all properties of interest. In some cases, quantitative agreement with experiment is better than for state-of-the-art semiempirical potentials for water. Furthermore, our results also show that SCAN correctly predicts that ice Ih is more stable than ice Ic.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-Scale Microfluidics for Transport in Shale Fabric

We develop a microfluidic experimental platform to study solute transport in multi-scale fracture networks with a disparity of spatial scales ranging between two and five orders of magnitude. Using the experimental scaling relationship observed in Marcellus shales between fracture aperture and frequency, the microfluidic design of the fracture network spans all length scales from the micron (1 μ) to the dm (10 dm). This intentional `tyranny of scales’ in the design, a determining feature of shale fabric, introduces unique complexities during microchip fabrication, microfluidic flow-through experiments, imaging, data acquisition and interpretation. Here, we establish best practices to achieve a reliable experimental protocol, critical for reproducible studies involving multi-scale physical micromodels spanning from the Darcy- to the pore-scale (dm to μm). With this protocol, two fracture networks are created: a macrofracture network with fracture apertures between 5 and 500 μm and a microfracture network with fracture apertures between 1 and 500 μm. The latter includes the addition of 1 μm ‘microfractures’, at a bearing of 55°, to the backbone of the former. Comparative analysis of the breakthrough curves measured at corresponding locations along primary, secondary and tertiary fractures in both models allows one to assess the scale and the conditions at which microfractures may impact passive transport.

58 GEOSCIENCES↗

A deep dilated convolutional residual network for predicting interchain contacts of protein homodimers

Abstract Motivation Deep learning has revolutionized protein tertiary structure prediction recently. The cutting-edge deep learning methods such as AlphaFold can predict high-accuracy tertiary structures for most individual protein chains. However, the accuracy of predicting quaternary structures of protein complexes consisting of multiple chains is still relatively low due to lack of advanced deep learning methods in the field. Because interchain residue–residue contacts can be used as distance restraints to guide quaternary structure modeling, here we develop a deep dilated convolutional residual network method (DRCon) to predict interchain residue–residue contacts in homodimers from residue–residue co-evolutionary signals derived from multiple sequence alignments of monomers, intrachain residue–residue contacts of monomers extracted from true/predicted tertiary structures or predicted by deep learning, and other sequence and structural features. Results Tested on three homodimer test datasets (Homo_std dataset, DeepHomo dataset and CASP-CAPRI dataset), the precision of DRCon for top L/5 interchain contact predictions (L: length of monomer in a homodimer) is 43.46%, 47.10% and 33.50% respectively at 6 Å contact threshold, which is substantially better than DeepHomo and DNCON2_inter and similar to Glinter. Moreover, our experiments demonstrate that using predicted tertiary structure or intrachain contacts of monomers in the unbound state as input, DRCon still performs well, even though its accuracy is lower than using true tertiary structures in the bound state are used as input. Finally, our case study shows that good interchain contact predictions can be used to build high-accuracy quaternary structure models of homodimers. Availability and implementation The source code of DRCon is available at https://github.com/jianlin-cheng/DRCon. The datasets are available at https://zenodo.org/record/5998532#.YgF70vXMKsB. Supplementary information Supplementary data are available at Bioinformatics online.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Challenges and Solutions for Real-Time Phasor Modeling of Large-scale Distribution Network with High PV Penetration

The conversion process of a practical large-scale feeder data from a quasi-static time series (OpenDSS) model into a real-time phasor model (ePHASORSIM in Opal-RT) is discussed in the paper. The process is implemented using an open source Python software. Previous reported implementations for the conversion process lead to several errors when applied to a larger-scale system such as the one considered here. Hence in this work, we describe the common issues in this conversion and propose a customized solution to enhance the efficiency of the conversion and reduce the complexity in the process. A quantitative validation of the enhanced conversion process is presented in this work using an actual high PV penetration feeder model that consists of 2230 buses, and using actual load and PV profile data. After a detailed analysis, this customized conversion software will be made available as an open source tool and is expected to be helpful for researchers who want to pursue a similar conversion. Solutions to various observed issues such as identifying the lines due to islanded network, representation of full impedance model of transformer/lines as sequential models, complexity in the representation of single phase buses/lines as three phase buses/lines to make it compatible with the simulator platform are discussed. Comparison of power flow and time series simulation results obtained from both OpenDSS and ePHASORsim models show very low errors, validating the accuracy of the proposed conversion process.

14 SOLAR ENERGY↗

Deploying synthetic coevolution and machine learning to engineer protein-protein interactions

Fine-tuning of protein-protein interactions occurs naturally through coevolution, but this process is difficult to recapitulate in the laboratory. We describe a platform for synthetic protein-protein coevolution that can isolate matched pairs of interacting muteins from complex libraries. This large dataset of coevolved complexes drove a systems-level analysis of molecular recognition between Z domain–affibody pairs spanning a wide range of structures, affinities, cross-reactivities, and orthogonalities, and captured a broad spectrum of coevolutionary networks. Furthermore, we harnessed pretrained protein language models to expand, in silico, the amino acid diversity of our coevolution screen, predicting remodeled interfaces beyond the reach of the experimental library. Further, the integration of these approaches provides a means of simulating protein coevolution and generating protein complexes with diverse molecular recognition properties for biotechnology and synthetic biology.

59 BASIC BIOLOGICAL SCIENCES↗

Robust Distributed State Estimator for Interconnected Transmission and Distribution Networks (Final Report RPPR-1)

This project’s objective is to develop a combined transmission and distribution state estimator which accounts for very large system size and model complexity (by way of distributing the computations) and large number of solar PV units connected to the distribution system on multiple feeders. The project not only provides a robust formulation and solution to this problem but also tests the solution by implementing it on a well-established large utility system. It introduces several improvements with respect to the state of the art in existing state estimation software: (a) The developed state estimator (SE) allows robust and accurate monitoring of bidirectional flows in distribution systems which result due to the distributed energy sources which are not observable and thus not incorporated in generation dispatch; (b) Large utility systems with tens of thousands of transmission buses and hundreds of thousands of distribution nodes are difficult to model as a single integrated system. This shortcoming is addressed by developing a “scalable distributed computational framework” which allows splitting the ultra large system models into several small subsystems and coordinating their solution by a robust and practical state estimation formulation; (c) Measurement errors irrespective of their locations are detected and removed by the developed state estimator. Historically, transmission and distribution systems were analyzed and operated as two independent systems. Given the non-transposed short feeder sections, unevenly loaded phases, strictly radial configuration and unidirectional power flows in the absence of remote generation, distribution system analysis was customized to account for these characteristics. However, some of these assumptions are no longer valid (non-radial configuration, bidirectional power flows) and thus distribution system analysis should be revisited. Furthermore, in the past, the interaction between the transmission and distribution systems was quite passive, where distribution substations were modeled as lumped loads in the transmission system model. With substantial generation injected by renewable generation located in the distribution systems, such modeling will no longer be accurate. The developed state estimator facilitates proper monitoring of the interactions between the transmission and distribution systems and enables smart dispatch of these units which are made observable by the state estimator.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Levenberg–Marquardt multi-classification using hinge loss function

Incorporating higher-order optimization functions, such as Levenberg-Marquardt (LM) have revealed better generalizable solutions for deep learning problems. However, these higher-order optimization functions suffer from very large processing time and training complexity especially as training datasets become large, such as in multi-view classification problems, where finding global optima is a very costly problem. To solve this issue, we develop a solution for LM-enabled classification with, to the best of knowledge first-time implementation of hinge loss, for multiview classification. Hinge loss allows the neural network to converge faster and perform better than other loss functions such as logistic or square loss rates. Here we prove our method by experimenting with various multiclass classification challenges of varying complexity and training data size. The empirical results show the training time and accuracy rates achieved, highlighting how our method outperforms in all cases, especially when training time is limited. Our paper presents important results in the relationship between optimization and loss functions and how these can impact deep learning problems.

97 MATHEMATICS AND COMPUTING↗

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

Novel Fault Location Method for Power Systems Based on Attention Mechanism and Double Structure GRU Neural Network

Fault location is one of the most essential techniques to maintain the stable operation of power systems. A fast and accurate fault location allows operators to restore power grids faster and avoid economic losses. Conventional methods rely on expert knowledge to extract the necessary features (e.g. DWT, DFT). For large systems, more coupling effects of transmission lines require more complex feature engineering, and incomplete features can easily introduce large errors. To overcome this, a deep learning approach without manual feature extraction is introduced to the fault location model under big data application. Towards this end, in the proposed method, the attention mechanism, the Bi-GRU and a dual structure network are applied to analyze the current data from different perspectives. Complete information for the fault features is extracted for the fault location. Based on a time series model and benefit from the ability to internally acquire the information architecture of faulty line, the established model is adaptive to the power grids with very complex topologies. Simulation results indicate that the proposed double-structure model reduces the maximum error and is less affected by noise. In comparison with different structures and different models, the proposed method shows better performance in IEEE 39-bus system.

42 ENGINEERING↗

Multidimensional Distributional Neural Network Output Demonstrated in Super‐Resolution of Surface Wind Speed

Accurate quantification of uncertainty in neural network predictions remains a central challenge for scientific applications involving high-dimensional, correlated data. While existing methods capture either aleatoric or epistemic uncertainty, few offer closed-form, multidimensional distributions that preserve spatial correlation while remaining computationally tractable. In this work, we present a framework for training neural networks with a multidimensional Gaussian loss, generating a closed-form predictive distribution over outputs informed by non-identically distributed training data. Our approach captures aleatoric uncertainty by iteratively estimating the means and covariance matrices, and is demonstrated on a super-resolution example out-of-training-sample. We leverage a Fourier representation of the covariance matrix to stabilize network training and preserve spatial correlation. We introduce a novel regularization strategy—referred to as information sharing—that interpolates between image-specific and global covariance estimates, enabling convergence of the super-resolution downscaling network trained on image-specific distributional loss functions. This framework allows for efficient sampling, explicit correlation modeling, and extensions to more complex distribution families all without disrupting prediction performance. We demonstrate the method on a surface wind speed downscaling task and discuss its broader applicability to uncertainty-aware prediction in scientific models.

17 WIND ENERGY↗

Physics–Informed Neural Networks of the Saint–Venant Equations for Downscaling a Large–Scale River Model

Large-scale river models are being refined over coastal regions to improve the scientific understanding of coastal processes, hazards and responses to climate change. However, coarse mesh resolutions and approximations in physical representations of tidal rivers limit the performance of such models at resolving the complex flow dynamics near the river-ocean interface, resulting in inaccurate simulations of flood inundation. In this research, we propose a machine learning (ML) framework based on the state-of-the-art physics-informed neural network (PINN) to simulate the downscaled flow at the subgrid scale. First, we demonstrate that PINN is able to assimilate observations of various types and solve the one-dimensional (1-D) Saint-Venant equations (SVE) directly. We perform the flow simulations over a floodplain and along an open channel in several synthetic case studies. The PINN performance is evaluated against analytical solutions and numerical models. Our results indicate that the PINN solutions of water depth have satisfactory accuracy with limited observations assimilated. In the case of flood wave propagation induced by storm surge and tide, a new neural network architecture is proposed based on Fourier feature embeddings that seamlessly encodes the periodic tidal boundary condition in the PINN's formulation. Furthermore, we show that the PINN-based downscaling can produce more reasonable subgrid solutions of the along-channel water depth by assimilating observational data. The PINN solution outperforms the simple linear interpolation in resolving the topography and dynamic flow regimes at the subgrid scale. This study provides a promising path towards improving emulation capabilities in large-scale models to characterize fine-scale coastal processes.

54 ENVIRONMENTAL SCIENCES↗

An interaction network in the polymerase active site is a prerequisite for Watson-Crick base pairing in Pol γ

The replication accuracy of DNA polymerase gamma (Pol γ) is essential for mitochondrial genome integrity. Mutation of human Pol γ arginine-853 has been linked to neurological diseases. Although not a catalytic residue, Pol γ arginine-853 mutants are void of polymerase activity. To identify the structural basis for the disease, we determined a crystal structure of the Pol γ mutant ternary complex with correct incoming nucleotide 2'-deoxycytidine 5'-triphosphate (dCTP). Opposite to the wild type that undergoes open-to-closed conformational changes when bound to a correct nucleotide that is essential for forming a catalytically competent active site, the mutant complex failed to undergo the conformational change, and the dCTP did not base pair with its Watson-Crick complementary templating residue. Our studies revealed that arginine-853 coordinates an interaction network that aligns the 3'-end of primer and dCTP with the catalytic residues. Disruption of the network precludes the formation of Watson-Crick base pairing and closing of the active site, resulting in an inactive polymerase.

59 BASIC BIOLOGICAL SCIENCES↗

Collaborative Fault Tolerant Control of Non-Signalized Intersections for Connected and Autonomous Vehicles

With the potential of increased penetration of connected and autonomous vehicles (CAVs), intersectional signal control faces new challenges in terms of its operation and implementation. One possibility is to fully make use of the communication capabilities of CAVs so that intersectional signal control can be realized by CAVs alone – this leads to non-signalized intersectional operation for traffic networks in urban areas. In this paper, the state-of-the-art on collaborative fault tolerant control schemes for complex systems will be briefly described. This is then followed by the formulation of operational fault tolerant control that realizes the collaborative fault tolerance functionality at CAVs operational level in response to possible individual vehicle faults, where detailed modelling using vehicle movement dynamics will be described together with the construction of fast fault diagnosis and a collaborative fault tolerant control algorithm. A simple example will be given as well to demonstrate the proposed algorithm together with the discussions on other issues such as randomness of the system, communication errors and full energy consideration. These leads to several future directions of the research for the traffic flow control of non-signalized intersections with 100% penetration of CAVs.

Wang, Hong↗

Data-Driven Approaches for Bead Geometry Prediction Via Melt Pool Monitoring

In the realm of additive manufacturing, the selection of process parameters to avoid over and under deposition entails a time-consuming and resource-intensive trial-and-error approach. Given the distinct characteristics of each part geometry, there is a pressing need for advancing real-time process monitoring and control to ensure consistent and reliable part dimensional accuracy. Here, this research shows that support vector regression (SVR) and convolutional neural network (CNN) models offer a promising solution for real-time process control due to the models’ abilities to recognize complex, non-linear patterns with high accuracy. A novel experiment was designed to compare the performance of SVR and CNN models to indirectly detect bead height from a coaxial image of a melt pool from a single-layer, single bead build. The study showed that both SVR and CNN models trained on melt pool data collected from a coaxial optical camera can accurately predict the bead height with a mean absolute percentage error of 3.67% and 3.68%, respectively.

36 MATERIALS SCIENCE↗

Retina-inspired narrowband perovskite sensor array for panchromatic imaging

The retina is the essential part of the human visual system that receives light, converts it to neural signal, and transmits to brain for visual recognition. The red, green, and blue (R/G/B) cone retina cells are natural narrowband photodetectors (PDs) sensitive to R/G/B lights. Connecting with these cone cells, a multilayer neuro-network in the retina provides neuromorphic preprocessing before transmitting to brain. Inspired by this sophistication, we develop the narrowband (NB) imaging sensor combining R/G/B perovskite NB sensor array (mimicking the R/G/B photoreceptors) with a neuromorphic algorithm (mimicking the intermediate neural network) for high-fidelity panchromatic imaging. Compared to commercial sensors, we use perovskite “intrinsic” NB PD to exempt the complex optical filter array. In addition, we use an asymmetric device configuration to collect photocurrent without external bias, enabling a power-free photodetection feature. These results display a promising design for efficient and intelligent panchromatic imaging.

42 ENGINEERING↗

Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery

We developed Distilled Graph Attention Policy Network (DGAPN), a reinforcement learning model to generate novel graph-structured chemical representations that optimize user-defined objectives by efficiently navigating a physically constrained domain. The framework is examined on the task of generating molecules that are designed to bind, noncovalently, to functional sites of SARS-CoV-2 proteins. We present a spatial Graph Attention (sGAT) mechanism that leverages self-attention over both node and edge attributes as well as encoding the spatial structure --- this capability is of considerable interest in synthetic biology and drug discovery. An attentional policy network is introduced to learn the decision rules for a dynamic, fragment-based chemical environment, and state-of-the-art policy gradient techniques are employed to train the network with stability. Exploration is driven by the stochasticity of the action space design and the innovation reward bonuses learned and proposed by random network distillation. In experiments, our framework achieved outstanding results compared to state-of-the-art algorithms, while reducing the complexity of paths to chemical synthesis.

Wu, Yulun↗

SPATIAL GRAPH ATTENTION AND CURIOSITY-DRIVEN POLICY FOR ANTIVIRAL DRUG DISCOVERY

We developed Distilled Graph Attention Policy Network (DGAPN), a reinforcement learning model to generate novel graph-structured chemical representations that optimize user-defined objectives by efficiently navigating a physically constrained domain. The framework is examined on the task of generating molecules that are designed to bind, noncovalently, to functional sites of SARS-CoV-2 proteins. We present a spatial Graph Attention (sGAT) mechanism that leverages self-attention over both node and edge attributes as well as encoding the spatial structure - this capability is of considerable interest in synthetic biology and drug discovery. An attentional policy network is introduced to learn the decision rules for a dynamic, fragment-based chemical environment, and state-of-the-art policy gradient techniques are employed to train the network with stability. Exploration is driven by the stochasticity of the action space design and the innovation reward bonuses learned and proposed by random network distillation. In experiments, our framework achieved outstanding results compared to state-of-the-art algorithms, while reducing the complexity of paths to chemical synthesis.

Wu, Y↗