Results for “network performance evaluation” — Page 42

DOE OSTI2024

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗

DOE OSTI2024

Advancing Cyber-Attack Detection in Power Systems: A Comparative Study of Machine Learning and Graph Neural Network Approaches

This paper explores the detection and localization of cyber-attacks on power systems, focusing on comparing conventional machine learning (ML) and deep learning methods, and graph neural network (GNN)-based techniques. We assess the detection accuracy of these approaches and their potential to pinpoint the locations of specific buses under attack. Given the demonstrated success of GNNs in other time series anomaly detection applications, we aim to evaluate their performance within the context of power systems cyber-attack. Utilizing the IEEE 68-bus system, we simulated four types of attacks to test the selected approaches. Our results indicate that GNN-based methods outperform conventional machine learning and deep learning models in detection. Additionally, GNNs show promise in accurately localizing attacks for simple scenarios, although they still face challenges in more complex cases.

artificial intelligence↗

DOE OSTI2023

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗

DOE OSTI2021

Graph Convolutional Network-Based Topology Embedded Deep Reinforcement Learning for Voltage Stability Control

Topological variations in power system is a common phenomenon and can impose significant challenges to traditional controllers of power system. Recent study revealed the strength of deep reinforcement learning (DRL) based approaches in power system preventive and corrective control. But topological variations are difficult to capture using classical fully connected neural network (FCN) model and has not been explicitly modeled in previous work. Hence, we develop a Graph Convolutional Network (GCN) based DRL framework to tackle topology changes in control design of power system. The GCN model exploits the graph structure of the power network and helps the DRL agent to embed the topology information during learning process. Our GCN based approach is evaluated using the IEEE-39 bus system and it outperforms the FCN-based DRL scheme in terms of training convergence and control performance considering grid topology changes.

Hossain, Ramij Raja↗

DOE OSTI2022

A Novel Approach for Real-Time Quality Monitoring in Machining of Aerospace Alloy through Acoustic Emission Signal Transformation for DNN

Gamma titanium aluminide (γ-TiAl) is considered a high-performance, low-density replacement for nickel-based superalloys in the aerospace industry due to its high specific strength, which is retained at temperatures above 800 °C. However, low damage tolerance, i.e., brittle material behavior with a propensity to rapid crack propagation, has limited the application of γ-TiAl. Any cracks introduced during manufacturing would dramatically lower the useful (fatigue) life of γ-TiAl components, making the workpiece surface’s quality from finish machining a critical component to product quality and performance. To address this issue and enable more widespread use of γ-TiAl, this research aims to develop a real-time non-destructive evaluation (NDE) quality monitoring technique based on acoustic emission (AE) signals, wavelet transform, and deep neural networks (DNN). Previous efforts have opted for traditional approaches to AE signal analysis, using statistical feature extraction and classification, which face challenges such as the extraction of good/relevant features and low classification accuracy. Hence, this work proposes a novel AI-enabled method that uses a convolutional neural network (CNN) to extract rich and relevant features from a two-dimensional image representation of 1D time-domain AE signals (known as scalograms), subsequently classifying the AE signature based on pedigreed experimental data and finally predicting the process-induced surface quality. The results of the present work show good classification accuracy of 80.83% using scalogram images, in-situ experimental data, and a VGG-19 pre-trained neural network, establishing the significant potential for real-time quality monitoring in manufacturing processes.

36 MATERIALS SCIENCE↗

NASA NTRS1999

Darwinian Spacecraft: Soft Computing Strategies Breeding Better, Faster Cheaper

Computers can create infinite lists of combinations to try to solve a particular problem, a process called "soft-computing." This process uses statistical comparables, neural networks, genetic algorithms, fuzzy variables in uncertain environments, and flexible machine learning to create a system which will allow spacecraft to increase robustness, and metric evaluation. These concepts will allow for the development of a spacecraft which will allow missions to be performed at lower costs.

Noever, David A.↗

NASA NTRS2019

Overview of the Communications and Intelligent Systems Division at the NASA Glenn Research Center

NASA's plans for advancing aeronautics and space exploration requires optimization of current capabilities and development of new ones to support its mission. A key requirement associated with these efforts is the constant upgrading and optimization of communication systems. This presentation will provide a brief overview of NASA efforts, with emphasis on those being performed at the NASA Glenn Research Center, to develop communications technologies and systems in support of NASA aerospace communications needs. Status of specific technology examples in the area of cognitive communication systems, Advanced RF Technologies, Networks, and Systems Architectures will be presented and their impact in the overall scheme of needs will be discussed. In addition, cross- cutting technologies which enable sensing, control and communications technologies to perform in extreme environments as well as non-destructive evaluations techniques for vehicle health monitoring and related purposes will be presented.

