Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DATA 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 577 records · Page 32

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

E-center: A collaborative platform for wide area network users

The E-Center is a social collaborative web-based platform for assisting network users in understanding network conditions across network paths of interest to them. It is designed to give a user the necessary tools to isolate, identify, and resolve network performance-related problems. E-Center provides network path information on a link-by-link level, as well as from an end-to-end perspective. In addition to providing current and recent network path data, E-Center is intended to provide a social media environment for them to share issues, ideas, concerns, and problems. The product has a modular design that accommodates integration of other network services that make use of the same network path and performance data.

Grigoriev, M.↗

Detection of Stealthy False Data Injection Attacks in Unobservable Distribution Networks

In this paper, a composite scheme is proposed for detecting stealthy data manipulation attacks on distribution system which is unobservable with standard least squares based state estimators. This technique has three stages where the process of data imputation, voltage phasor estimation and the bad data detection are carried out in a systematic manner. The proposed approach is then integrated with moving target defense strategies which perturbs the network parameters to reveal stealthy false data injection attacks. The proposed approach is tested is validated on a three-phase, unbalanced 37-node distribution system and its results are presented. It is shown that the proposed approach has the ability to accurately detect the presence of FDI attacks using limited measurements (i.e., the test system is unobservable).

Rajasekaran, James K.↗

SU-E-T-52: Beam Data Comparison for 20 Linear Accelerators in One Network

Purpose: To compare photon beam data for the 20 Varian linear accelerators (TrueBeam, iX, and EX models) in use at five centers in the same network with the intent to model with one set of beam data in Eclipsec. Methods: Varian linear accelerators, TrueBeam (3), 21 EX, iX, and Trilogy (14), and 6 EX (3), installed between 1999 and 2014 have their 6 MV and 15 MV x-ray beams reevaluated. Full commissioning, including output factors (St), percent depth doses (PDD), and off-axis profiles, was recently performed for a TrueBeam with a cc04 ion chamber in an IBA Blue phantom. Similarly, a subset of beam data for each of the other accelerators was measured recently as follows: for 3×3, 10×10, and 30×30 cm{sup 2} field sizes, flatness and penumbra (80–20%) were measured at dmax and 10 cm depths, PDD were measured at 10 and 20 cm depths, and St were measured at 5 cm depth. Measurement results for all machines were compared. Results: For 15 high-energy (6 and 15 MV) and 3 low-energy machines (6MV only): 1) PDD agreed within 1.4% at 10 and 20 cm depths; 2) penumbra agreed within 1.0 mm at dmax and 10 cm depths; 3) flatness was within 1.3% at dmax and 10 cm depths; and 4) with exception of the three low energy machines, output factors were within 1.1% and 0.5% for 3×3 and 30×30 cm{sup 2}, respectively. Measurement uncertainty, not quantified here, accounts for some of these differences. Conclusion: Measured beam data from 15 high-energy Varian linacs are consistent enough that they can be classified using one beam data set in Eclipse. Two additional high-energy machines are removed from this group until their data are further confirmed. Three low-energy machines will be in a separate class based upon differences in output factors (St)

07 ISOTOPE AND RADIATION SOURCES↗

Network-based integration of systems genetics data reveals pathways associated with lignocellulosic biomass accumulation and processing

As a consequence of their remarkable adaptability, fast growth, and superior wood properties, eucalypt tree plantations have emerged as key renewable feedstocks (over 20 million ha globally) for the production of pulp, paper, bioenergy, and other lignocellulosic products. However, most biomass properties such as growth, wood density, and wood chemistry are complex traits that are hard to improve in long-lived perennials. Systems genetics, a process of harnessing multiple levels of component trait information (e.g., transcript, protein, and metabolite variation) in populations that vary in complex traits, has proven effective for dissecting the genetics and biology of such traits. We have applied a network-based data integration (NBDI) method for a systems-level analysis of genes, processes and pathways underlying biomass and bioenergy-related traits using a segregating Eucalyptus hybrid population. We show that the integrative approach can link biologically meaningful sets of genes to complex traits and at the same time reveal the molecular basis of trait variation. Gene sets identified for related woody biomass traits were found to share regulatory loci, cluster in network neighborhoods, and exhibit enrichment for molecular functions such as xylan metabolism and cell wall development. These findings offer a framework for identifying the molecular underpinnings of complex biomass and bioprocessing-related traits. Furthermore, a more thorough understanding of the molecular basis of plant biomass traits should provide additional opportunities for the establishment of a sustainable bio-based economy.

