Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex 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 1,225 records · Page 68

Developing and Testing a Physics Guided Machine Learning NeuralNetwork to Predict Tonal Noise Emitted by a Propeller

Artificial neural networks offer a highly nonlinear and adaptive model for predicting complex interactions between input-output parameters. However, these networks require large datasets which often exceed practical considerations in modeling experimental results. To alleviate the dataset size requirement, a method known as physics guided machine learning has been applied to construct several neural networks for predicting propeller tonal noise in the time domain over a broad range of flight conditions. Three space-filling designs, namely, Latin-Hypercube, Sphere-Packing, and Grid-Space, were used to distribute points throughout the input parameter space encompassing nondimensional flight conditions and observer geometry. Each neural network’s performance was validated by conditions outside of the training set and compared to the Propeller Analysis System tool from the NASA Aircraft Noise Prediction Program. Compared to the Grid-Space input design, the Latin-Hypercube and the Sphere-Packing designs provided a better representation of the domain for training. Regarding the network archetype, a fully connected perceptron was found to outperform the partially connected perceptron in their ability to predict tonal noise for small datasets. The black-box nature of these neural networks was also explored to understand how the networks constructed the waveform and understand why some network designs produce better models.

Propeller noise↗

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The hierarchical organization of autocatalytic reaction networks and its relevance to origin of life

Abiogenesis has long been suspected to require that chemical reaction networks contain multiple autocatalytic cores, but little is known about what features of these networks allow for the gradual accretion of complexity. To identify realistic scenarios for the emergence of life-like properties, we develop the concept of a seed-dependent autocatalytic system (SDAS), which is a subnetwork that can autocatalytically self-maintain given a flux of food, but cannot be initiated by food alone. Rather, initiation of SDASs requires the transient introduction of chemical “seeds”. We show that, depending on the topological relationship of SDASs in a chemical reaction network, a food-driven system can accrete complexity in a historically contingent manner, governed by rare seeding events. We develop new algorithms for detecting and analyzing SDASs in chemical reaction databases and describe parallels between multi-SDAS networks and biological ecosystems. Applying our algorithms to both an abiotic reaction network and a biochemical one, each driven by a set of simple food chemicals, we detect SDASs that are organized as trophic tiers, of which the higher tier can be seeded by relatively simple chemicals if the lower tier is already activated. This indicates that sequential activation of trophically organized SDASs by seed chemicals that are not much more complex than what already exist could be a mechanism of gradual complexification from relatively simple abiotic reactions to more complex life-like systems. Interestingly, in both reaction networks, higher-tier SDASs include chemicals that might alter emergent features of chemical systems and could serve as early targets of selection. Our analysis provides computational tools for analyzing very large chemical/biochemical reaction networks and suggests new approaches to studying abiogenesis in the lab.

Zhen Peng↗

Deep Learning Emulation of Atmospheric Correction for Geostationary Sensors

New generation geostationary satellites make reflectance observations available at a continental scale with unprecedented spatiotemporal resolution and spectral range. Generating Earth monitoring products from these observations requires retrieval of the basic parameter, surface reflectance (SR), by atmospheric correction (AC). Algorithms for atmospheric correction, including Multi-Angle Implementation of Atmospheric Correction (MAIAC), are adapted for each sensor and are too computationally complex to be run in real time, relying instead on look-up tables with precomputed values. Machine learning methods, including convolutional neural networks, have demonstrated performance in learning complex, nonlinear mappings and extracting insight from high-dimensional remote sensing data. In this work, we present a deep learning emulator of MAIAC to retrieve both SR and cloud products. Using this adaptation of deep learning-based emulation to remote sensing, we demonstrate stable SR retrieval over a variety of land covers and viewing conditions and accurate cloud detection. Further, a comparison of computation time suggests emulation as a compelling alternative for expensive physical simulation, especially for applications benefited by near-real time data, such as agricultural management and disaster response.

