Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORK”

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Quantitative Assessment of Detection Frequency for the INL Ambient Air Monitoring Network

A quantitative assessment of the Idaho National Laboratory (INL) air monitoring network was performed using frequency of detection as the performance metric. The INL air monitoring network consists of 37 low-volume air samplers in 31 different locations. Twenty of the samplers are located on INL (onsite) and 17 are located off INL (offsite). Detection frequencies were calculated using both BEA and ESER laboratory minimum detectable activity (MDA) levels. The CALPUFF Lagrangian puff dispersion model, coupled with 1 year of meteorological data, was used to calculate time-integrated concentrations at sampler locations for a 1-hour release of unit activity (1 Ci) for every hour of the year. The unit-activity time-integrated concentration (TICu) values were calculated at all samplers for releases from eight INL facilities. The TICu values were then scaled and integrated for a given release quantity and release duration. All facilities modeled a ground-level release emanating either from the center of the facility or at a point where significant emissions are possible. In addition to ground-level releases, three existing stacks at the Advanced Test Reactor Complex, Idaho Nuclear Technology and Engineering Center, and Material and Fuels Complex were also modeled. Meteorological data from the 35 stations comprising the INL Mesonet network, data from the Idaho Falls Regional airport, upper air data from the Boise airport, and three-dimensional gridded data from the weather research forecasting model were used for modeling. Three representative radionuclides identified as key radionuclides in INL’s annual National Emission Standards for Hazardous Air Pollutants evaluations were considered for the frequency of detection analysis: Cs-137 (beta-gamma emitter), Pu-239 (alpha emitter), and Sr-90 (beta emitter). Source-specific release quantities were calculated for each radionuclide, such that the maximum inhalation dose at any publicly accessible sampler or the National Emission Standards for Hazardous Air Pollutants maximum exposed individual location (i.e., Frenchman’s Cabin) was no more than 0.1 mrem yr–1 (i.e., 1% of the 10 mrem yr–1 standard). Detection frequencies were calculated separately for the onsite and offsite monitoring network. As expected, detection frequencies were generally less for the offsite sampling network compared to the onsite network. Overall, the monitoring network is very effective at detecting the potential releases of Cs-137 or Sr-90 from all sources/facilities using either the ESER or BEA MDAs. The network was less effective at detecting releases of Pu-239. Maximum detection frequencies for Pu-239 using ESER MDAs ranged from 27.4 to 100% for onsite samplers and 3 to 80% for offsite samplers. Using BEA MDAs, the maximum detection frequencies for Pu-239 ranged from 2.1 to 100% for onsite samplers and 0 to 5.9% for offsite samplers. The only release that was not detected by any of the samplers under any conditions was a release of Pu-239 from the Idaho Nuclear Technology and Engineering Center main stack (CPP-708). The methodology described in this report could be used to improve sampler placement and detection frequency, provided clear performance objectives are defined.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Enhancing Lattice Kinetic Schemes for Fluid Dynamics with Lattice-Equivariant Neural Networks

A new class of equivariant neural networks is presented, hereby dubbed lattice-equivariant neural networks (LENNs), designed to satisfy local symmetries of a lattice structure. The approach develops within a recently introduced framework aimed at learning neural network-based surrogate models’ lattice Boltzmann collision operators. Whenever neural networks are employed to model physical systems, respecting symmetries and equivariance properties has been shown to be key for accuracy, numerical stability, and performance. Here, hinging on ideas from group representation theory, trainable layers are defined whose algebraic structure is equivariant with respect to the symmetries of the lattice cell. In this work, the presented method naturally allows for efficient implementations, in terms of both memory usage and computational costs, supporting scalable training/testing for lattices in two spatial dimensions and higher (in which the size of symmetry group grows). The approach is validated and tested considering 2D and 3D flowing dynamics, both in laminar and turbulent regimes. It is compared with group-averaged-based symmetric networks and with plain, nonsymmetric, networks, showing how the presented approach unlocks the (a posteriori) accuracy and training stability of the former models and the train/inference speed of the latter networks. (LENNs are about one order of magnitude faster than group-averaged networks in 3D.) The work in this paper opens toward practical use of machine learning-augmented lattice Boltzmann CFD in real-world simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

Defining Tolerance: Impacts of Delay and Disruption when Managing Challenged Networks

