Search NASA⌕ Search

SEARCH · Search NASA

Results for “Upper bounds”

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
DOE OSTI2024

Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time

Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024

Pocrnic, Matthew (ORCID:0000000203089376)↗
NASA NTRS1984

Approaches to optimization of SS/TDMA time slot assignment

Reduction techniques for traffic matrices are explored in some detail. These matrices arise in satellite switched time-division multiple access (SS/TDMA) techniques whereby switching of uplink and downlink beams is required to facilitate interconnectivity of beam zones. A traffic matrix is given to represent that traffic to be transmitted from n uplink beams to n downlink beams within a TDMA frame typically of 1 ms duration. The frame is divided into segments of time and during each segment a portion of the traffic is represented by a switching mode. This time slot assignment is characterized by a mode matrix in which there is not more than a single non-zero entry on each line (row or column) of the matrix. Investigation is confined to decomposition of an n x n traffic matrix by mode matrices with a requirement that the decomposition be 100 percent efficient or, equivalently, that the line(s) in the original traffic matrix whose sum is maximal (called critical line(s)) remain maximal as mode matrices are subtracted throughout the decomposition process. A method of decomposition of an n x n traffic matrix by mode matrices results in a number of steps that is bounded by n(2) - 2n + 2. It is shown that this upper bound exists for an n x n matrix wherein all the lines are maximal (called a quasi doubly stochastic (QDS) matrix) or for an n x n matrix that is completely arbitrary. That is, the fact that no method can exist with a lower upper bound is shown for both QDS and arbitrary matrices, in an elementary and straightforward manner.

Wade, T. O.↗
NASA NTRS1974

The tensile failure modes of metal-matrix composite materials

The strengths of individual boron fibers extracted from various as-received and thermally fatigued aluminum alloy matrix materials were measured. The results are described in terms of a Weibull distribution, and strengths of composites fabricated from these fibers are calculated in terms of lower and upper bounds. Tests conducted on composite specimens indicated that strengths approaching the upper bounds can be achieved in composites fabricated by normal diffusion bonding techniques. Cyclic temperature changes effectively reduced the strength values toward the lower bounds. It was concluded that this effect resulted from the degradation of the strength of the fiber-matrix bond.

Wright, M. A.↗
NASA NTRS1990

Time-optical spinup maneuvers of flexible spacecraft

Attitude controllers for spacecraft have been based on the assumption that the bodies being controlled are rigid. Future spacecraft, however, may be quite flexible. Many applications require spinning up/down these vehicles. In this work the minimum time control of these maneuvers is considered. The time-optimal control is shown to possess an important symmetry property. Taking advantage of this property, the necessary and sufficient conditions for optimality are transformed into a system of nonlinear algebraic equations in the control switching times during one half of the maneuver, the maneuver time, and the costates at the mid-maneuver time. These equations can be solved using a homotopy approach. Control spillover measures are introduced and upper bounds on these measures are obtained. For a special case these upper bounds can be expressed in closed form for an infinite dimensional evaluation model. Rotational stiffening effects are ignored in the optimal control analysis. Based on a heuristic argument a simple condition is given which justifies the omission of these nonlinear effects. This condition is validated by numerical simulation.

Singh, G.↗
NASA NTRSDate not supplied

PMSM Parameter Estimation using a Linear Unknown Input Interval Observer

In this paper, the problem of permanent magnet synchronous motor (PMSM) speed and unknown load torque estimation is addressed. For this purpose, a interval unknown input observer (UIO) for linear time-invariant (LTI) systems is used. First, the PMSM model is linearized in order to make it in a suitable form for the linear interval UIO. Then, the interval UIO is applied to allow the joint estimation of the motor speed and the unknown load torque disturbance. The main advantages of this approach is that it not only allows the joint state and unknown input estimation, but also to take the different uncertainty sources into account. Indeed, taking model and measurement uncertainty into account is crucial. Assuming that the measurement noise and disturbances are bounded, lower and upper bounds are first computed for the unmeasured state (motor speed) and then for the unknown input (load torque). The proposed approach and its limitations are demonstrated with the nonlinear PMSM model derived from its equivalent electrical circuit.

