Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Networking”

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 1,585 records · Page 88

Sensitivity Study of Mini-Batch Size on a Long Short-Term Memory Network for In-situ Sensing of Core-to-shell Ratio of Microencapsulated Phase Change Materials

Microencapsulated phase change materials are being studied for applications for thermal energy storage in concentrated solar fields. During fabrication, the thickness of the encapsulation cannot be readily measured for real-time control. Therefore, a machine learning network, specifically a Long Short-Term Memory network, is being developed to estimate the ratio of the shell radius to core radius based on a one second temperature history. The mini-batch size determines how often the algorithm weights are updated during network training, and shuffle indicates whether the training data is shuffled during training. A general factorial design is used to analyze the effects of varying mini-batch size and shuffle, along with the core-to-shell ratio, on the RMSE of the response from the Long Short-Term Memory network. It was found that the network performed better for smaller core to shell ratios (less than 0.6) and had the lowest RMSE when the minibatch size was 128. The minimum RMSE found was 0.00501.

Shannon, Rebecca↗

Identification and assignment of rotational spectra using artificial neural networks

A method of identifying molecular parameters may include receiving observed transition frequencies, generating transition frequency sets and a spectral parameter sets, training one or more artificial neural networks by analyzing the transition frequency sets and the spectral parameter sets, analyzing the observed transition frequencies using the one or more trained artificial neural networks to predict estimated spectral parameters, and identifying molecular parameters by analyzing the estimated spectral parameters. A molecular parameter identification system may include a rotational spectrometer, a user interface, and a spectrum analysis application that may retrieve observed transition frequencies, identify a Hamiltonian type by a neural network analyzing the observed transition frequencies, select a second trained artificial neural network based on the identified Hamiltonian type, analyze observed transition frequencies using the second artificial neural network to identify estimated spectral parameters, and identify molecular parameters.

Prozuments, Kirills↗

WavPool: A New Block for Deep Neural Networks

Modern deep neural networks comprise many operational layers, such as dense or convolutional layers, which are often collected into blocks. In this work, we introduce a new, wavelet-transform-based network architecture that we call the multi-resolution perceptron: by adding a pooling layer, we create a new network block, the WavPool. The first step of the multi-resolution perceptron is transforming the data into its multi-resolution decomposition form by convolving the input data with filters of fixed coefficients but increasing size. Following image processing techniques, we are able to make scale and spatial information simultaneously accessible to the network without increasing the size of the data vector. WavPool outperforms a similar multilayer perceptron while using fewer parameters, and outperforms a comparable convolutional neural network by ~ 10% on relative accuracy on CIFAR-10.

McDermott, Samuel D.↗

Maximum-impact Adversary Design for Network-based Control System: A Case Study on Grid-interactive Efficient Buildings

The Internet of Things (IoT) technology has dramatically improved the efficiency of today's building operation and management. By connecting controllable devices into a communication network, control signals can be easily passed to the devices, and operating status can be acquired from measurable ends with minimal effort. However, this all-connected configuration could also expose the network-based control system (NBCS) to malicious actions, such as cyberattacks. One of the common NBCSs is the building automation system. With the promotion of grid-interactive efficient buildings (GEBs), there has been increasing attention on securing the buildings from the network perspective. This research proposes a maximum-impact adversary design framework so that the adversary can provide the most adversarial impact on the controlled system while remaining stealthy. The proposed framework is numerically demonstrated on a network-based building energy and control system. The building energy system is built in a Modelica-based simulation environment and controlled by the state-of-the-art ASHRAE Guideline 36 control sequences. The control commands at the supervisory level, generated from the Guideline 36 controller, are assumed to be sent to local devices through communication networks using the BACnet protocol. Simulation results show that the proposed maximum-impact adversary on such a system can stealthily affect the building system's performance to its maximum extent. It is anticipated that results can be used by researchers and practitioners in the building automation industry to design efficient and robust cyber-attack detection algorithms, especially for stealthy attacks.

Chu, Mengyuan↗

ABSTRACT: Design of Groundwater Monitoring Networks Considering Conceptual Model and Parametric Uncertainty