Challenged networks exhibit irregularities in their communication performance stemming from node mobility, power constraints, and impacts from the operating environment. These irregularities manifest as high signal propagation delay and frequent link disruption. Understanding those limits of link disruption and propagation delay beyond which core networking features fail is an ongoing area of research. Various wireless networking communities propose tools and techniques that address these phenomena. Emerging standardization activities within the Internet Research Task Force (IRTF) and the Consultative Committee for Space Data Systems (CCSDS) look to build upon both this experience and scalability analysis. Successful research in this area is predicated upon identifying enablers for common communication functions (notably node discovery, duplex communication, state caching, and link negotiation) and how increased disruptions and delays affect their feasibility within the network. Networks that make fewer assumptions relating to these enablers provide more universal service. Specifically, reliance on node discovery and link negotiation results in network-specific operational concepts rather than scalable technical solutions. Fundamental to this debate are the definitions, assumptions, operational concepts, and anticipated scaling of these networks. This paper presents the commonalities and differences between delay and disruption tolerance, including support protocols and critical enablers. We present where and how these tolerances differ. We propose a set of use cases that must be accommodated by any standardized delay-tolerant network and discuss the implication of these on existing tool development.

mobility drivers↗
NASA NTRSDate not supplied

Validation of Image-Based Neural Network Controllersthrough Adaptive Stress Testing

Neural networks have become state-of-the-art for computer vision problems because of their ability to efficiently model complex functions from large amounts of data. While neural networks can be shown to perform well empirically fora variety of tasks, their performance is difficult to guarantee.Neural network verification tools have been developed that can certify robustness with respect to a given input image; however,for neural network systems used in closed-loop controllers,robustness with respect to individual images does not address multi-step properties of the neural network controller and itsenvironment. Furthermore, neural network systems interacting in the physical world and using natural images are operating in a black-box environment, making formal verification in-tractable. This work combines the adaptive stress testing (AST)framework with neural network verification tools to search for the most likely sequence of image disturbances that cause the neural network controlled system to reach a failure. Anautonomous aircraft taxi application is presented, and results show that the AST method finds failures with more likely image disturbances than baseline methods. Further analysis of AST results revealed an explainable cause of the failure, giving insight into the problematic scenarios that should be addressed.

Adaptive Stress Testing, Marabou, Deep Neural Netw↗
NASA NTRSDate not supplied

Understanding and Verifying Neural Networks

Deep Neural Networks (DNNs) have gained immense popularity in recent times and have widespread use in applications such as image classification, sentiment analysis, speech recognition and also in safety-critical applications such as autonomous driving. However, they suffer limitations such as lack of explainability and robustness which raise safety and security concerns in their usage. Further, the complex structure and large input spaces of DNNs act as an impediment to thorough verification and testing. The SafeDNN project at the Robust Software Engineering (RSE) group at NASA aims at exploring techniques to ensure that systems that use deep neural networks are safe, robust and interpretable. In this talk, I will be presenting our technique Prophecy that automatically infers formal properties of deep neural network models. The tool extracts patterns based on neuron activations as preconditions that imply certain desirable output properties of the model. I would be highlighting case studies that use Prophecy in obtaining explanations for network decisions, understanding correct and incorrect behavior, providing formal guarantees wrt safety and robustness, and debugging neural network models. We have applied the tool on image classification networks, neural network controllers providing turn advisories in unmanned aircrafts, regression models used for autonomous center-line tracking in aircrafts and neural network object detectors

Deep Neural Networks↗
DOE OSTI2022

Phase Identification in Real Distribution Networks with High PV Penetration Using Advanced Metering Infrastructure Data: Preprint

Many distribution network monitoring and control applications - including state estimation, volt/VAR optimization, and network reconfiguration - rely on accurate network models; however, the network models maintained by utilities can become outdated because of restoration activities, network reconfiguration, and missing data. With the widespread deployment of advanced metering infrastructure (AMI), abundant measurement data from low-voltage secondary networks are available. The AMI measurement data can be used for phase identification to improve the network models. Although the existing phase identification techniques work well in passive distribution feeders that do not have photovoltaic (PV) generation, they can fail to accurately identify the phases in the presence of PV. This paper proposes a robust phase identification algorithm based on supervised machine learning that accurately identifies the AMI meter phase connectivity in the presence of significant PV generation. The proposed algorithm does not require network topology information or feeder head measurement data. The algorithm is validated using the AMI measurement data collected in the field and the field-validated phase connectivity database on two real distribution feeders from San Diego Gas & Electric Company that have significant PV generation.

