Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic graph”

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 757 records · Page 42

Stability of Kuramoto networks subject to large and small fluctuations from heterogeneous and spatially correlated noise

Oscillatory networks subjected to noise are broadly used to model physical and technological systems. Due to their nonlinear coupling, such networks typically have multiple stable and unstable states that a network might visit due to noise. In this article, we focus on the assessment of fluctuations resulting from heterogeneous and spatially correlated noise inputs on Kuramoto model networks. We evaluate the typical, small fluctuations near synchronized states and connect the network variance to the overlap between stable modes of synchronization and the input noise covariance. Going beyond small to large fluctuations, we introduce the indicator mode approximation that projects the dynamics onto a single amplitude dimension. Such an approximation allows for estimating rates of fluctuations to saddle instabilities, resulting in phase slips between connected oscillators. Statistics for both regimes are quantified in terms of effective noise amplitudes that are compared and contrasted for several noise models. In conclusion, bridging the gap between small and large fluctuations, we show that a larger network variance does not necessarily lead to higher rates of large fluctuations.

42 ENGINEERING↗

Aggregation Processes on Networks: Deterministic Equations, Stochastic Model and Numerical Simulation

We introduce an infinite system of equations modeling the time evolution of the growth process of a network. The nodes are characterized by their degree k(set-membership sign)N and a fitness parameter f(set-membership sign)[0,h]. Every new node which emerges becomes a fitness f' according to a given distribution P and attaches to an existing node with fitness f and degree k at rate fA{sub k}, where A{sub k} are positive coefficients, growing sub-linearly in k. If the parameter f takes only one value, the dynamics of this process can be described by a variant of the Becker-Doering equations, where the l growth of the size of clusters of size k occurs only with increment 1. In contrast l to the established Becker-Doering equations, the system considered here is nonconservative, since mass (i.e. links) is continuously added. Nevertheless, it has the property of linearity, which is a natural consequence of the process which is being modeled. The purpose of this paper is to construct a solution of the system based on a stochastic approximation algorithm, which allows also a numerical simulation in order to get insight into its qualitative behaviour. In particular we show analytically and numerically the property of Bose-Einstein condensation, which was observed in the literature on random graphs and which can be described as an emergence of a huge cluster which captures a macroscopic fraction of the total link density.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Affect of Brush Seals on Wave Rotor Performance Assessed

The NASA Lewis Research Center's experimental and theoretical research shows that wave rotor topping can significantly enhance gas turbine engine performance levels. Engine-specific fuel consumption and specific power are potentially enhanced by 15 and 20 percent, respectively, in small (e.g., 400 to 700 hp) and intermediate (e.g., 3000 to 5000 hp) turboshaft engines. Furthermore, there is potential for a 3- to 6-percent specific fuel consumption enhancement in large (e.g., 80,000 to 100,000 lbf) turbofan engines. This wave-rotor-enhanced engine performance is accomplished within current material-limited temperature constraints. The completed first phase of experimental testing involved a three-port wave rotor cycle in which medium total pressure inlet air was divided into two outlet streams, one of higher total pressure and one of lower total pressure. The experiment successfully provided the data needed to characterize viscous, partial admission, and leakage loss mechanisms. Statistical analysis indicated that wave rotor product efficiency decreases linearly with the rotor to end-wall gap, the square of the friction factor, and the square of the passage of nondimensional opening time. Brush seals were installed to further minimize rotor passage-to-cavity leakage. The graph shows the effect of brush seals on wave rotor product efficiency. For the second-phase experiment, which involves a four-port wave rotor cycle in which heat is added to the Brayton cycle in an external burner, a one-dimensional design/analysis code is used in conjunction with a wave rotor performance optimization scheme and a two-dimensional Navier-Stokes code. The purpose of the four-port experiment is to demonstrate and validate the numerically predicted four-port pressure ratio versus temperature ratio at pressures and temperatures lower than those that would be encountered in a future wave rotor/demonstrator engine test. Lewis and the Allison Engine Company are collaborating to investigate wave rotor integration in an existing turboshaft engine. Recent theoretical efforts include simulating wave rotor dynamics (e.g., startup and load-change transient analysis), modifying the one-dimensional wave rotor code to simulate combustion internal to the wave rotor, and developing an analytical wave rotor design/analysis tool based on macroscopic balances for parametric wave rotor/engine analysis.

Source record↗

Structural inference of networked dynamical systems with universal differential equations

