Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sequential”

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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Tandem In 2 O 3 -Pt/Al 2 O 3 catalyst for coupling of propane dehydrogenation to selective H 2 combustion

Tandem catalysis couples multiple reactions and promises to improve chemical processing, but precise spatiotemporal control over reactive intermediates remains elusive. We used atomic layer deposition to grow In 2 O 3 over Pt/Al 2 O 3 , and this nanostructure kinetically couples the domains through surface hydrogen atom transfer, resulting in propane dehydrogenation (PDH) to propylene by platinum, then selective hydrogen combustion by In 2 O 3 , without excessive hydrocarbon combustion. Other nanostructures, including platinum on In 2 O 3 or platinum mixed with In 2 O 3 , favor propane combustion because they cannot organize the reactions sequentially. The net effect is rapid and stable oxidative dehydrogenation of propane at high per-pass yields exceeding the PDH equilibrium. Tandem catalysis using this nanoscale overcoating geometry is validated as an opportunity for highly selective catalytic performance in a grand challenge reaction.

Yan, Huan↗
DOE OSTI2022

Nanoscale covariance magnetometry with diamond quantum sensors

Nitrogen vacancy (NV) centers in diamond are atom-scale defects that can be used to sense magnetic fields with high sensitivity and spatial resolution. Typically, the magnetic field is measured by averaging sequential measurements of single NV centers, or by spatial averaging over ensembles of many NV centers, which provides mean values that contain no nonlocal information about the relationship between two points separated in space or time. In this work, we propose and implement a sensing modality whereby two or more NV centers are measured simultaneously, and we extract temporal and spatial correlations in their signals that would otherwise be inaccessible. We demonstrate measurements of correlated applied noise using spin-to-charge readout of two NV centers and implement a spectral reconstruction protocol for disentangling local and nonlocal noise sources.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Direct observation of chirality-induced spin selectivity in electron donor–acceptor molecules

The role of chirality in determining the spin dynamics of photoinduced electron transfer in donor-acceptor molecules remains an open question. Although chirality-induced spin selectivity (CISS) has been demonstrated in molecules bound to substrates, experimental information about whether this process influences spin dynamics in the molecules themselves is lacking. Here we used time-resolved electron paramagnetic resonance spectroscopy to show that CISS strongly influences the spin dynamics of isolated covalent donor–chiral bridge–acceptor (D-Bχ-A) molecules in which selective photoexcitation of D is followed by two rapid, sequential electron-transfer events to yield D •+ -Bχ-A •– . Exploiting this phenomenon affords the possibility of using chiral molecular building blocks to control electron spin states in quantum information applications.

Science & Technology - Other Topics↗
DOE OSTI2022

Capturing an Early Gene Induction Event during Wood Decay by the Brown Rot Fungus Rhodonia placenta

Brown rot fungi dominate wood decomposition in coniferous forests, and their carbohydrate-selective mechanisms are of commercial interest. Brown rot was recently described as a two-step, sequential mechanism orchestrated by fungi using differentially expressed genes (DEGs) and consisting of oxidation via reactive oxygen species (ROS) followed by enzymatic saccharification. There have been indications, however, that the initial oxidation step itself might require induction. To capture this early gene regulation event, here, we integrated fine-scale cryosectioning with whole-transcriptome sequencing to dissect gene expression at the single-hyphal-cell scale (tens of micrometers). This improved the spatial resolution 50-fold, relative to previous work, and we were able to capture the activity of the first 100 μm of hyphal front growth by Rhodonia placenta in aspen wood. This early decay period was dominated by delayed gene expression patterns as the fungus ramped up its mechanism. These delayed DEGs included many genes implicated in ROS pathways (lignocellulose oxidation [LOX]) that were previously and incorrectly assumed to be constitutively expressed. These delayed DEGs, which include those with and without predicted functions, also create a focused subset of target genes for functional genomics. However, this delayed pattern was not universal, with a few genes being upregulated immediately at the hyphal front. Most notably, this included a gene commonly implicated in hydroquinone and iron redox cycling: benzoquinone reductase.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Nitrous oxide reduction by two partial denitrifying bacteria requires denitrification intermediates that cannot be respired