advanced metering infrastructure↗
DOE OSTI2022

Phase Identification in Real Distribution Networks with High PV Penetration Using Advanced Metering Infrastructure Data

Many distribution network monitoring and control applications - including state estimation, Volt/VAr optimization, and network reconfiguration - rely on accurate network models; however, the network models maintained by utilities can become outdated because of restoration activities, network reconfiguration, and missing data. With the widespread deployment of advanced metering infrastructure (AMI), abundant measurement data from low-voltage secondary networks are available. The AMI measurement data can be used for phase identification to improve the network models. Although the existing phase identification techniques work well in passive distribution feeders that do not have photovoltaic (PV) generation, they can fail to accurately identify the phases in the presence of PV. This paper proposes a robust phase identification algorithm based on supervised machine learning that accurately identifies the AMI meter phase connectivity in the presence of significant PV generation. The proposed algorithm does not require network topology information or feeder-head measurement data. The algorithm is validated using the AMI measurement data collected in the field and the field-validated phase connectivity database on two real distribution feeders from San Diego Gas & Electric Company that have significant PV generation.

advanced metering infrastructure (AMI)↗
DOE OSTI2019

Evaluating Quality of Service Traffic Classes on the Megafly Network

An emerging trend in High Performance Computing (HPC) systems that use hierarchical topologies (such as dragonfly) is that the applications are increasingly exhibiting high run-to-run performance variability. This poses a significant challenge for application developers, job schedulers, and system maintainers. One approach to address the performance variability is to use newly proposed network topologies such as megafly (or dragonfly+) that offer increased path diversity compared to a traditional fully connected dragonfly. Yet another approach is to use quality of service (QoS) traffic classes that ensure bandwidth guarantees. In this work, we select HPC application workloads that have exhibited performance variability on current 2-D dragonfly systems. We evaluate the baseline performance expectations of these workloads on megafly and 1-D dragonfly network models with comparably similar network configurations. Our results show that the megafly network, despite using fewer virtual channels (VCs) for deadlock avoidance than a dragonfly, performs as well as a fully connected 1-D dragonfly network. We then exploit the fact that megafly networks require fewer VCs to incorporate QoS traffic classes. We use bandwidth capping and traffic differentiation techniques to introduce multiple traffic classes in megafly networks. In some cases, our results show that QoS can completely mitigate application performance variability while causing minimal slowdown to the background network traffic.

Mubarak, Misbah↗
DOE OSTI2020

Ensembles of Networks Produced from Neural Architecture Search

Neural architecture search (NAS) is a popular topic at the intersection of deep learning and high performance computing. NAS focuses on optimizing the architecture of neural networks along with their hyperparameters in order to produce networks with superior performance. Much of the focus has been on how to produce a single best network to solve a machine learning problem, but as NAS methods produce many networks that work very well, this affords the opportunity to ensemble these networks to produce an improved result. Additionally, the diversity of network structures produced by NAS drives a natural bias towards diversity of predictions produced by the individual networks. This results in an improved ensemble over simply creating an ensemble that contains duplicates of the best network architecture retrained to have unique weights.

Herron, Emily↗
DOE OSTI2021

A TTL-based Approach for Content Placement in Edge Networks

Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed network structure, cache sizes, it is challenging to decide where to place the content, and how long it should be cached. In this paper, we study the utility optimization of content placement at edge networks through timer-based (TTL) policies. We propose provably optimal distributed algorithms that operate at each network cache to maximize the overall network utility. Our TTL-based optimization model provides theoretical answers to how long each content must be cached, and where it should be placed in the edge network. Extensive evaluations show that our algorithm significantly outperforms path replication with conventional caching algorithms over some network topologies.

Panigrahy, Nitish K.↗
DOE OSTI2019

CSK hopping pattern model for visible light communication networks

This paper proposes a new channel access method for visible light communications. The transmitter uses the CSK hopping pattern mode to load data to the R, G, and B light-emitting diodes of LEDs and establishes the network access point (AP) of the LEDs for the illumination coverage area. The coordinator controls the work of each AP to ensure that it simultaneously uses different color patterns to distinguish its respective networks. When the receiver (mobile terminal) detects a particular color pattern in the illumination coverage area, it establishes a communication access network process with the AP that is transmitting the particular color pattern. The advantage of this method is that interference between adjacent APs can be avoided. In addition, due to the simplification of the access network, the proposed CSK hopping model can shorten delays in the terminal’s access network. Through modeling and simulation, it is found that this method can effectively support network power and reduce network delay. Moreover, the fairness and stability of terminals that access the network are improved to a certain extent.