Elinirina I Robinson↗
NASA NTRSDate not supplied

Estimation of Permanent Magnet Synchronous Motor Parameters using a Linear Unknown Input Interval Observer

This paper develops and evaluate a technique to estimate the speed and unknown load torque of a permanent magnet synchronous motor (PMSM). An interval unknown input observer (UIO) for linear time-invariant (LTI) systems is designed and utilized to estimate the PMSM parameters. Interval UIOs are advantageous as they allow for the estimation of both states and unknown inputs, while accounting for varying uncertainty sources, such as model and measurement uncertainties inherent in dynamic systems and processes. First, the nonlinear PMSM model is linearized to transform it to a suitable form for application of the linear interval UIO. Then, the interval UIO is applied to jointly estimate the motor speed and the unknown load torque disturbance. Assuming that the measurement noise and disturbances are bounded, lower and upper bounds are first computed for the unmeasured state (motor speed) and then for the unknown input (load torque). The proposed approach and its limitations are demonstrated for the nonlinear PMSM model derived from its equivalent electrical circuit.

Elinirina I Robinson↗
NASA NTRS1961

A Threshold Theory for Phase-Locked Loops

A model of a phase-locked loop has been developed which is valid for all signal-to-noise ratios. The model is in the form of a nonlinear feedback system with randomly time-varying parameters. The analysis considers two operating regions. In low signal-to-noise ratio regions, the important consideration is stability. We want to study the asymptotic stability in the mean of a nonlinear system. It follows directly that a necessary condition for asymptotic stability of any nonlinear system is that a linearized model about some equilibrium point be asymptotically stable. By considering all possible equilibrium points, we can find an upper bound on the value of noise density which makes the system unstable. This upper bound represents a threshold value for system operation. In high signal-to-noise ratio regions, our results provide an exact statistical. description of system behavior. Therefore, knowledge of the spectrum of the signal and noise may be used to optimize the system configuration.

Van Trees, H. L.↗
NASA NTRS1987

Fault-tolerant clock synchronization validation methodology

A validation method for the synchronization subsystem of a fault-tolerant computer system is presented. The high reliability requirement of flight-crucial systems precludes the use of most traditional validation methods. The method presented utilizes formal design proof to uncover design and coding errors and experimentation to validate the assumptions of the design proof. The experimental method is described and illustrated by validating the clock synchronization system of the Software Implemented Fault Tolerance computer. The design proof of the algorithm includes a theorem that defines the maximum skew between any two nonfaulty clocks in the system in terms of specific system parameters. Most of these parameters are deterministic. One crucial parameter is the upper bound on the clock read error, which is stochastic. The probability that this upper bound is exceeded is calculated from data obtained by the measurement of system parameters. This probability is then included in a detailed reliability analysis of the system.

Computer systems↗
NASA NTRS1995

On the design of turbo codes

In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of the turbo code, i.e., the minimum output weight of codewords due to weight-2 input sequences. An upper bound on the effective free distance of a turbo code is derived. This upper bound can be achieved if the feedback connection of convolutional codes uses primitive polynomials. We review multiple turbo codes (parallel concatenation of q convolutional codes), which increase the so-called 'interleaving gain' as q and the interleaver size increase, and a suitable decoder structure derived from an approximation to the maximum a posteriori probability decision rule. We develop new rate 1/3, 2/3, 3/4, and 4/5 constituent codes to be used in the turbo encoder structure. These codes, for from 2 to 32 states, are designed by using primitive polynomials. The resulting turbo codes have rates b/n (b = 1, 2, 3, 4 and n = 2, 3, 4, 5, 6), and include random interleavers for better asymptotic performance. These codes are suitable for deep-space communications with low throughput and for near-Earth communications where high throughput is desirable. The performance of these codes is within 1 dB of the Shannon limit at a bit-error rate of 10(exp -6) for throughputs from 1/15 up to 4 bits/s/Hz.

Divsalar, D.↗
NASA NTRS1988

Bounds of the bit error probability of a linear cyclic code over GF(2 exp l) and its extended code

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2 exp l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either HD or soft-decision (SD) ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of SD and HD ML over bounded-distance decoding is established.