ABSTRACT Denitrification is a form of anaerobic respiration wherein nitrate (NO 3 − ) is sequentially reduced via nitrite (NO 2 − ), nitric oxide, and nitrous oxide (N 2 O) to dinitrogen gas (N 2 ) by four reductase enzymes. Partial denitrifying bacteria possess only one or some of these four reductases and use them as independent respiratory modules. However, it is unclear if partial denitrifiers sense and respond to denitrification intermediates outside of their reductase repertoire. Here, we tested the denitrifying capabilities of two purple nonsulfur bacteria,Rhodopseudomonas palustrisCGA0092 andRhodobacter capsulatusSB1003. Each had denitrifying capabilities that matched their genome annotation; CGA0092 reduced NO 2 − to N 2 , and SB1003 reduced N 2 O to N 2 . For each bacterium, N 2 O reduction could be used both for electron balance during growth on electron-rich organic compounds in light and for energy transformation via respiration in darkness. However, N 2 O reduction required supplementation with a denitrification intermediate, including those for which there was no associated denitrification enzyme. For CGA0092, NO 3 − served as a stable, non-catalyzable molecule that was sufficient to activate N 2 O reduction. Using a β-galactosidase reporter, we found that NO 3 − acted, at least in part, by stimulating N 2 O reductase gene expression. In SB1003, NO 2 − but not NO 3 − activated N 2 O reduction, but NO 2 − was slowly removed, likely by a promiscuous enzyme activity. Our findings reveal that partial denitrifiers can still be subject to regulation by denitrification intermediates that they cannot use. IMPORTANCE Denitrification is a form of microbial respiration wherein nitrate is converted via several nitrogen oxide intermediates into harmless dinitrogen gas. Partial denitrifying bacteria, which individually have some but not all denitrifying enzymes, can achieve complete denitrification as a community by cross-feeding nitrogen oxide intermediates. However, the last intermediate, nitrous oxide (N2O), is a potent greenhouse gas that often escapes, motivating efforts to understand and improve the efficiency of denitrification. Here, we found that at least some partial denitrifying N2O reducers can sense and respond to nitrogen oxide intermediates that they cannot otherwise use. The regulatory effects of nitrogen oxides on partial denitrifiers are thus an important consideration in understanding and applying denitrifying bacterial communities to combat greenhouse gas emissions.

Biotechnology & Applied Microbiology↗
DOE OSTI2023

A Genome-Scale Atlas Reveals Complex Interplay of Transcription and Translation in an Archaeon