42 ENGINEERING↗
DOE OSTI2018

Effectiveness of supercritical-CO 2 and N 2 huff-and-puff methods of enhanced oil recovery in shale fracture networks using microfluidic experiments

Current oil recovery methods in hydraulically fractured shale reservoirs have a low recovery efficiency of about 10%. The objective of this work is to investigate the effectiveness of nitrogen and supercritical carbon dioxide in the huff-and-puff method for enhanced oil recovery as a means to re-energize reservoirs and improve recovery rates. Here, we conduct direct visualization experiments with a microfluidic system to reveal the mechanisms and to quantify the recovery rates of oil from fracture networks. We compared the effectiveness of water, nitrogen and supercritical carbon dioxide at reservoir conditions in a process mimicking the huff-and-puff method in both dead-end and connected fracture systems. The microfluidic chips were made of glass and placed in a confining pressure system pressurized to 10 MPa, 50 °C. The system was allowed to equilibrate, and then depressurized to simulate huff-and-puff oil recovery. Fluorescence microscope images were continuously taken to visualize and calculate residual oil saturation as a function of pressure drawdown. As the system was depressurized from 10 MPa, gas exsolution from the oil liquid phase, including bubble nucleation, growth, and coalescence, appeared to be the main driver for mobilizing oil from the fracture networks. Injection of supercritical CO 2 resulted in the highest recovery rate with an average end-point recovery of about 90% in the connected fracture network and 60% in the dead-end fracture network. N 2 has lower solubility in oil and hence showed a lower recovery rate of 40% in the connected fracture network and 25% in the dead-end fracture network. Injection of water had no effect on oil mobilization since water is insoluble, immiscible and incompressible. The main mechanism of enhanced recovery was gas exsolution from the liquid phase as pressure was decreased below the bubble point pressure. Because the gas was distributed throughout the oil phase, bubble nucleation, growth, coalescence, and elongation occurred throughout the fracture network. Expansion of the gas forced oil out of the network through piston displacement in continuous oil areas and film flow in the dispersed oil areas. Bubbles began as spheres and grew until they touched the fracture walls where they elongated along the fracture length. The bubble growth rate depended on local mass transfer from liquid to gas phase and gas volume expansion due to pressure drop. The efficiency of the huff-and-puff process is dependent on the solubility and miscibility of the injection fluid with oil. High gas solubility allows for more bubble nucleation, growth and expansion during the depressurization cycle.

58 GEOSCIENCES↗
DOE OSTI2022

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

A kriging and entropy-based approach to raingauge network design

Highlights: • A kriging and entropy theory-based approach is developed for gauge network design. • The method considers both minimum estimating error andoptimum rainfall information. • The best combination is verified to be effectiveto achieve final goals. Hydrological data, such as precipitation, is fundamental for planning, designing, developing, and managing water resource projects as well as for hydrologic research. An optimal raingauge network leads to more accurate estimates of mean or point precipitation at any site over the watershed. Some studies in the past have suggested increasing gauge network density for reducing the estimation error. However, more stations mean more cost of installation and monitoring. This study proposes an approach on the basis of kriging and entropy theory to determine an optimal network design in the city of Shanghai, China. Unlike the past studies using kriging interpolation and entropy theory for network design, the approach developed in the current study not only used the kriging method as an interpolator to determine rainfall data at ungauged locations but also incorporated the minimum kriging standard error (KSE) and maximum net information (NI) content. The approach would thus lead to an optimal network and would enable the reduction of kriging standard error of precipitation estimates throughout the watershed and achieve an optimum rainfall information. This study also proposed an NI-KSE-based criterion which is dependent on a single-objective optimization. To evaluate the final optimal gauge network, areal average rainfall was estimated and its accuracy was compared with that obtained with the existing rain gauge network.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

A data-driven CO 2 leakage detection using seismic data and spatial–temporal densely connected convolutional neural networks