Miranda, Felix A.↗

NASA NTRSDate not supplied

Models for Facilitating Government-Funded Activities in the Post-ISS LEO Ecosystem

NASA is preparing for the retirement of the ISS and transition of LEO activities to one or more Commercial LEO Destinations (CLDs) by 2030. This transition necessitates new models for connecting NASA and other government-funded users of the LEO environment to platforms and opportunities. This paper describes for consideration six models for facilitating government-funded activities in the post-ISS LEO ecosystem. These six models are illustrative and represent a wide trade space of potential options, each relying on unique mechanisms for facilitating activities on one or more commercial LEO platforms or vehicles. We assessed each model across three possible future scenarios varying in number and diversity of LEO activities and commercial offerings, and across five stakeholder-driven model evaluation criteria. We present the highlights of the analysis, including ways to modify and strengthen each model. The Government Research Broker model performs best across all future scenarios, followed by Innovation Campus, Anchor Tenant, and Fee for Service. While Matchmaker and Institute Network exhibit positive aspects, these models perform most favorably in future scenarios with well-established communities and markets. While each model has strengths and weaknesses, no single model in its current form performs well across all criteria in all three future scenarios. NASA leadership can adjust models as desired to align closer to their priorities using combinations of unique model mechanisms. A model that meets leadership priorities is likely a combination of features from multiple models.

Erica Rodgers↗

NASA NTRSDate not supplied

Models for Facilitating Government-Funded Activities in the Post-ISS LEO Ecosystem

NASA is preparing for the retirement of the ISS and transition of LEO activities to one or more Commercial LEO Destinations (CLDs) by 2030. This transition necessitates new models for connecting NASA and other government-funded users of the LEO environment to platforms and opportunities. This paper describes for consideration six models for facilitating government-funded activities in the post-ISS LEO ecosystem. These six models are illustrative and represent a wide trade space of potential options, each relying on unique mechanisms for facilitating activities on one or more commercial LEO platforms or vehicles. We assessed each model across three possible future scenarios varying in number and diversity of LEO activities and commercial offerings, and across five stakeholder-driven model evaluation criteria. We present the highlights of the analysis, including ways to modify and strengthen each model. The Government Research Broker model performs best across all future scenarios, followed by Innovation Campus, Anchor Tenant, and Fee for Service. While Matchmaker and Institute Network exhibit positive aspects, these models perform most favorably in future scenarios with well-established communities and markets. While each model has strengths and weaknesses, no single model in its current form performs well across all criteria in all three future scenarios. NASA leadership can adjust models as desired to align closer to their priorities using combinations of unique model mechanisms. A model that meets leadership priorities is likely a combination of features from multiple models.

Erica Rodgers↗

NASA NTRSDate not supplied

Models for Facilitating Government-Funded Activities in the Post-ISS LEO Ecosystem

NASA is preparing for the retirement of the ISS and transition of LEO activities to one or more Commercial LEO Destinations (CLDs) by 2030. This transition necessitates new models for connecting NASA and other government-funded users of the LEO environment to platforms and opportunities. This paper describes for consideration six models for facilitating government-funded activities in the post-ISS LEO ecosystem. These six models are illustrative and represent a wide trade space of potential options, each relying on unique mechanisms for facilitating activities on one or more commercial LEO platforms or vehicles. We assessed each model across three possible future scenarios varying in number and diversity of LEO activities and commercial offerings, and across five stakeholder-driven model evaluation criteria. We present the highlights of the analysis, including ways to modify and strengthen each model. The Government Research Broker model performs best across all future scenarios, followed by Innovation Campus, Anchor Tenant, and Fee for Service. While Matchmaker and Institute Network exhibit positive aspects, these models perform most favorably in future scenarios with well-established communities and markets. While each model has strengths and weaknesses, no single model in its current form performs well across all criteria in all three future scenarios. NASA leadership can adjust models as desired to align closer to their priorities using combinations of unique model mechanisms. A model that meets leadership priorities is likely a combination of features from multiple models.

Erica Rodgers↗

NASA NTRS2026

Benchmarking Bayesian Optimization Frameworks and Acquisition Strategies for Materials Discovery and Autonomous Laboratories

