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 469 records · Page 26

Document Classification Techniques for Aviation Letters of Agreement

Often when working with historic air traffic management (ATM) 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 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.

ATM↗

Synthetic High Impedance Fault Data through Deep Convolutional Generated Adversarial Network

High impedance faults (HIFs) have always been significant challenge in the power grids. Researchers have developed some advanced protective methods to detect the HIFs. To test and validate these methods, large amounts of HIF data are required. This paper presents a synthetic HIF data generating method using the deep convolutional generated adversarial network (DCGAN). The DCGAN includes a generator module to create synthetic HIF waveform from random noises; and a discriminator module to identify the flaws of those synthetic data, which ultimately help improve the quality of the synthetic data created by the generator. To test the fidelity of the generated synthetic HIF data, two different HIF-detection methods have been applied. Extensive simulation results have validated the effectiveness of using the DCGAN to create synthetic HIF data.

Yang, Kun↗

Harnessing ML Privacy by Design Through Crossbar Array Non-idealities

Deep Neural Networks (DNNs), handling computeand data-intensive tasks, often utilize accelerators like Resistiveswitching Random-access Memory (RRAM) crossbar for energyefficient in-memory computation. Despite RRAM’s inherent nonidealities causing deviations in DNN output, this study transforms the weakness into strength. By leveraging RRAM non-idealities, the research enhances privacy protection against Membership Inference Attacks (MIAs), which reveal private information from training data. RRAM non-idealities disrupt MIA features, increasing model robustness and revealing a privacy-accuracy tradeoff. Empirical results with four MIAs and DNNs trained on different datasets demonstrate significant privacy leakage reduction with a minor accuracy drop (e.g., up to 2.8% for ResNet-18 with CIFAR-100).

artificial intelligence↗

Machine Learning for Predicting Multipactor Susceptibility in Planar RF Structures

Multipactor discharge is a persistent challenge in high-power microwave (HPM) and accelerator systems, where secondary electron avalanches can cause heating, vacuum degradation, and failure. This work presents the first supervised machine learning (ML) framework for multipactor prediction, trained on high-fidelity 3D Particle-in-Cell (PIC) simulation data in planar geometries. The model maps operational, geometric, and material-dependent secondary electron yield (SEY) parameters to the time-averaged electron growth rate, enabling rapid reconstruction of susceptibility charts. Among the models evaluated, tree-based ensemble methods such as Random Forest and Extra Trees demonstrate superior generalization to unseen materials compared to neural networks such as multilayer perceptron (MLP). Performance metrics, including Intersection over Union (IoU), Structural Similarity Index Measure (SSIM), and Pearson correlation, show close agreement with simulation benchmarks. Principal Component Analysis attributes generalization limits to material feature-space disjointedness.

43 PARTICLE ACCELERATORS↗

User Manual for GERT EXCLUSIVE-OR Program

This report describes the procedures for using digital computer programs for analyzing GERT networks which contain nodes of the EXCLUSIVE-OR type and branches which have both a probability and a time associated with them. The time associated with a branch can be a random variable. The program calculates the probability, the expected time and the variance in the time to go from each source node of the GERT network to each sink node. Programs have been written in FORTRAN II and FORTRAN IV and have been exercised on the IBM 1130, GE 225 and CDC 3400 computers. This report details the operating procedures for using these programs. Four examples are included to illustrate the important facets involved in using the programs. Special options included in the program are: (1) printout of all loops and paths associated with the network; and (2) deletion of loops that have a probability of occurrence less than a value specified by the user. The program described in this report has been submitted to COSMIC.

Ishmael, Phillip C.↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

From biological neural networks to thinking machines: Transitioning biological organizational principles to computer technology