Uncertainty built into conceptual groundwater flow and transport models and associated parametric uncertainty should be appropriately included when such models are used to develop detection monitoring networks for contaminated sites. We compare alternative approaches of propagating such uncertainty from the flow and transport model into the network design. The focus is on detection monitoring networks where the primary objective is to intercept the contaminant before it reaches a boundary of interest (e.g., compliance boundary). Different uncertainty propagation approaches identify different well locations and different well combinations (networks) as having the highest detection efficiency. It is thus recommended that multiple uncertainty propagation approaches are considered. If several approaches yield consistent results in terms of identifying the best performing candidate wells and the best performing well network for detecting a contaminant plume, this would provide confidence in the suitability of the selected well locations.

54 ENVIRONMENTAL SCIENCES↗

Predictability and reduced order modeling in stochastic reaction networks.

Many systems involving chemical reactions between small numbers of molecules exhibit inherent stochastic variability. Such stochastic reaction networks are at the heart of processes such as gene transcription, cell signaling or surface catalytic reactions, which are critical to bioenergy, biomedical, and electrical storage applications. The underlying molecular reactions are commonly modeled with chemical master equations (CMEs), representing jump Markov processes, or stochastic differential equations (SDEs), rather than ordinary differential equations (ODEs). As such reaction networks are often inferred from noisy experimental data, it is not uncommon to encounter large parametric uncertainties in these systems. Further, a wide range of time scales introduces the need for reduced order representations. Despite the availability of mature tools for uncertainty/sensitivity analysis and reduced order modeling in deterministic systems, there is a lack of robust algorithms for such analyses in stochastic systems. In this talk, we present advances in algorithms for predictability and reduced order representations for stochastic reaction networks and apply them to bistable systems of biochemical interest. To study the predictability of a stochastic reaction network in the presence of both parametric uncertainty and intrinsic variability, an algorithm was developed to represent the system state with a spectral polynomial chaos (PC) expansion in the stochastic space representing parametric uncertainty and intrinsic variability. Rather than relying on a non-intrusive collocation-based Galerkin projection [1], this PC expansion is obtained using Bayesian inference, which is ideally suited to handle noisy systems through its probabilistic formulation. To accommodate state variables with multimodal distributions, an adaptive multiresolution representation is used [2]. As the PC expansion directly relates the state variables to the uncertain parameters, the formulation lends itself readily to sensitivity analysis. Reduced order modeling in the time dimension is accomplished using a Karhunen-Loeve (KL) decomposition of the stochastic process in terms of the eigenmodes of its covariance matrix. Subsequently, a Rosenblatt transformation relates the random variables in the KL decomposition to a set of independent random variables, allowing the representation of the system state with a PC expansion in those independent random variables. An adaptive clustering method is used to handle multimodal distributions efficiently, and is well suited for high-dimensional spaces. The spectral representation of the stochastic reaction networks makes these systems more amenable to analysis, enabling a detailed understanding of their functionality, and robustness under experimental data uncertainty and inherent variability.

59 BASIC BIOLOGICAL SCIENCES↗

Discursive Deployments: Mobilizing Support for Municipal and Community Wireless Networks in the U.S.

This paper examines Municipal Wireless (MW) deployments in the United States. In particular, the interest is in understanding how discourse has worked to mobilize widespread support for MW networks. We explore how local governments discursively deploy the language of social movements to create a shared understanding of the networking needs of communities. Through the process of"framing" local governments assign meaning to the MW networks in ways intended to mobilize support anddemobilize opposition. The mobilizing potential of a frame varies and is dependent on its centrality and cultural resonance. We examine the framing efforts of MW networks by using a sample of Request for Proposals for community wireless networks, semi-structured interviews and local media sources. Prominent values that are central to a majority of the projects and others that are culturally specific are identified and analyzed for their mobilizing potency.

99 GENERAL AND MISCELLANEOUS↗

Complexity analysis of pipeline mapping problems in distributed heterogeneous networks