09 BIOMASS FUELS↗

Nonlinear Elasticity: From Single Chain to Networks and Gels

Biological and polymeric networks show highly nonlinear stress–strain behavior manifested in materials that stiffen with increasing deformation. Using a combination of the theoretical analysis and molecular dynamics simulations, we develop a model of network deformation that describes nonlinear mechanical properties of networks and gels by relating their macroscopic strain-hardening behavior to molecular parameters of the network strands. The starting point of our approach is a nonlinear force/elongation relation for discrete chains with varying bending rigidity. The derived expression for the network free energy is a universal function of the first deformation invariant and chain elongation ratio that depends on a ratio of the unperturbed chain size to chain dimension in a fully extended conformation. The model predictions for the nonlinear shear modulus and differential shear modulus for uniaxial and shear deformations are in very good agreement with both the results of molecular dynamics simulations of networks and with experimental data for biopolymer networks of actin, collagen, fibrin, vimentin, neurofilaments, and pectin.

Polymer Science↗

Data-driven recovery of hidden physics in reduced order modeling of fluid flows

In this article, we introduce a modular hybrid analysis and modeling (HAM) approach to account for hidden physics in reduced order modeling (ROM) of parameterized systems relevant to fluid dynamics. The hybrid ROM framework is based on using first principles to model the known physics in conjunction with utilizing the data-driven machine learning tools to model the remaining residual that is hidden in data. This framework employs proper orthogonal decomposition as a compression tool to construct orthonormal bases and Galerkin projection (GP) as a model to build the dynamical core of the system. Our proposed methodology hence compensates structural or epistemic uncertainties in models and utilizes the observed data snapshots to compute true modal coefficients spanned by these bases. The GP model is then corrected at every time step with a data-driven rectification using a long short-term memory (LSTM) neural network architecture to incorporate hidden physics. A Grassmannian manifold approach is also adopted for interpolating basis functions to unseen parametric conditions. The control parameter governing the system's behavior is thus implicitly considered through true modal coefficients as input features to the LSTM network. The effectiveness of the HAM approach is then discussed through illustrative examples that are generated synthetically to take hidden physics into account. Furthermore, our approach thus provides insights addressing a fundamental limitation of the physics-based models when the governing equations are incomplete to represent underlying physical processes.

42 ENGINEERING↗

HELIOSEISMOLOGY OF PRE-EMERGING ACTIVE REGIONS. I. OVERVIEW, DATA, AND TARGET SELECTION CRITERIA

This first paper in a series describes the design of a study testing whether pre-appearance signatures of solar magnetic active regions were detectable using various tools of local helioseismology. The ultimate goal is to understand flux-emergence mechanisms by setting observational constraints on pre-appearance subsurface changes, for comparison with results from simulation efforts. This first paper provides details of the data selection and preparation of the samples, each containing over 100 members, of two populations: regions on the Sun that produced a numbered NOAA active region, and a 'control' sample of areas that did not. The seismology is performed on data from the GONG network; accompanying magnetic data from SOHO/MDI are used for co-temporal analysis of the surface magnetic field. Samples are drawn from 2001-2007, and each target is analyzed for 27.7 hr prior to an objectively determined time of emergence. The results of two analysis approaches are published separately: one based on averages of the seismology- and magnetic-derived signals over the samples, another based on Discriminant Analysis of these signals, for a statistical test of detectable differences between the two populations. We include here descriptions of a new potential-field calculation approach and the algorithm for matching sample distributions over multiple variables. We describe known sources of bias and the approaches used to mitigate them. We also describe unexpected bias sources uncovered during the course of the study and include a discussion of refinements that should be included in future work on this topic.

79 ASTRONOMY AND ASTROPHYSICS↗

Convergence of Vehicle and Infrastructure Data for Traffic and Demand Management