The three-dimensional organization of the vestibular macula is under study by computer assisted reconstruction and simulation methods as a model for more complex neural systems. One goal of this research is to transition knowledge of biological neural network architecture and functioning to computer technology, to contribute to the development of thinking computers. Maculas are organized as weighted neural networks for parallel distributed processing of information. The network is characterized by non-linearity of its terminal/receptive fields. Wiring appears to develop through constrained randomness. A further property is the presence of two main circuits, highly channeled and distributed modifying, that are connected through feedforward-feedback collaterals and biasing subcircuit. Computer simulations demonstrate that differences in geometry of the feedback (afferent) collaterals affects the timing and the magnitude of voltage changes delivered to the spike initiation zone. Feedforward (efferent) collaterals act as voltage followers and likely inhibit neurons of the distributed modifying circuit. These results illustrate the importance of feedforward-feedback loops, of timing, and of inhibition in refining neural network output. They also suggest that it is the distributed modifying network that is most involved in adaptation, memory, and learning. Tests of macular adaptation, through hyper- and microgravitational studies, support this hypothesis since synapses in the distributed modifying circuit, but not the channeled circuit, are altered. Transitioning knowledge of biological systems to computer technology, however, remains problematical.

Ross, Muriel D.↗

A conserved gene regulatory network controls root epidermal cell patterning in superrosid species

Summary In superrosid species, root epidermal cells differentiate into root hair cells and nonhair cells. In some superrosids, the root hair cells and nonhair cells are distributed randomly (Type I pattern), and in others, they are arranged in a position‐dependent manner (Type III pattern). The model plant Arabidopsis ( Arabidopsis thaliana ) adopts the Type III pattern, and the gene regulatory network (GRN) that controls this pattern has been defined. However, it is unclear whether the Type III pattern in other species is controlled by a similar GRN as in Arabidopsis, and it is not known how the different patterns evolved. In this study, we analyzed superrosid species Rhodiola rosea , Boehmeria nivea , and Cucumis sativus for their root epidermal cell patterns. Combining phylogenetics, transcriptomics, and cross‐species complementation, we analyzed homologs of the Arabidopsis patterning genes from these species. We identified R. rosea and B. nivea as Type III species and C. sativus as Type I species. We discovered substantial similarities in structure, expression, and function of Arabidopsis patterning gene homologs in R. rosea and B. nivea , and major changes in C. sativus . We propose that in superrosids, diverse Type III species inherited the patterning GRN from a common ancestor, whereas Type I species arose by mutations in multiple lineages.

59 BASIC BIOLOGICAL SCIENCES↗

Morphological Studies of Solution-Crystallized Thermoplastic Elastomers with Polyethylene Endblocks and a Random-Copolymer Midblock

Styrenic thermoplastic elastomers (TPEs) in the form of triblock copolymers possessing glassy endblocks and a rubbery midblock account for the largest global market of TPEs worldwide, and typically rely on microphase separation of the endblocks and the subsequent formation of rigid microdomains to ensure satisfactory network stabilization. In this work, the morphological characteristics of a relatively new family of crystallizable TPEs that instead consist of polyethylene endblocks and a random-copolymer midblock composed of styrene and (ethylene-co-butylene) moieties are investigated. Copolymer solutions prepared at logarithmic concentrations in a slightly endblock-selective solvent are subjected to crystallization under different time and temperature conditions to ascertain if copolymer self-assembly is directed by endblock crystallization or vice versa. According to transmission electron microscopy, semicrystalline aggregates develop at the lowest solution concentration examined (0.01 wt%), and the size and population of crystals, which dominate the copolymer morphologies, are observed to increase with increasing aging time. Real-space results are correlated with small- and wide-angle X-ray scattering to elucidate the concurrent roles of endblock crystallization and self-assembly of these unique TPEs in solution.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hybrid PDES Simulation of HPC Networks Using Zombie Packets

Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. Here, we present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.

HPC networks↗

The SIMRAND methodology: Theory and application for the simulation of research and development projects

A research and development (R&D) project often involves a number of decisions that must be made concerning which subset of systems or tasks are to be undertaken to achieve the goal of the R&D project. To help in this decision making, SIMRAND (SIMulation of Research ANd Development Projects) is a methodology for the selection of the optimal subset of systems or tasks to be undertaken on an R&D project. Using alternative networks, the SIMRAND methodology models the alternative subsets of systems or tasks under consideration. Each path through an alternative network represents one way of satisfying the project goals. Equations are developed that relate the system or task variables to the measure of reference. Uncertainty is incorporated by treating the variables of the equations probabilistically as random variables, with cumulative distribution functions assessed by technical experts. Analytical techniques of probability theory are used to reduce the complexity of the alternative networks. Cardinal utility functions over the measure of preference are assessed for the decision makers. A run of the SIMRAND Computer I Program combines, in a Monte Carlo simulation model, the network structure, the equations, the cumulative distribution functions, and the utility functions.