Cheng, Unjeng↗
NASA NTRS1987

Constructions for finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. These codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived from known upper bounds on the minimum distance of block codes. A general construction for FS codes is then given, based on the idea of partitioning a given linear block into cosets of one of its subcodes, and it is shown that in many cases the FS codes constructed in this way have a d sub free which is as large as possible. These codes are found without the need for lengthy computer searches, and have potential applications for future deep-space coding systems. The issue of catastropic error propagation (CEP) for FS codes is also investigated.

Pollara, F.↗
DOE OSTI2025

Cosmic millicharge background and reheating probes

We demonstrate that the searches for dark sector particles can provide probes of reheating scenarios, focusing on the cosmic millicharge background produced in the early universe. We discuss two types of millicharge particles (mCPs): either with, or without, an accompanying dark photon. These two types of mCPs have distinct theoretical motivations and cosmological signatures. We discuss constraints from the overproduction and mCP-baryon interactions of the mCP without an accompanying dark photon, with different reheating temperatures. We also consider the ∆n eff constraints on the mCPs from kinetic mixing, varying the reheating temperature. The regions of interest in which the accelerator and other experiments can probe the reheating scenarios are identified in this paper for both scenarios. These probes can potentially allow us to set an upper bound on the reheating temperature down to ~ 10 MeV, much lower than the previously considered upper bound from inflationary cosmology at around ~ 10 16 GeV. In addition, we derive a new “distinguishability condition”, in which the two mCP scenarios may be differentiated by combining cosmological and theoretical considerations. Finally, we discuss the implications of dedicated mCP searches, future CMB-S4 observations, and the target for experiments when considering the minimally allowed reheating temperature.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2015

Incorporation of New Convective Ice Microphysics into the NASA GISS GCM and Impacts on Cloud Ice Water Path (IWP) Simulation

The CMIP5 configurations of the GISS Model-E2 GCM simulated a mid- and high latitude ice IWP that decreased by 50 relative to that simulated for CMIP3 (Jiang et al. 2012; JGR). Tropical IWP increased by 15 in CMIP5. While the tropical IWP was still within the published upper-bounds of IWP uncertainty derived using NASA A-Train satellite observations, it was found that the upper troposphere (200 mb) ice water content (IWC) exceeded the published upper-bound by a factor of 2. This was largely driven by IWC in deep-convecting regions of the tropics.Recent advances in the model-E2 convective parameterization have been found to have a substantial impact on tropical IWC. These advances include the development of both a cold pool parameterization (Del Genio et al. 2015) and new convective ice parameterization. In this presentation, we focus on the new parameterization of convective cloud ice that was developed using data from the NASA TC4 Mission. Ice particle terminal velocity formulations now include information from a number of NASA field campaigns. The new parameterization predicts both an ice water mass weighted-average particle diameter and a particle cross sectional area weighted-average size diameter as a function of temperature and ice water content. By assuming a gamma-distribution functional form for the particle size distribution, these two diameter estimates are all that are needed to explicitly predict the distribution of ice particles as a function of particle diameter.GCM simulations with the improved convective parameterization yield a 50 decrease in upper tropospheric IWC, bringing the tropical and global mean IWP climatologies into even closer agreement with the A-Train satellite observation best estimates.

tropical regions↗
DOE OSTI2024

Efficient distributed continual learning for steering experiments in real-time