Largescale scientific applications require using various system resources to execute complex computing pipelines in distributed networks to support collaborative research. System resources are typically shared in the Internet or over dedicated connections based on their location, availability, capability, and capacity. Optimizing the network performance of computing pipelines in such distributed environments is critical to the success of these applications. We consider two types of largescale distributed applications: (1) interactive applications where a single dataset is sequentially processed along a pipeline; and (2) streaming applications where a series of datasets continuously flow through a pipeline. The computing pipelines of these applications consist of a number of modules executed in a linear order in network environments with heterogeneous resources under different constraints. Our goal is to find an efficient mapping scheme that allocates the modules of a pipeline to network nodes for minimum endtoend delay or maximum frame rate. We formulate the pipeline mappings in distributed environments as optimization problems and categorize them into six classes with different optimization goals and mapping constraints: (1) Minimum Endtoend Delay with No Node Reuse (MEDNNR), (2) Minimum Endtoend Delay with Contiguous Node Reuse (MEDCNR), (3) Minimum Endtoend Delay with Arbitrary Node Reuse (MEDANR), (4) Maximum Frame Rate with No Node Reuse or Share (MFRNNRS), (5) Maximum Frame Rate with Contiguous Node Reuse and Share (MFRCNRS), and (6) Maximum Frame Rate with Arbitrary Node Reuse and Share (MFRANRS). Here, 'contiguous node reuse' means that multiple contiguous modules along the pipeline may run on the same node and 'arbitrary node reuse' imposes no restriction on node reuse. Note that in interactive applications, a node can be reused but its resource is not shared. We prove that MEDANR is polynomially solvable and the rest are NP-complete. MEDANR, where either contiguous or noncontiguous modules in the pipeline can be mapped onto the same node, is essentially the Maximum n-hop Shortest Path problem, and can be solved using a dynamic programming method. In MEDNNR and MFRNNRS, any network node can be used only once, which requires selecting the same number of nodes for onetoone onto mapping. We show its NP-completeness by reducing from the Hamiltonian Path problem. Node reuse is allowed in MEDCNR, MFRCNRS and MFRANRS, which are similar to the Maximum n-hop Shortest Path problem that considers resource sharing. We prove their NP-completeness by reducing from the Disjoint-Connecting-Path Problem and Widest path with the Linear Capacity Constraints problem, respectively.

99 GENERAL AND MISCELLANEOUS↗

Learning a detection map for a network of unattended ground sensors.

We have developed algorithms to automatically learn a detection map of a deployed sensor field for a virtual presence and extended defense (VPED) system without apriori knowledge of the local terrain. The VPED system is an unattended network of sensor pods, with each pod containing acoustic and seismic sensors. Each pod has the ability to detect and classify moving targets at a limited range. By using a network of pods we can form a virtual perimeter with each pod responsible for a certain section of the perimeter. The site's geography and soil conditions can affect the detection performance of the pods. Thus, a network in the field may not have the same performance as a network designed in the lab. To solve this problem we automatically estimate a network's detection performance as it is being installed at a site by a mobile deployment unit (MDU). The MDU will wear a GPS unit, so the system not only knows when it can detect the MDU, but also the MDU's location. In this paper, we demonstrate how to handle anisotropic sensor-configurations, geography, and soil conditions.

54 ENVIRONMENTAL SCIENCES↗

E-PINNs: Epistemic Physics-Informed Neural Networks

Physics-informed neural networks (PINNs) have demonstrated promise as a framework for solving forward and inverse problems involving partial differential equations. Despite recent progress in the field, it remains challenging to quantify uncertainty in these networks. While techniques such as Bayesian PINNs (B-PINNs) provide a principled approach to capturing epistemic uncertainty through Bayesian inference, they can be computationally expensive for large-scale applications. In this work, we propose Epistemic Physics-Informed Neural Networks (E-PINNs), a framework that uses a small network, the epinet, to efficiently quantify epistemic uncertainty in PINNs. The proposed approach works as an add-on to existing, pre-trained PINNs with a small computational overhead. We demonstrate the applicability of the proposed framework in various test cases and compare the results with B-PINNs using Hamiltonian Monte Carlo (HMC) posterior estimation and dropout-equipped PINNs (Dropout-PINNs). In our experiments, E-PINNs achieve calibrated coverage with competitive sharpness at substantially lower cost. We demonstrate that when B-PINNs produce narrower bands, they under-cover in our tests. E-PINNs also show better calibration than Dropout-PINNs in these examples, indicating a favorable accuracy-efficiency trade-off.

AI for Science↗

Evaluating the effect of internal aperture variability on transport in kilometer scale discrete fracture networks