Bayesian optimization (BO) can accelerate materials discovery by guiding expensive experiments toward the most promising processing conditions. We systematically compare five BO surrogate and framework combinations (Gaussian processes in Ax, Gaussian processes and Monte-Carlo neural networks in BayBE, random forests in Lolopy, and tree-structured Parzen (TPE) estimators in Hyperopt) on three benchmarks that mimic common materials design tasks (a discrete solid-electrolyte composition space, a hybrid discrete/continuous laminate-composite design problem solved with micromechanics modeling, and the continuous Ishigami analytic function which is a standard optimization benchmark). Each BO surrogate is paired with posterior mean, probability of improvement, and expected improvement acquisition functions and run for 100 trials from randomized initial samples with uniform random search providing a control. Across five random seeds per setting, BayBE’s Gaussian-process surrogate with expected improvement consistently reached ≥95 % of the known optimum in the fewest evaluations, while Lolopy’s random forest matched or exceeded GP performance on purely categorical or mixed spaces at a higher computational cost. Posterior mean alone often stagnated at local optima, underscoring the need for exploration, whereas probability and expected improvement balanced exploration and exploitation leading to better optimization in fewer trials. Execution times ranged from milliseconds for TPE to minutes for neural-network and random-forest surrogates. These results establish baseline expectations for BO in automated materials laboratories and highlight expected improvement with Gaussian processes as a reliable first choice, with random forests offering a strong alternative when categorical variables dominate. The benchmark suite and code are released to facilitate future surrogate, acquisition, and constraint-handling research in data-driven materials optimization.

Bayesian optimization↗

NASA NTRS1993

A Report on Stochastic Fairness Queueing (SFQ) Experiments

SRI International (SRI) has developed an improved queueing algorithm, known as Stochastic Fairness Queueing (SFQ), for best-effort traffic (i.e., traffic that does not require any guaranteed service). SFQ is a probablistic variant of strict fair queueing where instead of a single queue being allocated per flow, a fixed number of queues are used and a hash function maps the IP source and destination to a particular queue. A seed to the hash function is also perturbed occasionally to help distribute the flows amongst different queues when more than one flow maps to the same queue during the lifetime of the flow. SFQ provides 'fair' access by trying to ensure that each flow from source to destination host obtains equal access to the available bandwidth. This report covers a series of experiments performed on DARTnet evaluating the behavior and performance of SFQ against a FIFO queueing discipline. These experiments were designed to show SFQ's advantages and performance, and include tests demonstrating: Fair utilization of available resources; Starvation prevention; Graceful degradation under overload conditions; and Resource usage. In general, the experiments do show that SFQ is better than FIFO queueing at allocating bandwidth equally among a set of flows. SFQ also prevents a stream from dominating the available bandwidth, which seems to be a tendency with FIFO queueing (i.e., if a flow demands more than its share of the available bandwidth, with FIFO queueing that stream receives a disproportionate amount when compared to flows demanding less than their share). Furthermore, SFQ seems to reward 'nice' users of the network by providing a lower variance in delay and more throughput when their resource demand is less than their available share. Both SFQ and FIFO queueing seem to degrade fairly well as the network becomes saturated and to recover well as the network becomes less congested. Not unexpectedly, FIFO queueing is a little more efficient than SFQ-the delays are less and the throughput slightly higher because SFQ requires more processing. However, the performance difference between the two queueing disciplines is relatively small. However, the experiments do point out some interesting behavior. FIFO queueing can behave better than SFQ with seed perturbation. We recommend further evaluation of the hash function and the seed perturbation technique. There are probably weaknesses in their current selection that cause this unexpected behavior. SFQ also seems to possess good scaling properties. To verify this, more experiments with a larger number of streams from more hosts need to be executed and examined, including the staggered introduction of streams. Staggering the streams may prove important, because graphs in the degradation experiment revealed some unexpected increases and decreases in throughput, which should be examined. This may again be due to the interaction of the hash function with the seed perturbation but it may also be related to some other unknown problem.

Denny, Barbara A.↗

DOE OSTI2020

Benchmarking materials property prediction methods: the Matbench test set and Automatminer reference algorithm

Abstract We present a benchmark test suite and an automated machine learning procedure for evaluating supervised machine learning (ML) models for predicting properties of inorganic bulk materials. The test suite, Matbench, is a set of 13 ML tasks that range in size from 312 to 132k samples and contain data from 10 density functional theory-derived and experimental sources. Tasks include predicting optical, thermal, electronic, thermodynamic, tensile, and elastic properties given a material’s composition and/or crystal structure. The reference algorithm, Automatminer, is a highly-extensible, fully automated ML pipeline for predicting materials properties from materials primitives (such as composition and crystal structure) without user intervention or hyperparameter tuning. We test Automatminer on the Matbench test suite and compare its predictive power with state-of-the-art crystal graph neural networks and a traditional descriptor-based Random Forest model. We find Automatminer achieves the best performance on 8 of 13 tasks in the benchmark. We also show our test suite is capable of exposing predictive advantages of each algorithm—namely, that crystal graph methods appear to outperform traditional machine learning methods given ~10 4 or greater data points. We encourage evaluating materials ML algorithms on the Matbench benchmark and comparing them against the latest version of Automatminer.

36 MATERIALS SCIENCE↗