Duffy, Kate↗

The tight junction protein ZO-2 and Janus kinase 1 mediate intercellular communications in vascular smooth muscle cells

Highlights: {yields} The tight junction protein ZO-2 associates with Jak1 in vascular smooth muscle cells via ZO-2 N-terminal fragment. {yields} Jak1 mediates ZO-2 tyrosine phosphorylation and ZO-2 localization to the sites of homotypic intercellular contacts. {yields} The urokinase receptor uPAR regulates ZO-2/Jak1 functional association. {yields} The ZO-2/Jak1/uPAR signaling complex is required for vascular smooth muscle cells functional network formation. -- Abstract: Recent evidence points to a multifunctional role of ZO-2, the tight junction protein of the MAGUK (membrane-associated guanylate kinase-like) family. Though ZO-2 has been found in cell types lacking tight junction structures, such as vascular smooth muscle cells (VSMC), little is known about ZO-2 function in these cells. We provide evidence that ZO-2 mediates specific homotypic cell-to-cell contacts between VSMC. Using mass spectrometry we found that ZO-2 is associated with the non-receptor tyrosine kinase Jak1. By generating specific ZO-2 constructs we further found that the N-terminal fragment of ZO-2 molecule is responsible for this interaction. Adenovirus-based expression of Jak1 inactive mutant demonstrated that Jak1 mediates ZO-2 tyrosine phosphorylation. By means of RNA silencing, expression of Jak1 mutant form and fluorescently labeled ZO-2 fusion protein we further specified that active Jak1, but not Jak1 inactive mutant, mediates ZO-2 localization to the sites of intercellular contacts. We identified the urokinase receptor uPAR as a pre-requisite for these cellular events. Functional requirement of the revealed signaling complex for VSMC network formation was confirmed in experiments using Matrigel and in contraction assay. Our findings imply involvement of the ZO-2 tight junction independent signaling complex containing Jak1 and uPAR in VSMC intercellular communications. This mechanism may contribute to vascular remodeling in occlusive cardiovascular diseases and in arteriogenesis.

60 APPLIED LIFE SCIENCES↗

Evolutionary Variation in MADS Box Dimerization Affects Floral Development and Protein Abundance in Maize

Interactions between MADS-box transcription factors are critical in the regulation of floral development, and shifting MADS-box protein-protein interactions are predicted to have influenced floral evolution. However, precisely how evolutionary variation in protein-protein interactions affects MADS-box protein function remains unknown. To assess the impact of changing MADS-box protein-protein interactions on transcription factor function, we turned to the grasses, where interactions between B-class MADS-box proteins vary. We tested the functional consequences of this evolutionary variability using maize as an experimental system. We found that differential B-class dimerization was associated with subtle, quantitative differences in stamen shape. In contrast, differential dimerization resulted in large-scale changes to downstream gene expression. Differential dimerization also affected B-class complex composition and abundance, independent of transcript levels. This indicates that differential B-class dimerization affects protein degradation, revealing an important consequence for evolutionary variability in MADS-box interactions. Our results highlight complexity in the evolution of developmental gene networks - changing protein-protein interactions could affect not only the composition of transcription factor complexes, but also their degradation and persistence in developing flowers. Here, our results also show how coding change in a pleiotropic master regulator could have small, quantitative effects on development.

59 BASIC BIOLOGICAL SCIENCES↗

Functional and transcriptional characterization of complex neuronal co-cultures

