Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network robustness”

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 199 records · Page 11

Robust system size reduction of discrete fracture networks: a multi-fidelity method that preserves transport characteristics

In this paper, we propose a multi-fidelity system reduction technique that uses weighted graphs paired with three-dimensional discrete fracture network (DFN) modelling for efficient simulation of subsurface flow and transport in fractured media. DFN models are used to simulate flow and transport in subsurface fractured rock with low-permeability. One method to alleviate the heavy computational overhead associated with these simulations is to reduce the size of the DFN using a graph representation of it to identify the primary flow sub-network and only simulate flow and transport thereon. The first of these methods used unweighted graphs constructed solely on DFN topology and could be used for accurate predictions of first-passage times. However, these techniques perform poorly when predicting later stages of the mass breakthrough. We utilize a weighted-graph representation of the DFN where edge weights are based on hydrological parameters in the DFN that allows us to exploit the kinematic quantities derivable a posteriori from the flow solution obtained on the graph representation of the DFN to perform system reduction and predict the later stages of the breakthrough curve with high fidelity. We also propose and demonstrate the use of an adaptive pruning algorithm with error control that produces a pruned DFN sub-network whose predicted mass breakthrough agrees with the original DFN within a user-specified tolerance. Lastly, the method allows for the level of accuracy to be a user-controlled parameter.

58 GEOSCIENCES↗

Optimal Power Flow With State Estimation in the Loop for Distribution Networks

Here in this article, we propose a framework for running optimal control-estimation synthesis in distribution networks. Our approach combines a primal-dual gradient-based optimal power flow solver with a state estimation feedback loop based on a limited set of sensors for system monitoring, instead of assuming exact knowledge of all states. The estimation algorithm reduces uncertainty on unmeasured grid states based on certain online state measurements and noisy "pseudomeasurements." We analyze the convergence of the proposed algorithm and quantify the statistical estimation errors based on a weighted least-squares estimator. The numerical results on a 4521-node network demonstrate that this approach can scale to extremely large networks and provide robustness to both large pseudomeasurement variability and inherent sensor measurement noise.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Precise Point Positioning for the Efficient and Robust Analysis of GPS Data From Large Networks

Networks of dozens to hundreds of permanently operating precision Global Positioning System (GPS) receivers are emerging at spatial scales that range from 10(exp 0) to 10(exp 3) km. To keep the computational burden associated with the analysis of such data economically feasible, one approach is to first determine precise GPS satellite positions and clock corrections from a globally distributed network of GPS receivers. Then, data from the local network are analyzed by estimating receiver specific parameters with receiver-specific data; satellite parameters are held fixed at their values determined in the global solution. This "precise point positioning" allows analysis of data from hundreds to thousands of sites every day with 40 Mflop computers, with results comparable in quality to the simultaneous analysis of all data. The reference frames for the global and network solutions can be free of distortion imposed by erroneous fiducial constraints on any sites.

Zumberge, J. F.↗

Precise Point Positioning for the Efficient and Robust Analysis of GPS Data from Large Networks