Miles, R. F., Jr.↗

Strategic Placement and Sizing of Distributed Generation for Resilience Enhancement of Distribution Grids With Microgrid Formation

The rise in frequency and severity of extreme weather events highlights the need for resilient power distribution networks. Microgrids can help improve the resilience of distribution grids by providing continuous power supply using local distribution generation (DG) when the distribution grid fails. In this paper, we propose an approach for optimal placement and sizing of DG to form multiple microgrids throughout the distribution network by restoration actions such as switching operations in case of distribution grid outages caused by extreme weather events. Considering the randomness of damaged distribution lines, the DG placement and sizing problem is formulated as a two-stage stochastic mixed-integer program, with the first stage determining the placement and size of DG, and the second stage focusing on minimizing the amount of load shedding through network restoration and microgrid formations for each scenario. Due to the large number of scenarios, the sample average approximation (SAA) method is employed to solve the problem. The results of case studies on a modified IEEE 33 bus distribution grid demonstrate the effectiveness of the proposed DG placement and sizing strategy in improving the resilience of distribution grids by allowing the formation of multiple microgrids. In addition, the robustness and accuracy of the SAA method are validated through various case studies.

Distributed generation planning↗

An Evaluation of Timely Communications Access Methods Using NASA Space Network

There is a growing interest among scientists to coordinate diverse and temporally responsive measurements from multiple space and ground-based observatories in order to obtain greater insights into transient scientific events than would otherwise be possible. Many transient scientific events of interest occur randomly and the scientific value of follow-up observations decays with time. As a result, transient science operations among distributed observatories require timely access to communications network services. This paper develops two complimentary methods to improve users’ network access timeliness using the NASA Space Network (SN). Descriptive models of each method are developed using Systems Modeling Language. Pathfinder experiments are designed and executed. Suitability of the methods is discussed in light of the experimental results. Innovative applications of the methods are presented. This research establishes that the as-built SN systems have adequate capabilities and capacity to support infusion of the methods to current and future users with emergent time-sensitive service needs. The minimum service access wait time was determined to be approximately 10 min and is achievable 84% of the time. An average access wait time of approximately 14 min is expected when SN resource blocking occurs. A roadmap to improve SN access timeliness is presented.

Space Communications and Navigation↗

Prediction of antenna array performance from subarray measurements

Computer runs were used to determine the effect of mechanical distortions on array pattern performance. Subarray gain data, along with feed network insertion loss, and insertion phase data were combined with the analysis of Ruze on random errors to predict gain of a full array.

Huisjen, M. A.↗

Packet communications in satellites with multiple-beam antennas and signal processing

A communication satellite with a multiple-beam antenna and onboard signal processing is considered for use in a 'message-switched' data relay system. The signal processor may incorporate demodulation, routing, storage, and remodulation of the data. A system user model is established and key functional elements for the signal processing are identified. With the throughput and delay requirements as the controlled variables, the hardware complexity, operational discipline, occupied bandwidth, and overall user end-to-end cost are estimated for (1) random-access packet switching; and (2) reservation-access packet switching. Other aspects of this network (eg, the adaptability to channel switched traffic requirements) are examined. For the given requirements and constraints, the reservation system appears to be the most attractive protocol.

Davies, R.↗

Comparison Study of Machine Learning Techniques to Predict Flight Energy Consumption for Advanced Air Mobility

This paper addresses the need to predict the flight energy consumption of aerial vehicles in the presence of wind using machine learning techniques. The presented work is critical to achieving sustainable and efficient operations for Advanced Air Mobility (AAM) and to evaluating the readiness of the ground-supporting energy infrastructure, e.g., electric grid and AAM portals. The flight energy consumption is described using the "energy per meter" (EPM) metric. We present a comparison study of influential machine learning techniques in predicting EPM using real-world flight test data. We presented new results of using the Decision Tree, Random Forest, and linear regression techniques, along with our previous results using the Recurrent Neural Network and Feed Forward Neural Network techniques. The comparison results show that the Linear Regression method outperforms other methods on the basis of the Mean Squared Error and error variance.

Machine Learning↗

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