Brain-on-a-chip systems are designed to simulate brain activity using traditional in vitro cell culture on an engineered platform. It is a noninvasive tool to screen new drugs, evaluate toxicants, and elucidate disease mechanisms. However, successful recapitulation of brain function on these systems is dependent on the complexity of the cell culture. In this study, we increased cellular complexity of traditional (simple) neuronal cultures by co-culturing with astrocytes and oligodendrocyte precursor cells (complex culture). We evaluated and compared neuronal activity (e.g., network formation and maturation), cellular composition in long-term culture, and the transcriptome of the two cultures. Compared to simple cultures, neurons from complex co-cultures exhibited earlier synapse and network development and maturation, which was supported by localized synaptophysin expression, up-regulation of genes involved in mature neuronal processes, and synchronized neural network activity. Also, mature oligodendrocytes and reactive astrocytes were only detected in complex cultures upon transcriptomic analysis of age-matched cultures. Functionally, the GABA antagonist bicuculline had a greater influence on bursting activity in complex versus simple cultures. Collectively, the cellular complexity of brain-on-a-chip systems intrinsically develops cell type-specific phenotypes relevant to the brain while accelerating the maturation of neuronal networks, important features underdeveloped in traditional cultures.

59 BASIC BIOLOGICAL SCIENCES↗

Advanced bandwidth scheduling algorithms in dedicated networks

An increasing number of high performance research network testbeds and production networks have the capability of provisioning dedicated channels for high speed data transfer in support of large scale scientific applications. Each dedicated channel in these networks typically consists of one or more physical links that are shared by multiple applications in both time and bandwidth through in advance reservation. The design of efficient bandwidth scheduling algorithms is critical to maximizing the utilization of dedicated network resources and meeting diverse end-to-end transport performance requirements. The topology of a dedicated network is represented by a graph, where each link maintains a list of residual bandwidths specified as segmented constant functions of time. Given a graph with an aggregated time-bandwidth table combining the reservation information on all links, designated source, and destination vertices, and a specified data size, we formulate and investigate five bandwidth scheduling problems to minimize the data transfer end time under different path and bandwidth constraints. (1) variable path with variable bandwidth (VPVB), which computes the widest (highest bandwidth) path in each time slot; (2) fixed path with variable bandwidth (FPVB), which computes a fixed path with varying bandwidths across different time slots; (3) variable path with fixed bandwidth (VPFB), which computes one path in each time slot with the same bandwidth; (4) fixed path with fixed bandwidth (FPFB), which computes a fixed path with a constant bandwidth; and (5) multiple fixed paths with fixed bandwidths (MFPFB), which computes multiple concurrent fixed paths with constant bandwidths. Among these problems, VPVB represents the most flexible scenario where the network resources are fully utilized and the minimal transfer end time is achieved, while FPFB imposes the most stringent transport conditions by fixing both path and bandwidth. We design an optimal algorithm for each of these scheduling problems. VPVB is solved using an extension of the classical Dijkstra's algorithm, and FPVB is solved using Maximum Permutation Algorithm, which tries all possible permutations of throughputs at different time slots to obtain the minimal transfer end time. The algorithm for VPFB, FPFB, and MFPFB are based on Adjacent Time Slots Search, which finds the minimum transfer end time by examining the possibility of data transfer in any number of contiguous time slots. All these algorithms are of polynomial or pseudo polynomial time complexity with respect to the network size and the total number of time slots in a bandwidth reservation table.

99 GENERAL AND MISCELLANEOUS↗

DART 7.0 User Guide

The Desktop Analysis Reporting Tool (DART) is a software package that allows users to easily view and analyze daily files that span long periods. DART gives users the capability to quickly determine the state of health of a radiation portal monitor (RPM), troubleshoot and diagnose problems, and view data in various time frames to perform trend analysis. In short, it converts the data strings written in the daily files into meaningful tables and plots. The standalone version of DART (“soloDART”) utilizes a database engine that is included with the application; no additional installations are necessary. There is also a networked version of DART (“polyDART”) that is designed to maximize the benefit of a centralized data repository while distributing the workload to individual desktop machines. This networked approach requires a more complex database manager Structured Query Language (SQL) Server; however, SQL Server is not currently provided with DART. Regardless of which version is used, DART will import daily files from RPMs, store the relevant data in its database, and it can produce reports for status, trend analysis, and reporting purposes.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Expandable Li Percolation Network: The Effects of Site Distortion in Cation-Disordered Rock-Salt Cathode Material