Networks of dozens to hundreds of permanently operating precision Global Positioning System (GPS) receivers are emerging at spatial scales that range from 10(exp 0) to 10(exp 3) km. To keep the computational burden associated with the analysis of such data economically feasible, one approach is to first determine precise GPS satellite positions and clock corrections from a globally distributed network of GPS receivers. Their, data from the local network are analyzed by estimating receiver- specific parameters with receiver-specific data satellite parameters are held fixed at their values determined in the global solution. This "precise point positioning" allows analysis of data from hundreds to thousands of sites every (lay with 40-Mflop computers, with results comparable in quality to the simultaneous analysis of all data. The reference frames for the global and network solutions can be free of distortion imposed by erroneous fiducial constraints on any sites.

Zumberge, J. F.↗

Ecologically inspired metrics for transitioning to a sustainable and resilient circular economy with application to multilayer plastic films

Current Circular Economy (CE) frameworks applied to product chains exhibit notable shortcomings. These include neglecting the resilience and robustness of design, requiring detailed economic and environmental data for impact assessment, and relying on qualitative rather than quantitative metrics capturing certain CE design aspects. In the current contribution, we addressed these shortcomings by developing an Ecologically inspired (Eco-inspired) Framework using the mathematical foundations of Ecological Network Analysis (ENA). While ENA metrics have previously found application in designing circular economies, particularly in Industrial Symbiosis (IS) networks, our adaptation tailors these metrics for use in product-level CE, recognizing the inherent distinctions between product-level CE and IS. Our Eco-inspired Framework comprises three key categories to provide holistic and granular-level metrics for designing product-level CE. The first set of metrics assesses circularity and resource efficiency. The second set gauges network intensity and robustness as complementary indicators ensuring a CE is both sustainable and resilient. The third group of metrics evaluates enhancement potential of CE strategies through introducing quantitative metrics for measuring the degree of closed-loop strategies and average circularity level of a CE design. The three comprehensive set of indicators within the Eco-inspired Framework uniquely captures various facets of circular design, whether originating from technological innovations and recovery improvement at the end of life (EoL), shifts in human consumption patterns, alterations in product design, or changes in business models. The framework’s application is tested in designing a CE for multilayer Polyethylene-Polyamide (PE-PA) films. Using the Eco-inspired Framework, we identified the best strategy for designing a resilient and sustainable CE for PE-PA films. A diverse set of EoL strategies along with a reduction in product consumption can improve circularity and resilience by 650% and 255%, respectively, and mitigate greenhouse gas emissions by 90%. The framework minimizes trade-offs between sustainability and circularity goals and offers insights on how to enhance each strategy for achieving a resilient and sustainable CE for products.

54 ENVIRONMENTAL SCIENCES↗

Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem

This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.

Adam P. Herrmann↗

CNES-NASA Disruption-Tolerant Networking (DTN) Interoperability

Future missions requiring robust internetworking services may use Delay-Disruption-Tolerant Networking (DTN) technology. CNES, NASA, and other international space agencies are committed to using CCSDS standards in their space and ground mission communications systems. The experiment described in this presentation will evaluate operations concepts, system performance, and advance technology readiness for the use of DTN protocols in conjunction with CCSDS ground systems, CCSDS data links, and CCSDS file transfer applications

experiment design↗

Early Alarm: Robust Event Analysis for Power Systems using 1-D Fully Convolutional Network

This work presents a novel deep learning model for early, accurate, and robust detection, recognition, and temporal localization of multi-type events in large-scale power systems. The proposed method develops a unified 1-D fully convolutional network (FCN) model that takes time series of raw frequency signals measured from a power system as input, extracts distinguishing features, and predicts at every temporal point in the time series if an event is happening and what the type of the event is. Compared to existing methods, the proposed model eliminates the necessity for hand-crafted feature extraction or complicated data pre-processing, can flexibly handle input signals of arbitrary length, and precisely infer the event occurrence time. Most importantly, the model is intentionally trained with incomplete patterns, such that it is more robust to partial features of an event which is common in real-world online recognition, resulting in early alarm for power system failures. Extensive experimental results demonstrate that the proposed method achieves superior performance to the state-of-the-art, and also shows strong robustness to noise and system oscillations.

Li, Chengcheng↗

Dynamics of virtual water networks: Role of national socio-economic indicators across the world

Intensified water usage due to rapid industrialization is often dictated by economic policies based on monetary growth rather than sustainable use of environmental resources. In addition, interdependence within economic sectors further interweaves water usage through product transactions, which further makes it difficult to quantify the dynamics of hydro-economic systems at regional, national and global scale. In this study, we investigated the dynamics of domestic virtual water networks (VWN) of 189 countries based on concept of information theory by quantifying network metrics that describes VWN flow capacity, robustness, efficiency and flexibility. These networks represent virtual water interconnected through economic sectors within a specified country built based on environmentally extended multi region input output (EE-MRIO) approach. We further estimated trends associated with network metrics, as well as coupling intensity between metrics with respect to socio-economic indicators, such as, population, Gross Domestic Product (GDP) and Gross National Income (GNI). It was observed that capacity and flexibility of VWNs are strongly and positively correlated indicating that a high capacity VWN can be more flexible. Our results also indicate that, in general a higher percentage of developing countries (i.e. both least developing and developing nations) have exhibited increasing trends in capacity, robustness, efficiency and flexibility of VWN compared to developed nations. It was revealed that the dynamics of VWNs are positively coupled with socio-economic growth for few countries, which indicates the sustainable behavior of VWN with socio-economic growth. Our results argue that the information theory-based metrics by embedding water footprints can holistically capture sustainability aspect of the VWN dynamics.

54 ENVIRONMENTAL SCIENCES↗

Robust, automated sleep scoring by a compact neural network with distributional shift correction

Studying the biology of sleep requires the accurate assessment of the state of experimental subjects, and manual analysis of relevant data is a major bottleneck. Recently, deep learning applied to electroencephalogram and electromyogram data has shown great promise as a sleep scoring method, approaching the limits of inter-rater reliability. As with any machine learning algorithm, the inputs to a sleep scoring classifier are typically standardized in order to remove distributional shift caused by variability in the signal collection process. However, in scientific data, experimental manipulations introduce variability that should not be removed. For example, in sleep scoring, the fraction of time spent in each arousal state can vary between control and experimental subjects. We introduce a standardization method, mixture z-scoring, that preserves this crucial form of distributional shift. Using both a simulated experiment and mouse in vivo data, we demonstrate that a common standardization method used by state-of-the-art sleep scoring algorithms introduces systematic bias, but that mixture z-scoring does not. We present a free, open-source user interface that uses a compact neural network and mixture z-scoring to allow for rapid sleep scoring with accuracy that compares well to contemporary methods. This work provides a set of computational tools for the robust automation of sleep scoring.

60 APPLIED LIFE SCIENCES↗

A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks

Machine learning algorithms are heavily relied on to understand the vast amounts of data from high-energy particle collisions at the CERN Large Hadron Collider (LHC). The data from such collision events can naturally be represented with graph structures. Therefore, deep geometric methods, such as graph neural networks (GNNs), have been leveraged for various data analysis tasks in high-energy physics. One typical task is jet tagging, where jets are viewed as point clouds with distinct features and edge connections between their constituent particles. The increasing size and complexity of the LHC particle datasets, as well as the computational models used for their analysis, have greatly motivated the development of alternative fast and efficient computational paradigms such as quantum computation. In addition, to enhance the validity and robustness of deep networks, we can leverage the fundamental symmetries present in the data through the use of invariant inputs and equivariant layers. In this paper, we provide a fair and comprehensive comparison of classical graph neural networks (GNNs) and equivariant graph neural networks (EGNNs) and their quantum counterparts: quantum graph neural networks (QGNNs) and equivariant quantum graph neural networks (EQGNN). The four architectures were benchmarked on a binary classification task to classify the parton-level particle initiating the jet. Based on their area under the curve (AUC) scores, the quantum networks were found to outperform the classical networks. However, seeing the computational advantage of quantum networks in practice may have to wait for the further development of quantum technology and its associated application programming interfaces (APIs).

Forestano, Roy T. (ORCID:0000000203552076)↗

NNREPAIR: Constraint-based Repair of Neural Network Classifiers

We present NNREPAIR, a constraint-based technique for repairing neural network classifiers by i) fixing the logic of the network at an intermediate layer, and ii) fixing the decision conditions of the network at the last layer. NNREPAIR first uses fault localization to find potentially faulty network parameters (specifically weights) and then performs repair using constraint solving to apply small modifications to remedy the defects. We present novel strategies to enable precise yet efficient repair such as inferring correctness specifications to act as oracles for intermediate layer repair, and generation of experts wrt each class. We demonstrate the technique in the context of three different scenarios: (1) Improving the over all accuracy of a model, (2) Fixing security vulnerabilities caused by poisoning of training data and (3) Improving the robustness of the network against adversarial attacks. Our evaluation on MNIST and CIFAR-10 models shows that NNREPAIR can improve the accuracy by 45.56% on poisoned data and 11.11% on adversarial data. NNREPAIR also provides improvement, albeit modest, in the overall accuracy of models, without requiring new data or re-training.