The increasing availability of highly granular, vehicle trajectory data combined with ever increasing stores of roadway sensor data has provided unparalleled observability into the operation of our urban roadway networks. These data sources are quickly moving from research and prototype environments into full-scale commercial deployment and data offerings. The observability gained allows for increased control opportunities to enhance transportation mobility, safety and energy efficiency. The National Renewable Energy Laboratory (NREL) is involved in three initiatives to leverage these data for positive outcomes: 1) In 2015 NREL, in cooperation with industry and university partners, was awarded an ARPA-E research grant to research a control architecture to incentivize individual travelers toward more sustainable travel behavior. Based on real-time data on the traveler's destination and state of the system, the traveler is presented with route and/or mode choices and offered incentives to accept sustainable alternatives over less-sustainable ones. The project tests the extent to which small incentives can influence, or tip the balance toward more sustainable travel behavior. 2) Although commercial sources of travel time and speed have emerged in recent years based on vehicle probe data, volume estimates continue to rely primarily on historical count data factored for the time of day, day of week, and season of year. Real-time volume flows would enable better tools, simulation in the loop, and ultimately more effective control outcomes. NREL in cooperation with the University of Maryland and industry traffic data providers (INRIX, HERE and TomTom), are attempting to accelerate the timeframe to a viable real-time vehicle volume data feed based on probe data. 3) Signal control on urban arterials for years has had to rely on models rather than measured data to assess performance. High-resolution controller data and low-cost re-identification data now allows for direct measurement of the quality of progression along a corridor. Though still requiring an investment in equipment and communications, these data sources are transforming traffic signal management to a data driven, performance management basis. Ever increasing availability of granular GPS trace data from automobiles may allow for assessment of traffic signal performance, allowing for signal optimization while minimizing the investment in additional sensors and communication infrastructure.

33 ADVANCED PROPULSION SYSTEMS↗

Efficient Memory Access with NumPy Global Arrays using Local Memory Access

This paper discusses the work completed working with Global Arrays of data on distributed multi-computer systems and improving their performance. The tasks completed were done at Pacific Northwest National Laboratory in the Science Undergrad Laboratory Internship program in the summer of 2013 for the Data Intensive Computing Group in the Fundamental and Computational Sciences DIrectorate. This work was done on the Global Arrays Toolkit developed by this group. This toolkit is an interface for programmers to more easily create arrays of data on networks of computers. This is useful because scientific computation is often done on large amounts of data sometimes so large that individual computers cannot hold all of it. This data is held in array form and can best be processed on supercomputers which often consist of a network of individual computers doing their computation in parallel. One major challenge for this sort of programming is that operations on arrays on multiple computers is very complex and an interface is needed so that these arrays seem like they are on a single computer. This is what global arrays does. The work done here is to use more efficient operations on that data that requires less copying of data to be completed. This saves a lot of time because copying data on many different computers is time intensive. The way this challenge was solved is when data to be operated on with binary operations are on the same computer, they are not copied when they are accessed. When they are on separate computers, only one set is copied when accessed. This saves time because of less copying done although more data access operations were done.

Daily, Jeffrey A.↗

Learning Constitutive Relations From Soil Moisture Data via Physically Constrained Neural Networks

Abstract The constitutive relations of the Richardson‐Richards equation encode the macroscopic properties of soil water retention and conductivity. These soil hydraulic functions are commonly represented by models with a handful of parameters. The limited degrees of freedom of such soil hydraulic models constrain our ability to extract soil hydraulic properties from soil moisture data via inverse modeling. We present a new free‐form approach to learning the constitutive relations using physically constrained neural networks. We implemented the inverse modeling framework in a differentiable modeling framework, JAX, to ensure scalability and extensibility. For efficient gradient computations, we implemented implicit differentiation through a nonlinear solver for the Richardson‐Richards equation. We tested the framework against synthetic noisy data and demonstrated its robustness against varying magnitudes of noise and degrees of freedom of the neural networks. We applied the framework to soil moisture data from an upward infiltration experiment and demonstrated that the neural network‐based approach was better fitted to the experimental data than a parametric model and that the framework can learn the constitutive relations.

54 ENVIRONMENTAL SCIENCES↗

D2U: Data Driven User Emulation for the Enhancement of Cyber Testing, Training, and Data Set Generation

Whether testing intrusion detection systems, conducting training exercises, or creating data sets to be used by the broader cybersecurity community, realistic user behavior is a critical component of a cyber range. Existing methods either rely on network level data or replay recorded user actions to approximate real users in a network. Our work is the first to produce generative models trained on actual user data (sequences of application usage) collected on endpoints. Once trained to the user's behavioral data, these models can generate novel sequences of actions %that appear to come from the same distribution as the training data. These sequences of actions are then fed to our custom software via configuration files, which replicate those behaviors on end devices. Notably, our models are platform agnostic and could generate behavior data for any emulation software package. In this paper we present our model generation process, software architecture, and an initial evaluation of the fidelity of our models. Our software is currently deployed in a cyber range to help evaluate the efficacy of defensive cyber technologies. We suggest additional ways that the cyber community as a whole can benefit from more realistic user behavior emulation. The data used to train our model, as well as sample configuration files produced by the model, are available at [redacted].