Cation-disordered rock-salt (DRX) materials receive intensive attention as a new class of cathode candidates for high-capacity lithium-ion batteries (LIBs). Unlike traditional layered cathode materials, DRX materials have a three-dimensional (3D) percolation network for Li + transportation. The disordered structure poses a grand challenge to a thorough understanding of the percolation network due to its multiscale complexity. In this work, we introduce the large supercell modeling for DRX material Li 1.16 Ti 0.37 Ni 0.37 Nb 0.10 O 2 (LTNNO) via the reverse Monte Carlo (RMC) method combined with neutron total scattering. Here, through a quantitative statistical analysis of the material’s local atomic environment, we experimentally verified the existence of short-range ordering (SRO) and uncovered an element-dependent behavior of transition metal (TM) site distortion. A displacement from the original octahedral site for Ti 4+ cations is pervasive throughout the DRX lattice. Density functional theory (DFT) calculations revealed that site distortions quantified by the centroid offsets could alter the migration barrier for Li + diffusion through the tetrahedral channels, which can expand the previously proposed theoretical percolating network of Li. The estimated accessible Li content is highly consistent with the observed charging capacity. The newly developed characterization method here uncovers the expandable nature of the Li percolation network in DRX materials, which may provide valuable guidelines for the design of superior DRX materials.

25 ENERGY STORAGE↗

Graph network heterogeneity predicts interplant wake losses

Wind plants generate large-scale wakes, which can affect the performance of neighboring installations. Such wakes are challenging to estimate due to the inherent complexity in modeling wake interactions between large quantities of turbines at various distances. Weighted directed graph networks can inform complex models by linking turbine pairs into chains of upstream and downstream neighbors for a given wind direction. A novel interpretation of the graph network adjacency matrix is proposed where each element of the matrix represents the cumulative impact of upstream turbines on an individual. In this study, wake losses were estimated with an engineering wake model across a range of inflow conditions for nine parametric variations of a system containing two neighboring wind plants. The parametric nature of the study isolates turbine spacing within the plant, separation distance between plants, and wind direction as the main drivers of wake losses. Spatial heterogeneity is computed from the weighted average adjacency matrix of each plant arrangement. The proposed method is orders of magnitude faster than wake modeling and does not require detailed turbine information or atmospheric conditions. Furthermore, the weighted average adjacency matrix provides insight on the spatial organization of wake losses at various scales. Plant heterogeneity is correlated with wake losses within and among plants. Framing wind plant wake interaction in terms of graph network spatial heterogeneity provides an efficient approach for predicting wake losses within and among neighboring wind plants with applications to other complex systems where wake interactions are key factor.

17 WIND ENERGY↗

Optical techniques to feed and control GaAs MMIC modules for phased array antenna applications

A complex signal distribution system is required to feed and control GaAs monolithic microwave integrated circuits (MMICs) for phased array antenna applications above 20 GHz. Each MMIC module will require one or more RF lines, one or more bias voltage lines, and digital lines to provide a minimum of 10 bits of combined phase and gain control information. In a closely spaced array, the routing of these multiple lines presents difficult topology problems as well as a high probability of signal interference. To overcome GaAs MMIC phased array signal distribution problems optical fibers interconnected to monolithically integrated optical components with GaAs MMIC array elements are proposed as a solution. System architecture considerations using optical fibers are described. The analog and digital optical links to respectively feed and control MMIC elements are analyzed. It is concluded that a fiber optic network will reduce weight and complexity, and increase reliability and performance, but higher power will be required.

Bhasin, K. B.↗

Optical techniques to feed and control GaAs MMIC modules for phased array antenna applications