Deep learning has emerged as a powerful method for extracting valuable information from large volumes of data. However, when new training data arrives continuously (i.e., is not fully available from the beginning), incremental training suffers from catastrophic forgetting (i.e., new patterns are reinforced at the expense of previously acquired knowledge). Training from scratch each time new training data becomes available would result in extremely long training times and massive data accumulation. Rehearsal-based continual learning has shown promise for addressing the catastrophic forgetting challenge, but research to date has not addressed performance and scalability. To fill this gap, we propose an approach based on a distributed rehearsal buffer that efficiently complements data-parallel training on multiple GPUs to achieve high accuracy, short runtime, and scalability. It leverages a set of buffers (local to each GPU) and uses several asynchronous techniques for updating these local buffers in an embarrassingly parallel fashion, all while handling the communication overheads necessary to augment input minibatches using unbiased, global sampling. We further propose a generalization of rehearsal buffers to support both classification and generative learning tasks, as well as more advanced rehearsal strategies (notably Dark Experience Replay, leveraging knowledge distillation). We illustrate this approach with a real-life HPC streaming application from the domain of ptychographic image reconstruction. Furthermore, we run extensive experiments on up to 128 GPUs of the ThetaGPU supercomputer to compare our approach with baselines representative of training-from-scratch (the upper bound in terms of accuracy) and incremental training (the lower bound). Results show that rehearsal-based continual learning achieves a top-5 validation accuracy close to the upper bound, while simultaneously exhibiting a runtime close to the lower bound.

Asynchronous data management↗
NASA NTRS1998

White Light Stray Light Test of the SOHO UVCS

During the late stages of the integration phase of the Ultraviolet Coronagraph Spectrometer (UVCS) instrument for the Solar and Heliospheric Observatory (SOHO) at MATRA-Marconi in Toulouse, France, SOHO Project management at Goddard Space Flight Center (GSFC) became concerned that the elaborate stray light rejection system for the instrument had not been tested and might possibly be misaligned such that the instrument could not deliver promised scientific returns. A white light stray light test, which would place an upper bound on the value of UVCS's stray light rejection capability, was commissioned, conceived, and carried out. This upper bound value would be indicative of the weakest coronal features the spectrometer would be capable of discerning. The test was rapidly developed at GSFC in coordination with science team members from Harvard-Smithsonian Center for Astrophysics (CFA) and was carried out at MATRA in late February 1995. The outcome of this test helped to justify similar, much desired tests with visible and far ultraviolet light at CFA in a facility specifically designed to perform such testing.

Gardner, L. N.↗
NASA NTRS1992

Recent advances in carbon-carbon substrate technology at NASA. Langley Research Center

A comparison of specific strengths of candidate high-temperature materials as a function of temperature is shown. From this comparison, it is apparent why there is an interest in carbon-carbon composites for applications as a strong, light-weight thermal protection system (TPS), or as hot structure, for applications above 2500 F. The lower bound of the carbon-carbon band is representative of the tensile strength of cross-ply Advanced Carbon-Carbon (ACC). The upper bound represents capabilities of various experimental carbon-carbon composites. Thin carbon-carbon composites, such as would be used as TPS panels or hot aero-structure, are usually constructed of layups of 2-D fabrics of carbon-fiber yarns (tows). Although the in-plane strengths of these composites can be very attractive, a major problem area is low interlaminar strength. The low interlaminar strength is the result of a relatively weak carbon matrix and poor interaction between the fibers and matrix. The purpose of this paper is to discuss strategies being employed to improve the interlaminar strengths of the materials at the upper bound of the carbon-carbon band, and to present some recent encouraging results. The emphasis of these strategies is to improve interlaminar shear and tensile strengths while maintaining, or even improving, the inplane properties.

Ransone, Philip O.↗
NASA NTRS1992

deltaT/T limits from the UCSB South Pole degree-scale experiment and constraints on the large-scale deviations from the Hubble flow

The limits to the cosmic microwave background radiation (CBR) temperature anisotropy derived from the results of the University of California at Santa Barbara South Pole degree-scale experiment are translated into upper bounds on large-scale deviations from the Hubble flow. The lack of measurable CBR anisotropy in this experiment implies very low upper bounds upon the rms amplitude V(R) of the streaming motion within a Gaussian window of radius R: Vmax(R is greater than 4000 km/s) less than 200 km/s, and Vmax(R is greater than 7500 km/s) is less than 100 km/s. Thus, the smoothness of the CBR at about 1-2 deg and the apparent large-amplitude (about 500 km/s) deviations from pure Hubble flow at R greater than about 4000 km/s cannot be simultaneously explained in the framework of usual large-scale structure formation models based on the assumptions involved in this calculation.

Gorski, Krzysztof M.↗
NASA NTRS1990

Computer search for binary cyclic UEP codes of odd length up to 65

Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.

Lin, Mao-Chao↗