NASA NTRSDate not supplied

Document Classification Techniques for Aviation Letters of Agreement

Often when working with technical documents, it is helpful to classify them into specific categories. In this paper, we conduct a thorough review of natural language processing techniques to perform this classification task on Letters of Agreement (LOAs), technical aviation documents outlining rules for utilizing US airspace. We evaluate multiple techniques, including Transfer Learning, for representing the text in the documents as embeddings: unigram and bigram Term Frequency Inverse Document Frequency (TFIDF), Word2Vec, Doc2Vec, GloVe and RoBERTa. We investigate a wide range of classification models: K-Nearest Neighbors, Random Forest, Support Vector Machines (SVM), Logistic Regression, Naive Bayes, Feed-Forward Neural Network, Convolutional Neural Networks (CNNs) and Long-Short Term Memory (LSTM). By comparing the different methods, we found the best overall approach for our task was to use unigram TFIDF representations with SVM while also gaining insight into how the other methodologies performed on a small technical datasets.

Aayushi Batra↗

NASA NTRS1985

Performance evaluation of a simulated data-flow computer with low-resolution actors

Basic problems related to the exploitation of parallelism in a program include sequencing of the instructions and communication of the data. It is pointed out that the data-flow approach offers an elegant solution to the sequencing problem, since all data dependencies are automatically handled and only instructions with ready input sets are activated. It is shown that a change in the level of subcomputations (actors) affects communications costs. The concept of variable resolution is discussed, and the testbed environment is examined. Attention is given to the architecture of the processing elements, the communication network, and the simulators. A description of the analytical model is also provided. Simulation and results are discussed, taking into account test programs and allocation, the variation of the number of processing elements, the variation of the resolution in directed acyclic graphs, performance in processing loops, and array handling.

Gaudiot, J. L.↗

DOE OSTI2026

Active Learning‐Driven Inkless Additive Nanomanufacturing for Printed Electronics

Inkless additive nanomanufacturing for printed electronics promises broad material and substrate versatility, yet the high-dimensional print parameter space makes tuning print parameters time-intensive. We present a Bayesian optimization study that constructs a digital twin from printed-silver data to benchmark surrogate models, acquisition functions, and batch sizes head-to-head to achieve user-specified target resistance. Tested surrogate models included Gaussian process, random forest, and Bayesian neural network surrogates with expected improvement and confidence bound acquisition functions. In total, we evaluate 48 unique model configurations alongside a random sampling baseline for comparison. For printed silver, the Bayesian neural network with a batch size of one achieved the lowest average cumulative regret, approximately four times more efficient on average than random sampling. To balance performance and substrate space, a random forest model with expected improvement and a batch size of four was chosen as the model for validation testing. Applying this chosen configuration to copper with an additional print parameter, the model achieved a resistance within 0.15 Ω of a 1 Ω target in fewer than 30 printed lines across five validation sets. Altogether, the workflow yields a tuned and validated model that efficiently guides experiments toward the target while simultaneously learning the parameter space.

Bevel, Colton [Auburn University, AL (United State↗

NASA NTRS1994

Telecommuting (Work-At-Home) at NASA Lewis Research Center

This report presents a study in evaluating the viability of providing a work-at-home (telecommuting) program for Lewis Research Center's corporate employees using Integrated Services Digital Network (ISDN). Case studies have been presented for a range of applications from casual data access to interactive access. The network performance of telemedia applications were studied against future requirements for such level of remote connectivity. Many of the popular ISDN devices were characterized for network and service functionality. A set of recommendations to develop a telecommuting policy have been proposed.

Srinidhi, Saragur M.↗

NASA NTRS1994

A simple hyperbolic model for communication in parallel processing environments

We introduce a model for communication costs in parallel processing environments called the 'hyperbolic model,' which generalizes two-parameter dedicated-link models in an analytically simple way. Dedicated interprocessor links parameterized by a latency and a transfer rate that are independent of load are assumed by many existing communication models; such models are unrealistic for workstation networks. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes that initiate the sending and receiving of the information and in which internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. The direction of graph edges specifies the flow of the information carried through messages. Each CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. The parameters are evaluated in the limits of very large and very small messages. Rules are given for reducing a communication graph consisting of many to an equivalent two-parameter form, while maintaining an approximation for the service time that is exact in both large and small limits. The model is validated on a dedicated Ethernet network of workstations by experiments with communication subprograms arising in scientific applications, for which a tight fit of the model predictions with actual measurements of the communication and synchronization time between end processes is demonstrated. The model is then used to evaluate the performance of two simple parallel scientific applications from partial differential equations: domain decomposition and time-parallel multigrid. In an appropriate limit, we also show the compatibility of the hyperbolic model with the recently proposed LogP model.

Stoica, Ion↗