Networked dynamical systems are common throughout science in engineering; e.g., biological networks, reaction networks, power systems, and the like. For many such systems, nonlinearity drives populations of identical (or near-identical) units to exhibit a wide range of nontrivial behaviors, such as the emergence of coherent structures (e.g., waves and patterns) or otherwise notable dynamics (e.g., synchrony and chaos). Here, we seek to infer (i) the intrinsic physics of a base unit of a population, (ii) the underlying graphical structure shared between units, and (iii) the coupling physics of a given networked dynamical system given observations of nodal states. These tasks are formulated around the notion of the Universal Differential Equation, whereby unknown dynamical systems can be approximated with neural networks, mathematical terms known a priori (albeit with unknown parameterizations), or combinations of the two. We demonstrate the value of these inference tasks by investigating not only future state predictions but also the inference of system behavior on varied network topologies. The effectiveness and utility of these methods are shown with their application to canonical networked nonlinear coupled oscillators.

97 MATHEMATICS AND COMPUTING↗

Utah FORGE: Stress Logging Data

This spreadsheet consist of data and graphs from deep well 58-32 stress testing from 6900 - 7500 ft depth. Measured stress data were used to correct logging predictions of in situ stress. Stress plots shows pore pressure (measured during the injection testing), the total vertical in situ stress (determined from the density logging) and the total maximum and minimum horizontal stresses. The horizontal stresses were determined from the DSI (Dipole Sonic Imager) and corrected to match the direct measurements.

15 GEOTHERMAL ENERGY↗

Quantum walks on a random environment

Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is contrasted with the decoherence effect of dynamic disorder having strength W, where a quantum to classical crossover at time t{sub c}{proportional_to}W{sup -2} transforms the quantum walk into an ordinary random walk with diffusive spreading. We demonstrate these localization and decoherence phenomena in quantum carpets of the observed time evolution, we relate our results to previously studied models of decoherence for quantum walks, and examine in detail a dimer lattice which corresponds to a single qubit subject to randomness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Regional Rates of Young US Forest Growth Estimated From Annual Landsat Disturbance History and IKONOS Stereo Imagery

Forests of the Contiguous United States (CONUS) have been found to be a large contributor to the global atmospheric carbon sink. The magnitude and nature of this sink is still uncertain and recent studies have sought to define the dynamics that control its strength and longevity. The Landsat series of satellites has been a vital resource to understand the long-term changes in land cover that can impact ecosystem function and terrestrial carbonstock. We combine annual Landsat forest disturbance history from 1985 to 2011 with single date IKONOS stereoimagery to estimate the change in young forest canopy height and above ground live dry biomass accumulation for selected sites in the CONUS. Our approach follows an approximately linear growth rate following clearing over short intervals and does not estimate the distinct non-linear growth rate over longer intervals.We produced canopy height models by differencing digital surface models estimated from IKONOS stereo pairs with national elevation data (NED). Correlations between height and biomass were established independently using airborne LiDAR, and then applied to the IKONOS-estimated canopy height models. Graphing current biomass against time since disturbance provided biomass accumulation rates. For 20 study sites distributed across five regions of the CONUS, 19 showed statistically significant recovery trends (p is less than 0.001) with canopy growth from 0.26 m yr-1to 0.73 m yr-1. Above ground live dry biomass (AGB) density accumulation ranged from 1.31 t/ha yr-1 to 12.47 t/ha yr-1. Mean forest AGB accumulationwas 6.31 t/ha yr-1 among all sites with significant growth trends. We evaluated the accuracy of our estimates by comparing to field estimated site index curves of growth, airborne LiDAR data, and independent model predictions of C accumulation. Growth estimates found with this approach are consistent with site index curves and total biomass estimates fall within the range of field estimates. This is aviable approach to estimate forest biomass accumulation in regions with clear-cut harvest disturbances.

Neigh, Christopher S. R.↗

Potential Use of a Bayesian Network for Discriminating Flash Type from Future GOES-R Geostationary Lightning Mapper (GLM) data

Continuous monitoring of the ratio of cloud flashes to ground flashes may provide a better understanding of thunderstorm dynamics, intensification, and evolution, and it may be useful in severe weather warning. The National Lighting Detection Network TM (NLDN) senses ground flashes with exceptional detection efficiency and accuracy over most of the continental United States. A proposed Geostationary Lightning Mapper (GLM) aboard the Geostationary Operational Environmental Satellite (GOES-R) will look at the western hemisphere, and among the lightning data products to be made available will be the fundamental optical flash parameters for both cloud and ground flashes: radiance, area, duration, number of optical groups, and number of optical events. Previous studies have demonstrated that the optical flash parameter statistics of ground and cloud lightning, which are observable from space, are significantly different. This study investigates a Bayesian network methodology for discriminating lightning flash type (ground or cloud) using the lightning optical data and ancillary GOES-R data. A Directed Acyclic Graph (DAG) is set up with lightning as a "root" and data observed by GLM as the "leaves." This allows for a direct calculation of the joint probability distribution function for the lighting type and radiance, area, etc. Initially, the conditional probabilities that will be required can be estimated from the Lightning Imaging Sensor (LIS) and the Optical Transient Detector (OTD) together with NLDN data. Directly manipulating the joint distribution will yield the conditional probability that a lightning flash is a ground flash given the evidence, which consists of the observed lightning optical data [and possibly cloud data retrieved from the GOES-R Advanced Baseline Imager (ABI) in a more mature Bayesian network configuration]. Later, actual GLM and NLDN data can be used to refine the estimates of the conditional probabilities used in the model; i.e., the Bayesian network is a learning network. Methods for efficient calculation of the conditional probabilities (e.g., an algorithm using junction trees), finding data conflicts, goodness of fit, and dealing with missing data will also be addressed.