The scale of post-transcriptional regulation and the implications of its interplay with other forms of regulation in environmental acclimation are underexplored for organisms of the domain Archaea. Here, we have investigated the scale of post-transcriptional regulation in the extremely halophilic archaeon Halobacterium salinarum NRC-1 by integrating the transcriptome-wide locations of transcript processing sites (TPSs) and SmAP1 binding, the genome-wide locations of antisense RNAs (asRNAs), and the consequences of RNase_2099C knockout on the differential expression of all genes. This integrated analysis has discovered that 54% of all protein-coding genes in the genome of this haloarchaeon are likely targeted by multiple mechanisms for putative post-transcriptional processing and regulation, with about 20% of genes likely being regulated by combinatorial schemes involving SmAP1, asRNAs, and RNase_2099C. Comparative analysis of mRNA levels (transcriptome sequencing [RNA-Seq]) and protein levels (sequential window acquisition of all theoretical fragment ion spectra mass spectrometry [SWATH-MS]) for 2,579 genes over four phases of batch culture growth in complex medium generated additional evidence for the conditional post-transcriptional regulation of 7% of all protein-coding genes. We demonstrate that post-transcriptional regulation may act to fine-tune specialized and rapid acclimation to stressful environments, e.g., as a switch to turn on gas vesicle biogenesis to promote vertical relocation under anoxic conditions and modulate the frequency of transposition by insertion sequence (IS) elements of the IS200/IS605, IS4, and ISH3 families. Findings from this study are provided as an atlas in a public Web resource (https://halodata.systemsbiology.net).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Space-Time Block Preconditioning for Incompressible Flow

Parallel-in-time methods have become increasingly popular in the simulation of time-dependent numerical PDEs, allowing for the efficient use of additional message passing interface processes when spatial parallelism saturates. Most methods treat the solution and parallelism in space and time separately. In contrast, all-at-once methods solve the full space-time system directly, largely treating time as simply another spatial dimension. All-at-once methods offer a number of benefits over separate treatment of space and time, most notably significantly increased parallelism and faster time to solution (when applicable). However, the development of fast, scalable all-at-once methods has largely been limited to time-dependent (advection-)diffusion problems. This paper introduces the concept of space-time block preconditioning for the all-at-once solution of incompressible flow. By extending well-known concepts of spatial block preconditioning to the space-time setting, we develop a block preconditioner whose application requires the solution of a space-time (advection-)diffusion equation in the velocity block, coupled with a pressure Schur complement approximation consisting of independent spatial solves at each time-step, and a space-time matrix-vector multiplication. The new method is tested on four classical models in incompressible flow. Finally, the results indicate perfect scalability in refinement of spatial and temporal mesh spacing, perfect scalability in nonlinear Picard iteration count when applied to a nonlinear Navier--Stokes problem, and minimal overhead in terms of number of preconditioner applications compared with sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Autodifferentiable Ensemble Kalman Filters

Data assimilation is concerned with sequentially estimating a temporally evolving state. This task, which arises in a wide range of scientific and engineering applications, is particularly challenging when the state is high-dimensional and the state-space dynamics are unknown. This paper introduces a machine learning framework for learning dynamical systems in data assimilation. Here, our auto-differentiable ensemble Kalman filters (AD-EnKFs) blend ensemble Kalman filters for state recovery with machine learning tools for learning the dynamics. In doing so, AD-EnKFs leverage the ability of ensemble Kalman filters to scale to high-dimensional states and the power of automatic differentiation to train high-dimensional surrogate models for the dynamics. Numerical results using the Lorenz-96 model show that AD-EnKFs outperform existing methods that use expectation-maximization or particle filters to merge data assimilation and machine learning. In addition, AD-EnKFs are easy to implement and require minimal tuning.

autodifferentiation↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimization on Manifolds via Graph Gaussian Processes

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Bayesian optimization↗
DOE OSTI2024

Multiplicity dependence of charged-particle intra-jet properties in pp collisions at $\sqrt{s}$ = 13 TeV

The first measurement of the multiplicity dependence of intra-jet properties of leading charged-particle jets in proton–proton (pp) collisions is reported. The mean charged particle multiplicity and jet fragmentation distributions are measured in minimum-bias and high-multiplicity pp collisions at center-of-mass energy $\sqrt{s}$ = 13 TeV using the ALICE detector. Jets are reconstructed from charged particles produced in the midrapidity region (|η| < 0.9) using the sequential recombination anti-k T algorithm with jet resolution parameters R = 0.2, 0.3, and 0.4 for the trans verse momentum (p T ) interval 5–110 GeV/c. The high multiplicity events are selected by the forward V0 scintilla tor detectors. The mean charged-particle multiplicity inside the leading jet cone rises monotonically with increasing jet p T in qualitative agreement with previous measurements at lower energies. The distributions of jet fragmentation function variables z ch and ξ ch are measured for different jet-p T intervals. Jet-p T independent fragmentation of leading jets is observed for wider jets except at high- and low-z ch values. The observed “hump-backed plateau” structure in the ξ ch distribution indicates suppression of low-p T particles. In high-multiplicity events, an enhancement of the fragmen tation probability of low-z ch particles accompanied by a suppression of high-zch particles is observed compared to minimum-bias events. This behavior becomes more promi nent for low-p T jets with larger jet radius. The results are compared with predictions of QCD-inspired event generators, PYTHIA 8 with Monash 2013 tune and EPOS LHC. It is found that PYTHIA 8 qualitatively reproduces the jet modification in high-multiplicity events except at high jet p T . These measurements provide important constraints to models of jet fragmentation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Flavour-dependent chemical freeze-out of light nuclei in relativistic heavy-ion collisions

We study the production of light nuclei in Au+Au collisions at $\sqrt{s_{NN}}$ = 7.7–200 GeV and Pb+Pb collisions at $\sqrt{s_{NN}}$ = 2.76 and 5.02 TeV within a flavour-dependent chemical freeze-out scenario, assuming different flavoured hadrons undergo separate chemical freeze-out. Using the Thermal-FIST package, thermal parameters extracted from fits to various sets of hadron yields, including and excluding light nuclei, are used to calculate the ratios of the yields of light nuclei, namely, d/p, $\overline{d}$/$\overline{p}$, t/p, t/d, 4 He/ 3 He, and 3 H Λ / 3 He. A comparison with experimental data from the STAR and ALICE collaborations shows that a sequential freeze-out scenario provides a better description of light nuclei yield ratios than the traditional single freeze-out approach. These results suggest the flavour-dependent chemical freeze-out for final state light nuclei production persists in heavy-ion collisions at both RHIC and LHC energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Transferable Reinforcement Learning for Smart Homes: Preprint

To harness the great amount of untapped resources at the demand side, smart home technology plays a vital role in solving the "last mile" problem in smart grid. Reinforcement learning (RL), which has demonstrated an outstanding performance in solving many sequential decision-making problems, can be a great candidate to be used in smart home control. For instance, many studies have started investigating the load scheduling problem under dynamic pricing scheme. Based on those, this study aims at providing an affordable solution to encourage a higher smart home adoption rate. Specifically, we investigate combining transfer learning (TL) with RL to reduce the training cost of an optimal RL control policy. Given an optimal policy for a benchmark home, TL can jump-start the RL training of a policy for a new home, which has different appliances and user preferences. Simulation results show that by leveraging TL, RL training converges faster and requires much less computing time for new homes that are similar to the benchmark home. In all, this study proposes a cost-effective approach for training RL control policies for homes at scale, which ultimately reduces the controller's implementation costs, increases the adoption rate of RL controllers, and makes more homes grid-interactive.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION,↗