Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sequential scheme”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Sequential control chart methodology

A modification of the V mask sequential control chart is proposed. In this modified scheme, a parabolic section is included in the mask to provide better performance when the process undergoes a large change in the mean from goal conditions. It is shown that the modified V mask can be implemented either in conventional graphic form, or in an algorithmic form suitable for a digital computer. Average run lengths are given for a typical range of circumstances. It also is shown that the conventional Shewhart chart is better than a sequential chart for the specific purpose of promptly detecting very large shifts of the mean from goal conditions.

Source record↗
DOE OSTI2017

Sequential self-assembly of DNA functionalized droplets

Complex structures and devices, both natural and manmade, are often constructed sequentially. From crystallization to embryogenesis, a nucleus or seed is formed and built upon. Sequential assembly allows for initiation, signaling, and logical programming, which are necessary for making enclosed, hierarchical structures. Though biology relies on such schemes, they have not been available in materials science. We demonstrate programmed sequential self-assembly of DNA functionalized emulsions. The droplets are initially inert because the grafted DNA strands are pre-hybridized in pairs. Active strands on initiator droplets then displace one of the paired strands and thus release its complement, which in turn activates the next droplet in the sequence, akin to living polymerization. This strategy provides time and logic control during the self-assembly process, and offers a new perspective on the synthesis of materials.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Sensitivity of Optimal Solutions to Control Problems for Second Order Evolution Subdifferential Inclusions

In this paper the sensitivity of optimal solutions to control problems described by second order evolution subdifferential inclusions under perturbations of state relations and of cost functionals is investigated. First we establish a new existence result for a class of such inclusions. Then, based on the theory of sequential Γ-convergence we recall the abstract scheme concerning convergence of minimal values and minimizers. The abstract scheme works provided we can establish two properties: the Kuratowski convergence of solution sets for the state relations and some complementary Γ-convergence of the cost functionals. Then these two properties are implemented in the considered case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗
DOE OSTI2019

Equation-based object-oriented modeling and simulation for data center cooling: A case study

© 2019 Elsevier B.V. Data center cooling accounts for about 1% of electricity usage in the United States. Computer models are pivotal in designing and operating energy-efficient cooling systems. Compared to conventional building performance simulation programs, the equation-based object-oriented modeling language Modelica is an emerging approach that can enable fast prototyping and dynamic simulation of cooling systems. In this case study, we first modeled the cooling and control systems of an actual data center located in Massachusetts using the open-source Modelica Buildings library, and then calibrated a baseline model based on measurement data. The simulation of the baseline model identified several operation-related issues in the cooling and control systems, such as degraded cooling coils, improper dead band in control settings, and simultaneous cooling and heating in air handlers. Afterwards, we used a sequential search technique as well as an optimization scheme to investigate the energy saving potentials for different energy efficiency measures aiming to address the abovementioned issues. Simulation results show potential energy savings up to 24% by resolving identified control-related issues and optimizing the supply air temperature.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗
DOE OSTI2024

A numerical method for simulating variable density flows in membrane desalination systems

Here, we present a novel method for simulating unsteady, variable density, fluid flows in membrane desalination systems. By assuming the density varies only with concentration and temperature, the scheme decouples the solution of the governing equations into two sequential blocks. The first solves the governing equations for the temperature and concentration fields, which are used to compute all thermophysical properties. The second block solves the conservation of mass and momentum equations for the velocity and pressure. We show that this is computationally more efficient than schemes that iterate over the full coupled equations in one block. We verify that the method achieves second-order spatial-temporal accuracy, and we use the method to investigate buoyancy-driven convection in a desalination process called vacuum membrane distillation. Specifically, we show that with gravity properly oriented, variations in temperature and concentration can trigger a double-diffusive instability that enhances mixing and improves water recovery. We also show that the instability can be strengthened by providing external heating.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2011

Multigrid Smoothers for Ultra-Parallel Computing: Additional Theory and Discussion