Solakiewiz, Richard↗

Computationally efficient characterization of potential energy surfaces based on fingerprint distances

An analysis of the network defined by the potential energy minima of multi-atomic systems and their connectivity via reaction pathways that go through transition states allows us to understand important characteristics like thermodynamic, dynamic, and structural properties. Unfortunately computing the transition states and reaction pathways in addition to the significant energetically low-lying local minima is a computationally demanding task. We here introduce a computationally efficient method that is based on a combination of the minima hopping global optimization method and the insight that uphill barriers tend to increase with increasing structural distances of the educt and product states. This method allows us to replace the exact connectivity information and transition state energies with alternative and approximate concepts. Without adding any significant additional cost to the minima hopping global optimization approach, this method allows us to generate an approximate network of the minima, their connectivity, and a rough measure for the energy needed for their interconversion. This can be used to obtain a first qualitative idea on important physical and chemical properties by means of a disconnectivity graph analysis. Besides the physical insight obtained by such an analysis, the gained knowledge can be used to make a decision if it is worthwhile or not to invest computational resources for an exact computation of the transition states and the reaction pathways. Furthermore it is demonstrated that the here presented method can be used for finding physically reasonable interconversion pathways that are promising input pathways for methods like transition path sampling or discrete path sampling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

Multi-stream inflation in a landscape

There are hidden observables for inflation, such as features localized in position space, which do not manifest themselves when only one inflation trajectory is considered. To address this issue, we investigate inflation dynamics in a landscape mimicked by a random potential. We calculate the probability for bifurcation of the inflation trajectory in multi-stream inflation. Depending on the shape of the random bumps and the distance between bumps in the potential, there is a phase transition: on one side of the critical curve in parameter space isocurvature fluctuation are exponentially amplified and bifurcation becomes very probable. On the other side bifurcation is dominated by a random walk where bifurcations are less likely to happen.

79 ASTRONOMY AND ASTROPHYSICS↗

Structural Properties of [N1888][TFSI] Ionic Liquid: A Small Angle Neutron Scattering and Polarizable Molecular Dynamics Study

In this study, we investigate the quaternary ammonium-based ionic liquid (QAIL), methyltrioctylammonium bis(trifluoromethylsulfonyl)imide, [N 1888 ][TFSI], utilizing small angle neutron scattering (SANS) measurements and polarizable molecular dynamics (MD) simulations to characterize the shortand long-range liquid structure. Scattering structure factors show signatures of three length scales in reciprocal space indicative of alternating polarity (k ~ 0.44 Å –1 ), charge (k ~ 0.75 Å –1 ), and neighboring or adjacent (k ~ 1.46 Å –1 ) domains. Excellent agreement between simulation and experimental scattering structure factors validates various simulation analyses that provide detailed atomistic characterization of the different length scale correlations. The first solvation shell structure is illustrated by obtaining radial, angular, dihedral, and combined distribution functions, where two dominant spatial motifs, N + ···N – and N + ···O – , compete for optimal packing around the polar head of the [N 1888 ] + cation. Intermediate and long-range structures are governed by the balance between local electroneutrality and octyl chain networking, respectively. By computing the charge-correlation structure factor, S ZZ , and the spatial extent of the octyl chain network using graph theory, the bulk-phase structure of [N 1888 ][TFSI] is characterized in terms of electrostatic screening and apolar domain formation length scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗

Digital Twin for Optimizing Real-time Economy of the Integrated Energy Systems