Repair↗

Resilient Autonomous Wind Farms: Preprint

With the advent of an increasing number of control strategies that seek to optimize wind turbine performance on a farm-level, taking account of individual wind turbine information to achieve wind farm-level objectives has become an increasingly important goal. Methods for controlling wind turbines on an individual and farm level have seen significant development, and an abundance of new implementations for gathering and using data from turbines have created potential for novel control mechanisms which can further optimize the performance and delivery characteristics of a wind farm. A key element of making these wind farms more efficient is to develop reliable algorithms that use local sensor information that is already being collected, such as supervisory control and data acquisition (SCADA) data, local meteorological stations, and nearby radars/sodars/lidars. Making use of information from all wind turbines in a wind farm can enable such approaches as determining the atmospheric conditions across the farm, improving fault-finding, and enabling more efficient overall control of farm-wide optimizations through mechanisms such as wake-steering. However, these approaches typically involve a centralized communications and control center. In order to ensure the resilient operation of the farm, it is necessary to develop an approach which distributes the calculation and communication amongst multiple nodes throughout the farm. In this fashion, a redundant, robust, and secure network can be created, which can tolerate faults in calculation, communication, and even external attacks which seek to disrupt the operation of the wind farm. This paper introduces the use of the Raft Byzantine Fault Tolerance algorithm in the implementation of autonomous control of a wind farm. This implementation will allow for fault tolerance for malfunctioning nodes, sensors, transmitters, and connectors. This approach is equally extensible to account for malicious actors. It will be shown to achieve overall consensus, provided the number of faults/malicious nodes is less than 3$n$+1, where $n$ is the number of turbine cluster faults which may occur, and to be robust in the face of multiple arbitrary faults.

autonomous↗

Robust Operation of Soft Open Points in Active Distribution Networks with High Penetration of Photovoltaic Integration

Distributed generators (DGs) including photovoltaic panels (PVs) have been integrated dramatically in active distribution networks (ADNs). Due to the strong volatility and uncertainty, the high penetration of PV generation immensely exacerbates the conditions of voltage violation in ADNs. However, the emerging flexible interconnection technology based on soft open points (SOPs) provides increased controllability and flexibility to the system operation. For fully exploiting the regulation ability of SOPs to address the problems caused by PV, this paper proposes a robust optimization method to achieve the robust optimal operation of SOPs in ADNs. A two-stage adjustable robust optimization model is built to tackle the uncertainties of PV outputs, in which robust operation strategies of SOPs are generated to eliminate the voltage violations and reduce the power losses of ADNs. A column-and-constraint generation (C&CG) algorithm is developed to solve the proposed robust optimization model, which are formulated as second-order cone program (SOCP) to facilitate the accuracy and computation efficiency. Here, case studies on the modified IEEE 33-node system and comparisons with the deterministic optimization approach are conducted to verify the effectiveness and robustness of the proposed method.

14 SOLAR ENERGY↗