This paper investigates the properties of smoothers in the context of algebraic multigrid (AMG) running on parallel computers with potentially millions of processors. The development of multigrid smoothers in this case is challenging, because some of the best relaxation schemes, such as the Gauss-Seidel (GS) algorithm, are inherently sequential. Based on the sharp two-grid multigrid theory from we characterize the smoothing properties of a number of practical candidates for parallel smoothers, including several C-F, polynomial, and hybrid schemes. We show, in particular, that the popular hybrid GS algorithm has multigrid smoothing properties which are independent of the number of processors in many practical applications, provided that the problem size per processor is large enough. This is encouraging news for the scalability of AMG on ultra-parallel computers. We also introduce the more robust `1 smoothers, which are always convergent and have already proven essential for the parallel solution of some electromagnetic problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Optimization and gamma/theta guidance of flight trajectories in a windshear

Guidance schemes for near-optimum performance in wind shear are examined. The presence of a downdraft is assumed in addition to the horizontal shear. The takeoff problem is considered with reference to flight in a vertical plane. Trajectories for optimum performance in a wind shear are determined for different wind shear models and intensities. Methods of optimal control theory are used together with the dual sequential gradient-restoration algorithm for optimal control problems. Guidance schemes for near-optimum performance in a wind shear are developed, starting from optimal trajectories. These are gamma guidance, based on either the absolute of the relative path inclination, and theta guidance, based on the pitch attitude angle. These schemes are evaluated through numerical experiments in order to determine whether the resulting trajectories are sufficiently close to optimum and to compare these trajectories with those arising from alternative guidance schemes.

Miele, A.↗
NASA NTRS2000

Delta-doped hybrid advanced detector for low energy particle detection

A delta-doped hybrid advanced detector (HAD) is provided which combines at least four types of technologies to create a detector for energetic particles ranging in energy from hundreds of electron volts (eV) to beyond several million eV. The detector is sensitive to photons from visible light to X-rays. The detector is highly energy-sensitive from approximately 10 keV down to hundreds of eV. The detector operates with milliwatt power dissipation, and allows non-sequential readout of the array, enabling various advanced readout schemes.

Cunningham, Thomas J.↗
NASA NTRS2002

Delta-doped hybrid advanced detector for low energy particle detection

A delta-doped hybrid advanced detector (HAD) is provided which combines at least four types of technologies to create a detector for energetic particles ranging in energy from hundreds of electron volts (eV) to beyond several million eV. The detector is sensitive to photons from visible light to X-rays. The detector is highly energy-sensitive from approximately 10 keV down to hundreds of eV. The detector operates with milliwatt power dissipation, and allows non-sequential readout of the array, enabling various advanced readout schemes.

Cunningham, Thomas J.↗
DOE OSTI2015

Optimal mode transformations for linear-optical cluster-state generation

In this paper, we analyze the generation of linear-optical cluster states (LOCSs) via sequential addition of one and two qubits. Existing approaches employ the stochastic linear-optical two-qubit controlled-Z (CZ) gate with success rate of 1/9 per operation. The question of optimality of the CZ gate with respect to LOCS generation has remained open. We report that there are alternative schemes to the CZ gate that are exponentially more efficient and show that sequential LOCS growth is indeed globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. Finally, we show that the maximal success rate of postselected entangling n photonic qubits or m Bell pairs into a cluster is (1/2) n-1 and (1/4) m-1 , respectively, with no ancilla photons, and we give an explicit optical description of the optimal mode transformations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1981

Four-quadrant CCD analog multiplier

Sequential processing technique improves accuracy when CCD-array signals are multiplied by weighting function to remove offsets. System uses two schemes to cancel undesired output contributions arising from prerequisite biases. First is spontaneous cancellation by multiple "nominally identical" devices; second is sequential cancellation where same devices are used repeatedly to form multiple products. Single device then successively subtracts products, eliminating effects of MOS-array threshold nonuniformities.

Brooks, C. W.↗
DOE OSTI2015

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

We report that to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable “repeat-until-success” approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. Ultimately, we find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1981

Search strategy effects on PN acquisition performance

The present paper focusses on 'random' and 'expanding window' PN acquisition search strategies and analytically develops the PN acquisition time statistics as functions of salient system parameters such as prediction SNR, detection and false alarm probabilities and a priori information on epoch location. The significance of this analysis is its general applicability to arbitrary postdetection processing schemes. Computed performance results account for the above salient parameters, wherein sequential detection is employed in conjunction with random and selected expanding window search strategies.

Weinberg, A.↗
NASA NTRS1991

The effect of code expanding optimizations on instruction cache design

It is shown that code expanding optimizations have strong and non-intuitive implications on instruction cache design. Three types of code expanding optimizations are studied: instruction placement, function inline expansion, and superscalar optimizations. Overall, instruction placement reduces the miss ratio of small caches. Function inline expansion improves the performance for small cache sizes, but degrades the performance of medium caches. Superscalar optimizations increases the cache size required for a given miss ratio. On the other hand, they also increase the sequentiality of instruction access so that a simple load-forward scheme effectively cancels the negative effects. Overall, it is shown that with load forwarding, the three types of code expanding optimizations jointly improve the performance of small caches and have little effect on large caches.

Chen, William Y.↗
DOE OSTI2022

Power Converter Circuit Design Automation using Parallel Monte Carlo Tree Search

The tidal waves of modern electronic/electrical devices have led to increasing demands for ubiquitous application-specific power converters. A conventional manual design procedure of such power converters is computation- and labor-intensive, which involves selecting and connecting component devices, tuning component-wise parameters and control schemes, and iteratively evaluating and optimizing the design. To automate and speed up this design process, we propose an automatic framework that designs custom power converters from design specifications using Monte Carlo Tree Search. Specifically, the framework embraces the upper-confidence-bound-tree (UCT), a variant of Monte Carlo Tree Search, to automate topology space exploration with circuit design specification-encoded reward signals. Moreover, our UCT-based approach can exploit small offline data via the specially designed default policy and can run in parallel to accelerate topology space exploration. Further, it utilizes a hybrid circuit evaluation strategy to substantially reduce design evaluation costs. Empirically, we demonstrated that our framework could generate energy-efficient circuit topologies for various target voltage conversion ratios. Compared to existing automatic topology optimization strategies, the proposed method is much more computationally efficient --- the sequential version can generate topologies with the same quality while being up to 67% faster. Here, the parallelization schemes can further achieve high speedups compared to the sequential version.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