In carbon capture and sequestration (also known as carbon capture and storage, or CCS), developing effective monitoring methods is needed to detect and respond to CO 2 leakage. CO 2 leakage detection methods rely on geophysical observations and monitoring sensor network. However, traditional methods usually require the development of site-specific physical models and expert interpretation, and the effectiveness of these methods can be limited to different application locations, operational scenarios, and conditions. Here, we developed a novel data-driven leakage detection method based on densely connected convolutional neural networks. Our method is an end-to-end detection approach, that differs from conventional leakage monitoring methods by directly learning a mapping relationship between seismic data and the CO 2 leakage mass. To account for the spatial and temporal characteristics of seismic data, our novel networks architecture combines 1D and 2D convolutional neural networks. To overcome the computational expense of solving optimization problems, we apply a densely-connecting strategy in our network architecture that reduces the number of network parameters. Based on the features generated by our convolutional neural networks, we further incorporate a long short-term memory network to utilize time-sequential information, which further improves the detection accuracy. Lastly, we employ our detection method to synthetic seismic datasets generated based on flow simulations of a hypothetical CO 2 storage scenario with injection into a partially compartmentalized sandstone storage reservoir. To evaluate method performance, we conducted multiple experiments including a random leakage test, a sequential test, and a robustness test. Numerical results show that our CO 2 leakage detection method successfully detects the leakage and accurately predicts the leakage mass, suggesting that it has the potential for application in monitoring of real CO 2 storage sites.

58 GEOSCIENCES↗
DOE OSTI2018

Metabolic brain networks in aging and preclinical Alzheimer's disease

Metabolic brain networks can provide insight into the network processes underlying progression from healthy aging to Alzheimer's disease. We explore the effect of two Alzheimer's disease risk factors, amyloid-β and ApoE ε4 genotype, on metabolic brain networks in cognitively normal older adults (N = 64, ages 69–89) compared to young adults (N = 17, ages 20–30) and patients with Alzheimer's disease (N = 22, ages 69–89). Subjects underwent MRI and PET imaging of metabolism (FDG) and amyloid-β (PIB). Normal older adults were divided into four subgroups based on amyloid-β and ApoE genotype. Metabolic brain networks were constructed cross-sectionally by computing pairwise correlations of metabolism across subjects within each group for 80 regions of interest. We found widespread elevated metabolic correlations and desegregation of metabolic brain networks in normal aging compared to youth and Alzheimer's disease, suggesting that normal aging leads to widespread loss of independent metabolic function across the brain. Amyloid-β and the combination of ApoE ε4 led to less extensive elevated metabolic correlations compared to other normal older adults, as well as a metabolic brain network more similar to youth and Alzheimer's disease. This could reflect early progression towards Alzheimer's disease in these individuals. Altered metabolic brain networks of older adults and those at the highest risk for progression to Alzheimer's disease open up novel lines of inquiry into the metabolic and network processes that underlie normal aging and Alzheimer's disease.

Neurosciences & Neurology↗
DOE OSTI2025

Electronic Configurational Transformation of Network Modifiers in Aluminate Glass above Megabar Pressures

Electronic responses of glasses under extreme pressures differ from those of crystalline analogs. Their distinct electronic environments are found in network formers with well-defined, covalent-bonded coordination environments (e.g., [4] Si and [4] Al) and in network modifiers with more disordered, ionic-bonded configurations (e.g., [5,6,7] Ca). Deciphering the evolution of the bonding environment of network modifier cations upon compression provides atomic insights into the pressure-driven hardening and transport properties of glasses. Despite the importance, in contrast to extensive efforts to uncover how network formers behave under pressure, considerable structural disorder around network modifiers makes it challenging to probe their electronic bonding environments under compression. Our understanding of the evolution of network modifiers above megabars is currently absent. Here, we report a discovery of highly densified electronic configurations of network modifier Ca in aluminate glass under extreme compression via the first inelastic X-ray scattering at the Ca L-edge up to 140 GPa. As evidenced by the prominent pressure-driven increases in electronic dispersion and delocalization, densified calcium environments are characterized by a decreased average Ca–O distance, the formation of highly coordinated calcium, a broader distribution of topological variables, and a greater distortion of Ca polyhedra above megabars. The spectral features for the Ca environments reveal significant electronic and bonding modifications, including pressure-driven increases in the ligand field interaction, the covalence characteristic of the Ca–O bond, and the electron–hole Coulomb interaction. These densification paths identify the electronic adaptation of network modifiers above megabars, shedding light on the origins of enhanced electron transport and the electron-storing capacity of glasses under pressure.

amorphous materials↗