The apertures of natural fractures in fractured rock are highly heterogeneous. However, in-fracture aperture variability is often neglected in flow and transport modeling and individual fractures are assumed to have uniform aperture distribution. The relative importance of in-fracture variability in flow and transport modeling within kilometer18 scale field–scale fracture networks has been under a matter of debate for a long time because the flow in each single fracture is controlled not only by in-fracture variability but also by boundary conditions. Computational limitations have previously prohibited researchers from investigating the relative importance of in-fracture variability in flow and transport modeling within large-scale fracture networks. We address this question by incorporating internal heterogeneity of individual fractures into 23 flow simulations within kilometer scale three-dimensional fracture networks, where fracture intensity, P32 (ratio between total fracture area and domain volume) is between 0.027 and 0.031 [1/m]. A recently developed discrete fracture network (DFN) simulation capability, dfnWorks, is used to generate DFNs that include in-fracture aperture variability represented by a stationary log-normal stochastic field with various correlation lengths and variances. The Lagrangian transport parameters, non-reacting travel time and cumulative retention, are calculated along particles streamlines. It is observed that due to local flow channeling early particle travel times are more sensitive to in-fracture variability than the tails of travel time distributions, where no significant effect of the in-fracture transmissivity variations and spatial correlation length is observed.

54 ENVIRONMENTAL SCIENCES↗

Data and programs in support of network analysis of genes and their association with diseases

The network-based approaches that were employed in order to depict the relationships between human genetic diseases and their associated genes are described. Towards this direction, monopartite disease-disease and gene-gene networks were constructed from bipartite gene-disease association networks. The latter were created by collecting and integrating data from three diverse resources, each one with different content, covering from rare monogenic disorders to common complex diseases. Moreover, topological and clustering graph analyses were performed. The methodology and the programs presented in this article are related to the research article entitled “Network analysis of genes and their association with diseases”.

Disease-disease networks↗

Reconstructing cerebrovascular networks under local physiological constraints by integer programming

We introduce a probabilistic approach to vessel network extraction that enforces physiological constraints on the vessel structure. The method accounts for both image evidence and geometric relationships between vessels by solving an integer program, which is shown to yield the maximum a posteriori (MAP) estimate to the probabilistic model. Starting from an over-connected network, it is pruning vessel stumps and spurious connections by evaluating the local geometry and the global connectivity of the graph. We utilize a high-resolution micro computed tomography (µCT) dataset of a cerebrovascular corrosion cast to obtain a reference network and learn the prior distributions of our probabilistic model. As a result, we perform experiments on micro magnetic resonance angiography (µMRA) images of mouse brains and discuss properties of the networks obtained under different tracking and pruning approaches.

59 BASIC BIOLOGICAL SCIENCES↗

Data-driven modeling of coarse mesh turbulence for reactor transient analysis using convolutional recurrent neural networks

Advanced nuclear reactors often exhibit complex thermal-fluid phenomena during transients. To accurately capture such phenomena, a coarse-mesh three-dimensional (3-D) modeling capability is desired for modern nuclear-system code. In the coarse-mesh 3-D modeling of advanced-reactor transients that involve flow and heat transfer, accurately predicting the turbulent viscosity is a challenging task that requires an accurate and computationally efficient model to capture the unresolved fine-scale turbulence. In this work, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor. The model has a coarse mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data to ensure accuracy. A novel neural network architecture, combining a densely connected convolutional network and a long-short-term-memory network, is developed that can efficiently learn from the spatial temporal CFD transient simulation results. The neural network model was trained and optimized on a loss-of flow transient and demonstrated high accuracy in predicting the turbulent viscosity field during the whole transient. The trained model's generalization capability was also investigated on two other transients with different inlet conditions. The study demonstrates the potential of applying the proposed data-driven approach to support the coarse-mesh multi-dimensional modeling of advanced reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Modern deep neural networks for Direct Normal Irradiance forecasting: A classification approach

The escalating energy demand and the adverse environmental impacts of fossil-fuel use necessitate a shift towards cleaner and renewable alternatives. Concentrated Solar Power (CSP) technology emerges as a promising solution, offering a carbon-free alternative for power generation. The efficiency and profitability of CSP depend on the Direct Normal Irradiance (DNI) component of solar radiation; hence, accurate DNI forecasting can help optimize CSP plants’ operations and performance. The unpredictable nature of weather phenomena, particularly cloud cover, introduces uncertainty into DNI projections. Existing DNI forecasting models use meteorological factors, which are both challenging to estimate numerically over short prediction windows and expensive to model through data at a sufficiently high spatial and temporal resolution. This research addresses the challenge by presenting a novel approach that formulates DNI prediction as a multi-class classification problem, departing from conventional regression-based methods. The primary objective of this classification framework is to identify optimal periods aligning with specific operational thresholds for CSP plants, contributing to enhanced dispatch optimization strategies. We model the DNI classification problem using four advanced deep neural networks – rectified linear unit (ReLU) networks, 1D residual networks (ResNets), bidirectional long short-term memory (BiLSTM) networks, and transformers – achieving accuracies up to 93.5% without requiring meteorological parameters.

