SEARCH · Engineering Papers
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.
The PARETO training workshop is a two-hour, interactive experience intended to teach participants how to: install PARETO software, input data into PARETO; run PARETO optimization; model a variety of complex network scenarios; and analyze, interpret, and compare optimization results.
Particle accelerator experiments rely on stable, consistent proton beams to maximize scientific discovery. This presentation introduces beam spills, duty factor, and beam stability using a meteor shower analogy before exploring how feedback control and machine learning, including recurrent neural networks (RNNs), can analyze spill data, identify patterns, and predict beam behavior. Together, these approaches support beam optimization and improve our understanding of accelerator performance for experiments such as Mu2e.
This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.
We report peridynamics is a relatively new field in continuum mechanics that has developed over the past 20 years. This paper studies the evolution of collaborations in the field of peridynamics since its inception using social network analysis. For this purpose, we construct a network for each year from 2000 to 2019 describing co-authorship between scientists in peridynamics. In these networks, each node represents a scientist and each link connects two co-authoring scientists with a link weight representing the frequency and strength of their collaboration; each network as a whole can be thought of as a graph representation of the peridynamics community for the given year. By constructing a network for each year, we are able to analyze the evolution of the network in time and discuss the implications of this evolution for the peridynamics community. Our study demonstrates that the peridynamics community has been growing exponentially in size in recent years. Centrality metrics are also used to identify the most collaborative scientists in the community. Moreover, we compute link recommendations based on both elevating a scientist’s position in the network with respect to certain centrality metrics or closing structural holes in the network identified with persistent homology. We further extend the analysis to higher-order networks whose nodes represent groups of scientists in the community and whose links connect collaborating groups. In some sense, our work studies the past, present, and future of the peridynamics community.
Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.
Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.
This paper reports intrusion detection using distributed acoustic sensors based on phase- sensitive enhanced Rayleigh scattering optical time-domain reflectometry. Vibration data induced by human locomotion was analyzed by convolution neural networks and achieve over 76.25% accuracy on human identification.
In this study we use numerical experiments to analyze reactive flow and transport behavior in discrete intersecting fracture networks, focusing on (a) how reaction-induced changes in physical and chemical properties affect flow connectivity and (b) how fracture networks developed in the Earth's critical zone contribute to carbon sequestration via mineral weathering reactions. In the first part of the study, we used two-dimensional reactive flow and transport simulations to analyze the impacts of mixing in a natural discrete fracture network. We concluded that reaction-induced changes can substantially alter the flow connectivity, especially at fracture intersections. The second set of simulations considered the problem of natural weathering of fractured mafic and ultramafic rocks in the partially saturated Earth's critical zone as a function of infiltration rates, fracture permeability, and partially saturated flow parameters. As a model system, we considered an incongruent reaction network with dissolution of forsterite and precipitation of magnesite. The behavior is complex in terms of the rate-controlling processes because of the multicomponent nature of the system as shown by the grid Peclet number: the CO 2 behavior is gas diffusion-controlled in the partially saturated zone, while the rate of water flow via the Damkӧhler number controls Mg 2+ transport through the fracture network. The amounts of carbon that can be trapped are modest, but the naturally fractured domain considered here provides a useful “base case” against which various engineered solutions can be compared.
Ultrasonic sensing is a non-invasive technique for monitoring impurity gas composition in various industrial applications where safety and regulatory compliance are crucial. In this study, ultrasonic sensing and neural networks were used to analyze impurity gases (i.e., air and argon) in helium. An experimental platform was established to acquire ultrasonic data. In the forward problem, an artificial neural network (ANN) model was used to forecast the response and time-of-flight (TOF) based on the excitation, and argon and air concentrations. The inverse problem was solved using a convolutional neural network (CNN) to predict the argon and air concentrations given the ultrasonic response and excitation. The results showed that the ANN accurately predicted the ultrasonic response and the change in TOF with concentration. As the air concentration was increased from 0 to 9.8%, the TOF sensitivity to detect argon decreased by 39.8% and 16.1% from ANN and sound speed theory, respectively. The CNN demonstrated high accuracy in predicting concentrations for inputs in the testing dataset. The application of the trained CNN indicated that it over-predicts air concentration while under-predicting the argon concentration. To improve accuracy, the predicted air and argon concentrations should be corrected by -0.992% and 1.027% bias, respectively.
Microorganisms colonizing natural habits such as soils co-evolve to form specific spatial patterns through interspecies interactions. These self-organized patterns are a key ecological phenotype, which provides critical information on their interaction mechanisms. However, conventional network inference techniques that analyze species population data in bulk have yet to be extended to account for such spatial heterogeneity. Here we proposed supervised deep learning as a new network inference tool for predicting interspecies interactions from spatiotemporal patterns of microbial evolution. Due to lack of biological imaging data that can be used for training deep learning networks, we used in silico data generated from high-fidelity agent-based models to determine model structure and parameters. Even though networks were trained under simple configurations where interaction coefficients are assumed to be spatially invariant, we demonstrated that the resulting model can be utilized to successfully predict spatial variation of interactions in more complex domains (i.e., configured with a context-dependent mixture of interaction coefficients) as well as in simple domains without further training. In the further test against real biological data obtained through imaging experiments of a binary consortium (Pseudomonas fluorescens and a mutant of Escherichia coli), our model also predicted the dramatic shifts in interactions of the two organisms across different environmental contexts. Through various successful demonstrations in this work, the combined use of the agent-based model and machine learning algorithm provides a means to use new type of data - microscopic images - for extracting microbial interactions, therefore presenting itself as a useful tool for the analysis of more complex microbial community interactions.
Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.
Full-waveform inversion (FWI) is an accurate imaging approach for modeling the velocity structure by minimizing the misfit between recorded and predicted seismic waveforms. However, the strong nonlinearity of FWI resulting from fitting oscillatory waveforms can trap the optimization in local minima. We have adopted a neural-network-based full-waveform inversion (NNFWI) method that integrates deep neural networks with FWI by representing the velocity model with a generative neural network. Neural networks can naturally introduce spatial correlations as regularization to the generated velocity model, which suppresses noise in the gradients and mitigates local minima. Furthermore, the velocity model generated by neural networks is input to the same partial differential equation (PDE) solvers used in conventional FWI. The gradients of the neural networks and PDEs are calculated using automatic differentiation, which back propagates gradients through the acoustic PDEs and neural network layers to update the weights of the generative neural network. Experiments on 1D velocity models, the Marmousi model, and the 2004 BP model determine that NNFWI can mitigate local minima, especially for imaging high-contrast features such as salt bodies, and it significantly improves the inversion in the presence of noise. Adding dropout layers to the neural network model also allows analyzing the uncertainty of the inversion results through Monte Carlo dropout. NNFWI opens a new pathway to combine deep learning and FWI for exploiting the characteristics of deep neural networks and the high accuracy of PDE solvers. Because NNFWI does not require extra training data and optimization loops, it provides an attractive and straightforward alternative to conventional FWI.
The Role of Boundaries in the Spreading of Solar Peer effects by neighbors play a key role in the spreading of residential solar. Thus, people are more likely to install a solar system on their roof if some of their neighbors have already done so. Because people who live near the municipality boundary have fewer neighbors, does this imply that they are less likely to adopt solar? In “Boundary Effects in the Diffusion of New Products on Cartesian Networks,” Fibich, Levin, and Gillingham analyze this problem analytically using the Bass model on two-dimensional networks and empirically using data on installations of solar systems. They show that boundaries have a significant impact on the adoption of residential units near the municipality boundary. Their effect on the aggregate adoption in the municipality, however, is negligible.
As networks continue to grow in complexity and scale, detecting anomalies has become increasingly challenging, particularly in diverse and geographically dispersed environments. Traditional approaches often struggle with managing the computational burden associated with analyzing large-scale network traffic to identify anomalies. This paper introduces a distributed edge computing framework that integrates federated learning with Apache Spark and Kubernetes to address these challenges. We hypothesize that our approach, which enables collaborative model training across distributed nodes, significantly enhances the detection accuracy of network anomalies across different network types. We show that by leveraging distributed computing and containerization technologies, our framework not only improves scalability and fault tolerance but also achieves superior detection performance compared to state-of-the-art methods. Extensive experiments on the UNSW-NB15 and ROAD datasets validate the effectiveness of our approach, demonstrating statistically significant improvements in detection accuracy and training efficiency over baseline models, as confirmed by MannWhitney U and Kolmogorov-Smirnov tests (p<0.05).
The software has two main features: (1) identify data movement trends in HPC data centers that use network flow monitoring (2) analyze the performance of individual data flows under the existing data movement management strategy and identify performance bottlenecks that impede timely data availability for science workflows. Its main advantage is that it is tailored for HPC network traffic by considering HPC data movement management intricacies.
Modern vehicles rely on complex cyber-physical systems made up of hundreds of electronic control units (ECUs) connected through controller area network (CAN) buses. However, the CAN bus attack surface is increasing due to advanced features in automobiles, making it prone to injection attacks. The ordinary injection attacks disrupt the typical timing properties of the CAN data stream, and the rule-based intrusion detection systems (IDS) can easily detect them. However, advanced attackers can inject false data to the signal level, maintaining the regular pattern/frequency of the CAN messages. Such attacks can bypass the rule-based IDS or any anomaly-based IDS built on binary payload data. To make the vehicles robust against such intelligent attacks, we propose CANShield, a signal-based intrusion detection framework for the CAN bus that consists of three modules. A data preprocessing module handles the high-dimensional CAN data stream at the signal level and make them suitable for any machine learning model. A data analyzer module consists of multiple deep autoencoder networks, each analyzing the time series data from a different perspective. Finally, an attack detection module uses an ensemble method to make the final decision. Evaluation results on a standard signal-based dataset show the effectiveness of the CANShield in detecting five advanced attacks.
Abstract Most real‐world networks are both dynamic and multivariate in nature, meaning that the network is associated with various attributes and both the network structure and attributes evolve over time. Visualizing dynamic multivariate networks is of great significance to the visualization community because of their wide applications across multiple domains. However, it remains challenging because the techniques should focus on representing the network structure, attributes and their evolution concurrently. Many real‐world network analysis tasks require the concurrent usage of the three aspects of the dynamic multivariate networks. In this paper, we analyze current techniques and present a taxonomy to classify the existing visualization techniques based on three aspects: temporal encoding, topology encoding, and attribute encoding. Finally, we survey application areas and evaluation methods; and discuss challenges for future research.