Economic and safe operation of integrated energy systems (IES) requires real-time optimization (RTO) of the control and actions conducted on each system component. In this regard, digital twins (DTs), which consist of a physical system, a virtual system, and the data communication that occurs between the two, are essential for effective RTO. Through the data warehouse, the virtual system is constantly updated with real-time data from the physical system, and functions as the model in the optimization framework. The reduced-order model of the dynamic process model in the virtual system is used in the optimization framework. The optimization results are then returned, via the data warehouse, as control actions to the physical system. This work demonstrates the software capabilities of DT assets for an IES in the context of preparing a DT for an experimental system comprised of Idaho National Laboratory (INL)’s Thermal Energy Delivery System and battery system. For the virtual demonstration, the DTs encompass (1) a physical system, including the Modelica models of the Thermal Energy Delivery System and the battery system; (2) virtual optimization via the Optimization of Real-Time Capacity Allocation (ORCA) platform; and (3) the open-source data warehouse software DeepLynx. This work assesses the performance of ORCA, which utilizes a reduced-order model built using the Risk Analysis Virtual Environment (RAVEN) and trained on the Modelica models and real-time data pipeline through the graph database hosted in DeepLynx. The proposed optimization workflow will be an RTO model based on DTs and the data they generate.

25 ENERGY STORAGE↗

Direct numerical simulations of agglomeration of circular colloidal particles in two-dimensional shear flow

Colloidal agglomeration of nanoparticles in shear flow is investigated by solving the fluid-particle and particle-particle interactions in a 2D system. We use an extended finite element method in which the dynamics of the particles is solved in a fully coupled manner with the flow, allowing an accurate description of the fluid-particle interfaces without the need of boundary-fitted meshes or of empirical correlations to account for the hydrodynamic interactions between the particles. Adaptive local mesh refinement using a grid deformation method is incorporated with the fluid-structure interaction algorithm, and the particle-particle interaction at the microscopic level is modeled using the Lennard-Jones potential. Motivated by the process used in fabricating fuel cell catalysts from a colloidal ink, the model is applied to investigate agglomeration of colloidal particles under external shear flow in a sliding bi-periodic Lees-Edwards frame with varying shear rates and particle fraction ratios. Both external shear and particle fraction are found to have a crucial impact on the structure formation of colloidal particles in a suspension. Segregation intensity and graph theory are used to analyze the underlying agglomeration patterns and structures, and three agglomeration regimes are identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Seagrass Health Modeling and Prediction with NASA Science Data

Previous research has demonstrated that MODIS data products can be used as inputs into the seagrass productivity model developed by Fong and Harwell (1994). To further explore this use to predict seagrass productivity, Moderate Resolution Imaging Spectroradiometer (MODIS) custom data products, including Sea Surface Temperature, Light Attenuation, and Chlorophyll-a have been created for use as model parameter inputs. Coastal researchers can use these MODIS data products and model results in conjunction with historical and daily assessment of seagrass conditions to assess variables that affect the productivity of the seagrass beds. Current monitoring practices involve manual data collection (typically on a quarterly basis) and the data is often insufficient for evaluating the dynamic events that influence seagrass beds. As part of a NASA-funded research grant, the University of Mississippi, is working with researchers at NASA and Radiance Technologies to develop methods to deliver MODIS derived model output for the northern Gulf of Mexico (GOM) to coastal and environmental managers. The result of the project will be a data portal that provides access to MODIS data products and model results from the past 5 years, that includes an automated process to incorporate new data as it becomes available. All model parameters and final output will be available through the use National Oceanic and Atmospheric Administration?s (NOAA) Environmental Research Divisions Data Access Program (ERDDAP) tools as well as viewable using Thematic Realtime Environmental Distributed Data Services (THREDDS) and the Integrated Data Viewer (IDV). These tools provide the ability to create raster-based time sequences of model output and parameters as well as create graphs of model parameters versus time. This tool will provide researchers and coastal managers the ability to analyze the model inputs so that the factors influencing a change in seagrass productivity can be determined over time.

Robinson, Harold D.↗

XScan: An Integrated Tool for Understanding Open Source Community-Based Scientific Code

Many scientific communities have adopted community-based models that integrate multiple components to simulate whole system dynamics. The community software projects’ complexity, stems from the integration of multiple individual software components that were developed under different application requirements and various machine architectures, has become a challenge for effective software system understanding and continuous software development. The paper presents an integrated software toolkit called X-ray Software Scanner (in abbreviation, XScan) for a better understanding of large-scale community-based scientific codes. Our software tool provides support to quickly summarize the overall information of scientific codes, including the number of lines of code, programming languages, external library dependencies, as well as architecture-dependent parallel software features. The XScan toolkit also realizes a static software analysis component to collect detailed structural information and provides an interactive visualization and analysis of the functions. We use a large-scale community-based Earth System Model to demonstrate the workflow, functions and visualization of the toolkit. We also discuss the application of advanced graph analytics techniques to assist software modular design and component refactoring.

Zheng, Weijian↗

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