14 SOLAR ENERGY↗

Resilience-based Recovery Scheduling of Transportation Network in Mixed Traffic Environment: A Deep-Ensemble-Assisted Active Learning Approach

Devising effective post-hazard recovery strategies is critical in enhancing the resilience of transportation networks (TNs). However, existing work does not consider the multiclass users’ travel behavior in network functionality quantification and the metaheuristic solution procedures often suffer from extensive computational burden due to the exploration need in large solution space and the expensive functionality quantification. Here, this study develops a bilevel decision-making framework for the resilience-based recovery scheduling of the TN in a mixed traffic environment with connected and autonomous vehicles (CAVs) and human-driven vehicles (HDVs). The lower level quantifies the TN's functionality over time considering different travel behavior of CAV and HDV users arisen from their different levels of information perception. The upper level presents a novel deep-ensemble-assisted active learning approach to balance optimization performance and computational cost. This framework can help decision makers better quantify the TN's functionality to support effective recovery scheduling of TN with different mixed traffic scenarios ranging from HDV-only to future CAV-dominant traffic. The optimization approach bears the potential to be extended to solving general large-scale network recovery scheduling problems effectively and efficiently. The proposed methodology is demonstrated using a real-world traffic network in Southern California under earthquake considering deterministic and stochastic repair durations.

42 ENGINEERING↗

Nonlinear Dynamic Model-Based Multiobjective Sensor Network Design Algorithm for a Plant with an Estimator-Based Control System

Here, a novel sensor network design (SND) algorithm is developed for maximizing process efficiency while minimizing sensor network cost for a nonlinear dynamic process with an estimator-based control system. The multiobjective optimization problem is solved following a lexicographic approach where the process efficiency is maximized first followed by minimization of the sensor network cost. The partial net present value, which combines the capital cost due to the sensor network and the operating cost due to deviation from the optimal efficiency, is proposed as an alternative objective. The unscented Kalman filter is considered as the nonlinear estimator. The large-scale combinatorial optimization problem is solved using a genetic algorithm. The developed SND algorithm is applied to an acid gas removal (AGR) unit as part of an integrated gasification combined cycle (IGCC) power plant with CO 2 capture. Due to the computational expense, a reduced order nonlinear model of the AGR process is identified and parallel computation is performed during implementation.

Lexicographic optimization↗

A Scale‐Adaptive Urban Hydrologic Framework: Incorporating Network‐Level Storm Drainage Pipes Representation

Abstract Below‐ground urban stormwater networks (BUSNs) significantly influence urban flood dynamics, yet their representation at the watershed or larger scales remains challenging. We introduce a scalable urban hydrologic framework that centers on a novel network‐level BUSN representation, balancing the needs for physical basis, parameter parsimony, and computational efficiency. Our framework conceptualizes an urban watershed into four interacting zones: hillslopes (natural), storm‐sewersheds (urban), a sub‐network channel (tributaries), and a main channel. We develop an innovative Graph Theory‐based algorithm to derive network‐level BUSN parameters from publicly available datasets, enabling efficient, scalable parameterization. We demonstrate this framework's applicability at nine representative watersheds in the Houston metropolitan region, USA, with urban imperviousness ranging from 0% to 64% and drainage areas ranging from 24 to 302 . Our model achieves satisfying computational efficiency, completing hourly time step simulations for 18 years in less than 5 sec per watershed on a standard PC. Validation against observed daily streamflow confirms that the model can capture small‐to‐large flood peaks and seasonal and annual water balance over these watersheds. Comparisons with the National Water Model show better performance in predicting flood peaks and overall water balance, underscoring the promises of our new framework for urban hydrologic modeling at large scales. Furthermore, analysis reveals nonlinear relationships between BUSNs' designed capacities and flood reduction effects. Our approach bridges the gap between detailed hydraulic and large‐scale hydrologic models, providing a valuable tool for urban flood prediction and management across broader spatial and temporal scales.

54 ENVIRONMENTAL SCIENCES↗