Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 865 records · Page 48

Automated reaction kinetics and network exploration (Arkane): A statistical mechanics, thermodynamics, transition state theory, and master equation software

The open-source statistical mechanics software described here, Arkane–Automated Reaction Kinetics and Network Exploration–facilitates computations of thermodynamic properties of chemical species, high-pressure limit reaction rate coefficients, and pressure-dependent rate coefficient over multi-well molecular potential energy surfaces (PES) including the effects of collisional energy transfer on phenomenological kinetics. Arkane can use estimates to fill in information for molecules or reactions where quantum chemistry information is missing. The software solves the internal energy master equation for complex unimolecular reaction systems. Inputs to the software include converged electronic structure computations performed by the user using a variety of supported software packages (Gaussian, Molpro, Orca, TeraChem, Q-Chem, Psi4). The software outputs high-pressure limit rate coefficients and pressure-dependent phenomenological rate coefficients, as well as computed thermodynamic properties (enthalpy, entropy, and constant pressure heat capacity) with added energy corrections. Some of the key features of Arkane include treatment of 1D, 2D or ND hindered internal rotation modes, treatment of free internal rotation modes, quantum tunneling effect consideration, transition state theory (TST) and Rice-Ramsperger-Kassel-Marcus (RRKM) rate coefficient computations, master equation solution with four implemented methods, inverse-Laplace transform of high-pressure limit rate coefficients into the energy domain, energy corrections based on bond-additivity or isodesmic reactions, automated and efficient PES exploration, and PES sensitivity analysis. The present work describes the design of Arkane, how it should be used, and refers to the theory that it employs. Arkane is distributed via the RMG-Py software suite (https://github.com/ReactionMechanismGenerator/RMG-Py).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗

A two-equation soot-in-flamelet modeling approach applied under Spray A conditions

Soot production (including formation and oxidation) is studied in the transient, high-pressure and turbulent n-dodecane Spray A flames from the Engine Combustion Network (ECN) using computational fluid dynamics (CFD) simulations. A two-equation soot-in-flamelet modeling approach is applied within the framework of the Unsteady Flamelet Progress Variable (UFPV) model and results are validated against experimental data. Equations for soot mass fraction and soot number density derived in the mixture fraction space are solved in the context of detailed flamelet calculations. Source terms for the different steps in the soot chemistry are tabulated and incorporated in the flamelet manifold. For the reference condition, the modeling approach based on the tabulated flamelet manifold reduces the computational cost of a CFD calculation by approximately 40 times compared to a non-tabulated well-mixed (WM) modeling approach. The soot-in-flamelet approach is then extended to study the effect of ambient oxygen concentration, ambient mixture composition and ambient temperature on soot production. Results show that the modeling approach is able to capture the experimental trends for the soot volume fraction (SVF) with good quantitative agreement, especially in the soot ramp-up region.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Direct coupling of a genome-scale microbial in silico model and a groundwater reactive transport model

The activity of microorganisms often plays an important role in dynamic natural attenuation or engineered bioremediation of subsurface contaminants, such as chlorinated solvents, metals, and radionuclides. To evaluate and/or design bioremediated systems, quantitative reactive transport models are needed. State-of-the-art reactive transport models often ignore the microbial effects or simulate the microbial effects with static growth yield and constant reaction rate parameters over simulated conditions, while in reality microorganisms can dynamically modify their functionality (such as utilization of alternative respiratory pathways) in response to spatial and temporal variations in environmental conditions. Constraint-based genome-scale microbial in silico models, using genomic data and multiple-pathway reaction networks, have been shown to be able to simulate transient metabolism of some well studied microorganisms and identify growth rate, substrate uptake rates, and byproduct rates under different growth conditions. These rates can be identified and used to replace specific microbially-mediated reaction rates in a reactive transport model using local geochemical conditions as constraints. We previously demonstrated the potential utility of integrating a constraint based microbial metabolism model with a reactive transport simulator as applied to bioremediation of uranium in groundwater. However, that work relied on an indirect coupling approach that was effective for initial demonstration but may not be extensible to more complex problems that are of significant interest (e.g., communities of microbial species, multiple constraining variables). Here, we extend that work by presenting and demonstrating a method of directly integrating a reactive transport model (FORTRAN code) with constraint-based in silico models solved with IBM ILOG CPLEX linear optimizer base system (C library). The models were integrated with BABEL, a language interoperability tool. The modeling system is designed in such a way that constraint-based models targeting different microorganisms or competing organism communities can be easily plugged into the system. Constraint-based modeling is very costly given the size of a genome-scale reaction network. To save computation time, a binary tree is traversed to examine the concentration and solution pool generated during the simulation in order to decide whether the constraint-based model should be called. We also show preliminary results from the integrated model including a comparison of the direct and indirect coupling approaches.

54 ENVIRONMENTAL SCIENCES↗

Adversarial sampling of unknown and high-dimensional conditional distributions

Many engineering problems require the prediction of realization-to-realization variability or a refined description of modeled quantities. In that case, it is necessary to sample elements from unknown high-dimensional spaces with possibly millions of degrees of freedom. While there exist methods able to sample elements from probability density functions (PDF) with known shapes, several approximations need to be made when the distribution is unknown. In this paper the sampling method, as well as the inference of the underlying distribution, are both handled with a data-driven method known as generative adversarial networks (GAN), which trains two competing neural networks to produce a network that can effectively generate samples from the training set distribution. In practice, it is often necessary to draw samples from conditional distributions. When the conditional variables are continuous, only one (if any) data point corresponding to a particular value of a conditioning variable may be available, which is not sufficient to estimate the conditional distribution. This work handles this problem using an a priori estimation of the conditional moments of a PDF. Herein, two approaches, stochastic estimation, and an external neural network are compared for computing these moments; however, any preferred method can be used. The algorithm is demonstrated in the case of the deconvolution of a filtered turbulent flow field. It is shown that all the versions of the proposed algorithm effectively sample the target conditional distribution with minimal impact on the quality of the samples compared to state-of-the-art methods. Additionally, the procedure can be used as a metric for the diversity of samples generated by a conditional GAN (cGAN) conditioned with continuous variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graphene Electric Field Sensor Enables Single Shot Label-Free Imaging of Bioelectric Potentials

The measurement of electrical activity across systems of excitable cells underlies current progress in neuroscience, cardiac pharmacology, and neurotechnology. However, bioelectricity spans orders of magnitude in intensity, space, and time, posing substantial technological challenges. The development of methods permitting network-scale recordings with high spatial resolution remains key to studies of electrogenic cells, emergent networks, and bioelectric computation. Here, for this work, we demonstrate single-shot and label-free imaging of extracellular potentials with high resolution across a wide field-of-view. The critically coupled waveguide-amplified graphene electric field (CAGE) sensor leverages the field-sensitive optical transitions in graphene to convert electric potentials into the optical regime. As a proof-of-concept, we use the CAGE sensor to detect native electrical activity from cardiac action potentials with tens-of-microns resolution, simultaneously map the propagation of these potentials at tissue-scale, and monitor their modification by pharmacological agents. This platform is robust, scalable, and compatible with existing microscopy techniques for multimodal correlative imaging.

47 OTHER INSTRUMENTATION↗

Controlled Spalling of 4H Silicon Carbide with Investigated Spin Coherence for Quantum Engineering Integration

We detail scientific and engineering advances which enable the controlled spalling and layer transfer of single crystal 4H silicon carbide (4H-SiC) from bulk substrates. 4HSiC’s properties, including high thermal conductivity and a wide bandgap, make it an ideal semiconductor for power electronics. Moreover, 4H-SiC is an excellent host of solid-state atomic defect qubits for quantum computing and quantum networking. Because 4H-SiC substrates are expensive (due to long growth times and limited yield), techniques for removal and transfer of bulk-quality films are desirable for substrate reuse and integration of the separated films. In this work, we utilize updated approaches for stressor layer thickness control and spalling crack initiation to demonstrate controlled spalling of 4H-SiC, the highest fracture toughness crystal spalled to date. We achieve coherent spin control of neutral divacancy (VV 0 ) qubit ensembles and measure a quasi-bulk spin T 2 of 79.7 μs in the spalled films.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel scalability of Hartree–Fock calculations

Quantum chemistry is increasingly performed using large cluster computers consisting of multiple interconnected nodes. For a fixed molecular problem, the efficiency of a calculation usually decreases as more nodes are used, due to the cost of communication between the nodes. This paper empirically investigates the parallel scalability of Hartree–Fock calculations. The construction of the Fock matrix and the density matrix calculation are analyzed separately. For the former, we use a parallelization of Fock matrix construction based on a static partitioning of work followed by a work stealing phase. For the latter, we use density matrix purification from the linear scaling methods literature, but without using sparsity. When using large numbers of nodes for moderately sized problems, density matrix computations are network-bandwidth bound, making purification methods potentially faster than eigendecomposition methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accelerating rejection-based simulation of biochemical reactions with bounded acceptance probability

Stochastic simulation of large biochemical reaction networks is often computationally expensive due to the disparate reaction rates and high variability of population of chemical species. An approach to accelerate the simulation is to allow multiple reaction firings before performing update by assuming that reaction propensities are changing of a negligible amount during a time interval. Species with small population in the firings of fast reactions significantly affect both performance and accuracy of this simulation approach. It is even worse when these small population species are involved in a large number of reactions. We present in this paper a new approximate algorithm to cope with this problem. It is based on bounding the acceptance probability of a reaction selected by the exact rejection-based simulation algorithm, which employs propensity bounds of reactions and the rejection-based mechanism to select next reaction firings. The reaction is ensured to be selected to fire with an acceptance rate greater than a predefined probability in which the selection becomes exact if the probability is set to one. Our new algorithm improves the computational cost for selecting the next reaction firing and reduces the updating the propensities of reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

LiHe{sup +} IN THE EARLY UNIVERSE: A FULL ASSESSMENT OF ITS REACTION NETWORK AND FINAL ABUNDANCES

We present the results of quantum calculations based on entirely ab initio methods for a variety of molecular processes and chemical reactions involving the LiHe{sup +} ionic polar molecule. With the aid of these calculations, we derive accurate reaction rates and fitting expressions valid over a range of gas temperatures representative of the typical conditions of the pregalactic gas. With the help of a full chemical network, we then compute the evolution of the abundance of LiHe{sup +} as function of redshift in the early universe. Finally, we compare the relative abundance of LiHe{sup +} with that of other polar cations formed in the same redshift interval.

79 ASTRONOMY AND ASTROPHYSICS↗

ON FIBRILS AND FIELD LINES: THE NATURE OF Hα FIBRILS IN THE SOLAR CHROMOSPHERE

Observations of the solar chromosphere in the line core of the Hα line show dark elongated structures called fibrils that show swaying motion. We performed a three-dimensional radiation-MHD simulation of a network region and computed synthetic Hα images from this simulation to investigate the relation between fibrils and the magnetic field lines in the chromosphere. The periods, amplitudes, and phase speeds of the simulated fibrils are consistent with observations. We find that some fibrils trace out the same field line along the fibril’s length, while other fibrils sample different field lines at different locations along their length. Fibrils sample the same field lines on a timescale of ∼200 s. This is shorter than their own lifetime. Fibril-threading field lines carry slow-mode waves, as well as transverse waves propagating with the Alfvén speed. Transverse waves propagating in opposite directions cause an interference pattern with complex apparent phase speeds. The relationship between fibrils and field lines is governed by constant migration and swaying of the field lines, their mass loading and draining, and their visibility in Hα. Field lines are visible where they lie close to the optical depth unity surface. The location of the latter is at a height at which the column mass reaches a certain fixed value. The visibility of the field line is thus determined by its own mass density and by the mass density of the material above it. Using the swaying motion of fibrils as a tracer of chromospheric transverse oscillations must be done with caution.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamics, nucleosynthesis, and kilonova signature of black hole—neutron star merger ejecta

Here we investigate the ejecta from black hole—neutron star mergers by modeling the formation and interaction of mass ejected in a tidal tail and a disk wind. The outflows are neutron-rich, giving rise to optical/infrared emission powered by the radioactive decay of r-process elements (a kilonova). Here we perform an end-to-end study of this phenomenon, where we start from the output of a fully-relativistic merger simulation, calculate the post-merger hydrodynamical evolution of the ejecta and disk winds including neutrino physics, determine the final nucleosynthetic yields using post-processing nuclear reaction network calculations, and compute the kilonova emission with a radiative transfer code. We study the effects of the tail-to-disk mass ratio by scaling the tail density. A larger initial tail mass results in fallback matter becoming mixed into the disk and ejected in the subsequent disk wind. Relative to the case of a disk without dynamical ejecta, the combined outflow has lower mean electron fraction, faster speed, larger total mass, and larger absolute mass free of high-opacity Lanthanides or Actinides. In most cases, the nucleosynthetic yield is dominated by the heavy r-process contribution from the unbound part of the dynamical ejecta. A Solar-like abundance distribution can however be obtained when the total mass of the dynamical ejecta is comparable to the mass of the disk outflows. The kilonova has a characteristic duration of 1 week and a luminosity of ~ 10 41 erg s -1 , with orientation effects leading to variations of a factor ~2 in brightness. At early times (< 1 d) the emission includes an optical component from the (hot) Lanthanide-rich material, but the spectrum evolves quickly to the infrared thereafter.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗

Light storage, retrieval, and controllable interference in an atomic tripod system

Highly efficient quantum memories are essential for advancing quantum information processing technologies, including scalable quantum computing and quantum networks. We experimentally demonstrate a light storage and retrieval protocol in a tripod system using an ensemble of laser-cooled 87 Rb atoms. The tripod system, which consists of three ground states and an excited state, offers rich dynamics: its use to coherently store and retrieve a weak probe pulse in the 87 Rb 𝐹 = 1 ground-state manifold leads to the interference of two spin-wave excitations during storage time that translate to an interference in the peak intensity of the retrieved probe pulse. Our work shows that these interferences, which manifest when varying the pulse sequence or energy level structure, can be controlled experimentally by varying the storage time, optical phase, and magnetic field strength. Theoretical simulations exhibit excellent agreement with the experimental results. In conclusion, this work demonstrates the rich dynamics and versatile capabilities of atomic tripod systems for light storage and retrieval, with key advantages over conventional Λ systems, highlighting the potential of atomic tripod systems for applications in quantum information processing, quantum synchronization, and atomic memory protocols.

Coherent control↗

Shadow process tomography of quantum channels

Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scales exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. Furthermore, we make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography, enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SharP: Towards Programming Extreme-Scale Systems with Hierarchical Heterogeneous Memory

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. Along with hierarchical-heterogeneous memory, the system typically has a high-performing network and a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. In this work, we propose and develop the programming abstraction called SHARed data-structure centric Programming abstraction (SharP) to address both of these goals, i.e., provide (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications. To evaluate SharP, we implement a Stencil benchmark using SharP, port QMCPack, a petascale-capable application, and adapt Memcached ecosystem, a popular Big-Data framework, to use SharP, and quantify the performance and productivity advantages. Additionally, we demonstrate the simplicity of using SharP on different memories including DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM).

97 MATHEMATICS AND COMPUTING↗

New Effective Multithreaded Matching Algorithms

Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

matching, parallel algorithms↗

Sustaining Moore's law with 3D chips

Here, rather than continue the expensive and time-consuming quest for transistor replacement, the authors argue that 3D chips coupled with new computer architectures can keep Moore's law on its traditional scaling path.

3D chip manufacturing↗