Oesch, T↗

Developing Intensity-Duration-Frequency (IDF) Curves From Satellite-Based Precipitation: Methodology and Evaluation

Given the continuous advancement in the retrieval of precipitation from satellites, it is important to develop methods that incorporate satellite-based precipitation data sets in the design and planning of infrastructure. This is because in many regions around the world, in situ rainfall observations are sparse and have insufficient record length. A handful of studies examined the use of satellite-based precipitation to develop intensity-duration-frequency (IDF) curves; however, they have mostly focused on small spatial domains and relied on combining satellite-based with ground-based precipitation data sets. In this study, we explore this issue by providing a methodological framework with the potential to be applied in ungauged regions. This framework is based on accounting for the characteristics of satellite-based precipitation products, namely, adjustment of bias and transformation of areal to point rainfall. The latter method is based on previous studies on the reverse transformation (point to areal) commonly used to obtain catchment-scale IDF curves. The paper proceeds by applying this framework to develop IDF curves over the contiguous United States (CONUS); the data set used is Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks – Climate Data Record (PERSIANN-CDR). IDFs are then evaluated against National Oceanic and Atmospheric Administration (NOAA) Atlas 14 to provide a quantitative estimate of their accuracy. Results of this work show that median errors are in the range of (17–22%), (6–12%), and (3–8%) for one-day, two-day and three-day IDFs, respectively, and return periods in the range (2–100) years. Furthermore, a considerable percentage of satellite-based IDFs lie within the confidence interval of NOAA Atlas 14.

54 ENVIRONMENTAL SCIENCES↗

Reinforced dynamics for enhanced sampling in large atomic and molecular systems

A new approach for efficiently exploring the configuration space and computing the free energy of large atomic and molecular systems is proposed, motivated by an analogy with reinforcement learning. There are two major components in this new approach. Like metadynamics, it allows for an efficient exploration of the configuration space by adding an adaptively computed biasing potential to the original dynamics. Like deep reinforcement learning, this biasing potential is trained on the fly using deep neural networks, with data collected judiciously from the exploration and an uncertainty indicator from the neural network model playing the role of the reward function. Parameterization using neural networks makes it feasible to handle cases with a large set of collective variables. This has the potential advantage that selecting precisely the right set of collective variables has now become less critical for capturing the structural transformations of the system. Finally, the method is illustrated by studying the full-atom explicit solvent models of alanine dipeptide and tripeptide, as well as the system of a polyalanine-10 molecule with 20 collective variables.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Characterizing system dynamics with a weighted and directed network constructed from time series data

In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning of networked spreading models from noisy and incomplete data

Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, in this work, we introduce a universal learning method based on a scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.

97 MATHEMATICS AND COMPUTING↗

Probabilistic neural networks for fluid flow surrogate modeling and data recovery

We consider the use of probabilistic neural networks for fluid flow surrogate modeling and data recovery. This framework is constructed by assuming that the target variables are sampled from a Gaussian distribution conditioned on the inputs. Consequently, the overall formulation sets up a procedure to predict the hyperparameters of this distribution which are then used to compute an objective function given training data. We demonstrate that this framework has the ability to provide for prediction confidence intervals based on the assumption of a probabilistic posterior, given an appropriate model architecture and adequate training data. The applicability of the present framework to cases with noisy measurements and limited observations is also assessed. To demonstrate the capabilities of this framework, we consider canonical regression problems of fluid dynamics from the viewpoint of reduced-order modeling and spatial data recovery for four canonical data sets. The examples considered in this study arise from (i) the shallow-water equations, (ii) a two-dimensional cylinder flow, (iii) the wake of a NACA0012 airfoil with a Gurney flap, and (iv) the NOAA sea surface temperature data set. Furthermore, the present results indicate that the probabilistic neural network not only produces a machine-learning-based fluid flow surrogate model but also systematically quantifies the uncertainty therein to assist with model interpretability.

42 ENGINEERING↗

Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies

This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage–power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50 % reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50–250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75 % of N-2 contingency network structures, even without historical N-2 outage data. Furthermore, the proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