A complex signal distribution system is required to feed and control GaAs monolithic microwave integrated circuits (MMICs) for phased array antenna applications above 20 GHz. Each MMIC module will require one or more RF lines, one or more bias voltage lines, and digital lines to provide a minimum of 10 bits of combined phase and gain control information. In a closely spaced array, the routing of these multiple lines presents difficult topology problems as well as a high probability of signal interference. To overcome GaAs MMIC phased array signal distribution problems optical fibers interconnected to monolithically integrated optical components with GaAs MMIC array elements are proposed as a solution. System architecture considerations using optical fibers are described. The analog and digital optical links to respectively feed and control MMIC elements are analyzed. It is concluded that a fiber optic network will reduce weight and complexity, and increase reliability and performance, but higher power will be required.

Bhasin, K. B.↗

Quantifying uncertainties on fission fragment mass yields with mixture density networks

Probabilistic machine learning techniques can learn both complex relations between input features and output quantities of interest as well as take into account stochasticity or uncertainty within a data set. In this initial work, we explore the use of one such probabilistic network, the mixture density network (MDN), to reproduce fission yields and their uncertainties. In this paper, we study mass yields for the spontaneous fission of 252 Cf, exploring the number of training samples needed for converged predictions, how different levels of uncertainty propagate from the training set to the MDN predictions, and how well physical constraints of the yields—such as normalization and symmetry—are upheld by the algorithm. Finally, we test the ability of the MDN to interpolate between and extrapolate beyond samples in the training set using energy-dependent mass yields for the neutron-induced fission on 235 U. The MDN provides a reliable way to include and predict uncertainties and is a promising path forward for supplementing sparse sets of nuclear data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Entanglement and entangling power of the dynamics in light-harvesting complexes

We study the evolution of quantum entanglement during exciton energy transfer (EET) in a network model of the Fenna-Matthews-Olson (FMO) complex, a biological pigment-protein complex involved in the early steps of photosynthesis in sulfur bacteria. The influence of Markovian as well as spatially and temporally correlated (non-Markovian) noise on the generation of entanglement across distinct chromophores (site entanglement) and different excitonic eigenstates (mode entanglement) is studied for different injection mechanisms, including thermal and coherent laser excitation. Additionally, we study the entangling power of the FMO complex under natural operating conditions. While quantum information processing tends to favor maximal entanglement, near unit EET is achieved as the result of an intricate interplay between coherent and noisy processes where the initial part of the evolution displays intermediate values of both forms of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology↗

Impact of Network Activity Levels on the Performance of Passive Network Service Dependency Discovery

Network services often do not operate alone, but instead, depend on other services distributed throughout a network to correctly function. If a service fails, is disrupted, or degraded, it is likely to impair other services. The web of dependencies can be surprisingly complex---especially within a large enterprise network---and evolve with time. Acquiring, maintaining, and understanding dependency knowledge is critical for many network management and cyber defense activities. While automation can improve situation awareness for network operators and cyber practitioners, poor detection accuracy reduces their confidence and can complicate their roles. In this paper we rigorously study the effects of network activity levels on the detection accuracy of passive network-based service dependency discovery methods. The accuracy of all except for one method was inversely proportional to network activity levels. Our proposed cross correlation method was particularly robust to the influence of network activity. The proposed experimental treatment will further advance a more scientific evaluation of methods and provide the ability to determine their operational boundaries.

correlation↗

Autonomous Congestion Control in Delay-Tolerant Networks

This presentation highlights communication congestion control in delay-tolerant networks (DTNs). Large-scale future space exploration will offer complex communication challenges that may be best addressed by establishing a network infrastructure. However, current internet techniques for congestion control are not well suited for operation of a network over interplanetary distances. An alternative, delay-tolerant technique for congestion control in a delay-tolerant network is presented. A simple DTN was constructed and an experimental congestion control mechanism was applied. The mechanism appeared to be effective and each router was able to make its bundle acceptance decisions autonomously. Future research will examine more complex topologies and alternative bundle acceptance rules that might enhance performance.

congestion control↗