Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Reliability of voting in fault-tolerant software systems for small output spaces

Under a voting strategy in a fault-tolerant software system there is a difference between correctness and agreement. An independent N-version programming reliability model is proposed for treating small output spaces which distinguishes between correctness and agreement. System reliability is investigated using analytical relationships and simulation. A consensus majority voting strategy is proposed and its performance is analyzed and compared with other voting strategies. Consensus majority strategy automatically adapts the voting to different component reliability and output space cardinality characteristics. It is shown that absolute majority voting strategy provides a lower bound on the reliability provided by the consensus majority, and 2-of-n voting strategy an upper bound. If r is the cardinality of the output space it is proved the 1/r is a lower bound on the average reliability of fault-tolerant system components below which the system reliability begins to deteriorate as more versions are added.

Mcallister, David F.↗
NASA NTRS1993

Did surface temperatures constrain microbial evolution?

The proposition that glaciation may not have occurred before the Cenozoic--albeit not yet a consensus position--nevertheless raises for reconsideration the surface temperature history of the earth. Glacial episodes, from the Huronian (2.3 billion years ago; BYA) through the late Paleozoic (320 to 250 million years ago; MYA) have been critical constraints on estimation of the upper bounds of temperature (Crowley 1983, Kasting and Toon 1989). Once removed, few if any constraints on the upper temperature limit other than life remain. Walker (1982) recognized that life provides an upper limit to temperature in the Precambrian. We propose a more radical concept: the upper temperature limit for viable growth of a given microbial group corresponds to the actual surface temperature at the time of the group's first appearance. In particular, we propose here that two major evolutionary developments--the emergence of cyanobacteria and aerobic eukaryotes--can be used to determine surface temperature in the Precambrian, and that only subsequent cooling mediated by higher plants and then angiosperms permitted what may possibly be the earth's first glaciation in the late Cenozoic.

NASA Program Exobiology↗
NASA NTRS1990

Reliability of voting in fault-tolerant software systems for small output spaces

Under a voting strategy in a fault-tolerant software system there is a difference between correctness and agreement. An independent N-version programming reliability model is proposed for treating small output spaces which distinguishes between correctness and agreement. System reliability is investigated using analytical relationships and simulation. A consensus majority voting stratey is proposed and its performance is analyzed and compared with other voting strategies. A consensus voting strategy automatically adapts the voting to diffeerent component reliability and output space cardinality characteristics. It is shown that absolute majority voting strategy provides a lower bound on the reliability provided by the consensus majority, and the 2-of-n voting strategy an upper bound. If r is the cardinality of output space it is proved that 1/r is a lower bound on the average reliability of fault-tolerant system components below which the system reliability begins to deteriorate as more versions are added.

Mcallister, David F.↗
NASA NTRS1992

An algorithm for the estimation of bounds on the emissivity and temperatures from thermal multispectral airborne remotely sensed data

The effective flux incident upon the detectors of a thermal sensor, after it has been corrected for atmospheric effects, is a function of a non-linear combination of the emissivity of the target for that channel and the temperature of the target. The sensor system cannot separate the contribution from the emissivity and the temperature that constitute the flux value. A method that estimates the bounds on these temperatures and emissivities from thermal data is described. This method is then tested with remotely sensed data obtained from NASA's Thermal Infrared Multispectral Scanner (TIMS) - a 6 channel thermal sensor. Since this is an under-determined set of equations i.e. there are 7 unknowns (6 emissivities and 1 temperature) and 6 equations (corresponding to the 6 channel fluxes), there exist theoretically an infinite combination of values of emissivities and temperature that can satisfy these equations. Using some realistic bounds on the emissivities, bounds on the temperature are calculated. These bounds on the temperature are refined to estimate a tighter bound on the emissivity of the source. An error analysis is also carried out to quantitatively determine the extent of uncertainty introduced in the estimate of these parameters. This method is useful only when a realistic set of bounds can be obtained for the emissivities of the data. In the case of water the lower and upper bounds were set at 0.97 and 1.00 respectively. Five flights were flown in succession at altitudes of 2 km (low), 6 km (mid), 12 km (high), and then back again at 6 km and 2 km. The area selected with the Ross Barnett reservoir near Jackson, Mississippi. The mission was flown during the predawn hours of 1 Feb. 1992. Radiosonde data was collected for that duration to profile the characteristics of the atmosphere. Ground truth temperatures using thermometers and radiometers were also obtained over an area of the reservoir. The results of two independent runs of the radiometer data averaged 7.03 plus or minus .70 for the first run and 7.31 plus or minus .88 for the second run. The results of the algorithm yield a temperature of 7.68 for the low altitude data to 8.73 for the high altitude data.

Jaggi, S.↗
NASA NTRS1989

Efficient diagnosis of multiprocessor systems under probabilistic models

The problem of fault diagnosis in multiprocessor systems is considered under a probabilistic fault model. The focus is on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. Lower and upper bounds on the number of tests required for regular systems are also presented. A class of regular systems which includes hypercubes is shown to be correctly diagnosable with high probability. In all cases, the number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis techniques.

Blough, Douglas M.↗
NASA NTRS1989

Bounds on effectiveness of software reuse

In an earlier work, the author developed a communication channel analogy model of the software development process, which established a quantifiable, parametric upper bound on human productivity in terms of information put into the process and yield of product output by the process. This paper extends this work to focus on factors of that bound associated with software reuse. Specifically, it is shown, that under policies of heavy reuse, human productivity associated with the language advantage grows at best logarithmically in the size of the reuse base.

Tausworthe, Robert C.↗
DOE OSTI2024

Improving modular bootstrap bounds with integrality

We propose methods that efficiently impose integrality — i.e., the condition that the coefficients of characters in the partition function must be integers — into numerical modular bootstrap. We demonstrate the method with a number of examples where it can be used to strengthen modular bootstrap results. First, we show that, with a mild extra assumption, imposing integrality improves the bound on the maximal allowed gap in dimensions of operators in theories with a U(1) c symmetry at c = 3, and reduces it to the value saturated by the SU(4) 1 WZW model point of c = 3 Narain lattices moduli space. Second, we show that our method can be used to eliminate all but a discrete set of points saturating the bound from previous Virasoro modular bootstrap results. Finally, when central charge is close to 1, we can slightly improve the upper bound on the scaling dimension gap.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1982

Microwave edge diffraction by features in Saturn's rings - Observations with Voyager 1

Classical edge diffraction patterns are formed at centimeter wavelengths by several features of Saturn's rings. These patterns were discovered in 3.6- and 13-centimeter radio signals from Voyager 1 during occultation by the rings. The observed shapes are in agreement with theoretical patterns computed for screens of perfectly abrupt edges having large but finite opacity. Comparison with models in which the opacity at the edge tapers to zero from a finite value sets a new bound of less than about 200 meters on the microwave edge thickness. Certain features of the data suggest a smaller upper bound of about 130 meters on the edge thickness.

Marouf, E. A.↗
NASA NTRS1991

Theoretical study of the low-lying bound states of O2

It is demonstrated that a complete-active-space self-consistent-field (CASSCF) (2p)/MRCI + Q (multireference configuration interaction with a Davidson correction) description in a (13s8p6d 4f2g)/((5s4p3d 2f1g) atomic natural orbits (ANO) basis set supplemented with diffuse functions provides a quantitative description of the six lowest states of O2. The calculated potentials are within 0.05 eV (1.2 kilocal/mol) of accurate experimental results. The importance of substantially expanding the primitive basis set has been investigated, and it is demonstrated that such expansions yield insignificant improvement in the spectroscopic constants. Potential energy curves have also been reported for the weakly bound states of O2. The 5Pi(g) state is estimated to have a D(e) of 0.16 +/- 0.03 eV. The upper bound of D(e) is found to be sufficiently large that the importance of this state as a precursor for the formation of O2 (b 1Sigma(t)(+)) and O(1S) should be reconsidered.

Partridge, Harry↗
NASA NTRS1992

On slowly varying systems - l-infinity to l-infinity performance and implications to robust adaptive control

The authors present a result on the l-infinity to l-infinity performance of slowly time varying systems. In particular, it is shown that the performance of such systems cannot be much worse than that of the frozen-time systems which are time invariant. This result is used to characterize a class of indirect adaptive controllers that can stabilize a time-invariant system subjected to both parametric and l-infinity to l-infinity bounded unstructured uncertainty. Pertaining to this class of controllers, a particular indirect adaptive scheme is proposed that provides the greatest upper bound on the size of the unstructured uncertainty for which stability is ensured.

Voulgaris, Petros G.↗
NASA NTRS2005

Biased Randomized Algorithm for Fast Model-Based Diagnosis

A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.

Williams, Colin↗
NASA NTRS1987

Mean-square error bounds for reduced-error linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Lyapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗
NASA NTRS1987

Mean-square-error bounds for reduced-order linear state estimators

The mean-square error of reduced-order linear state estimators for continuous-time linear systems is investigated. Lower and upper bounds on the minimal mean-square error are presented. The bounds are readily computable at each time-point and at steady state from the solutions to the Ricatti and the Liapunov equations. The usefulness of the error bounds for the analysis and design of reduced-order estimators is illustrated by a practical numerical example.

Baram, Y.↗
NASA NTRS1998

A Posteriori Bounds for Linear-Functional Outputs of Crouzeix-Raviart Finite Element Discretizations of the Incompressible Stokes Problem

We present a finite element technique for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions; the finite element discretization is effected by Crouzeix-Raviart elements, the discontinuous pressure approximation of which is central to our approach. The bounds are based upon the construction of an augmented Lagrangian: the objective is a quadratic "energy" reformulation of the desired output; the constraints are the finite element equilibrium equations (including the incompressibility constraint), and the intersubdomain continuity conditions on velocity. Appeal to the dual max-min problem for appropriately chosen candidate Lagrange multipliers then yields inexpensive bounds for the output associated with a fine-mesh discretization; the Lagrange multipliers are generated by exploiting an associated coarse-mesh approximation. In addition to the requisite coarse-mesh calculations, the bound technique requires solution only of local subdomain Stokes problems on the fine-mesh. The method is illustrated for the Stokes equations, in which the outputs of interest are the flowrate past, and the lift force on, a body immersed in a channel.

Patera, Anthony T.↗
NASA NTRS2012

Ionospheric Signatures in Radio Occultation Data

We can extend robustly the radio occultation data record by 6 years (+60%) by developing a singlefrequency processing method for GPS/MET data. We will produce a calibrated data set with profile-byprofile data characterization to determine robust upper bounds on ionospheric bias. Part of an effort to produce a calibrated RO data set addressing other key error sources such as upper boundary initialization. Planned: AIRS-GPS water vapor cross validation (water vapor climatology and trends).

radio occultation↗
NASA NTRS2018

NICER Discovers the Ultracompact Orbit of the Accreting Millisecond Pulsar IGR J17062-6143

We present results of recent Neutron Star Interior Composition Explorer (NICER) observations of the accreting millisecond X-ray pulsar (AMXP) IGR J17062-6143 that show that it resides in a circular, ultracompact binary with a 38-minute orbital period. NICER observed the source for 26 kiloseconds over a 5.3-day span in 2017 August, and again for 14 and 11 kiloseconds in 2017 October and November, respectively. A power spectral analysis of the August exposure confirms the previous detection of pulsations at 163.656 Hertz in Rossi X-ray Timing Explorer (RXTE) data, and reveals phase modulation due to orbital motion of the neutron star. A coherent search for the orbital solution using the Z squared method finds a best-fitting circular orbit with a period of 2278.21 seconds (37.97 minutes), a projected semimajor axis of 0.00390 lt-s (Localization Test Statistic), and a barycentric pulsar frequency of 163.6561105 Hertz. This is currently the shortest known orbital period for an AMXP. The mass function is 9.12 times 10 (sup minus 8) solar mass, presently the smallest known for a stellar binary. The minimum donor mass ranges from approximately 0.005 to 0.007 times the solar mass for a neutron star mass from 1.2 to 2 times the solar mass. Assuming mass transfer is driven by gravitational radiation, we find donor mass and binary inclination bounds of 0.0175-0.0155 times the solar mass and 19 degrees less than i less than 27.5 degrees, where the lower and upper bounds correspond to 1.4 and 2 times the solar mass neutron stars, respectively. Folding the data accounting for the orbital modulation reveals a sinusoidal profile with fractional amplitude 2.04 plus or minus 0.11 percent (0.3-3.2 kiloelectronvolts).

Strohmayer, T. E.↗
DOE OSTI2024

Entanglement Capacity Estimates and Throughput Measurements of Quantum Channels

The throughput is an important performance metric of entangled qubit distribution quantum networks, and may be characterized by the number of distributed entangled qubit pairs per second (ebps). It is measured over physical quantum network connections using specialized instruments, including photonic entanglement sources and single photon detectors. Extensive theory has been developed to estimate the entangled qubit capacity of quantum channels using abstractions of physical connections. These two quantities both characterize the throughput performance but in different ways, and typically have been hard to relate to each other in concrete terms, in part due to the lack of precise measurements with matching analytical models and derivations. We describe measurements on a physical testbed with fiber connections of lengths 0-75 kilometers. We obtain the normalized analytic capacity estimates using the transmissivity approximations derived using single photon coincidence measurements, and convert them to bounds on throughput (measured in ebps) using a multiplier derived from co-located detector measurements. The results indicate consistent throughput measurements upper-bounded by their analytical capacity estimates across all connections. We show that previous capacity estimates using light measurements are below ebps measurements for some connections, due to the inclusion of non-representative decrease of light levels outside C-band with distance.

Rao, Nageswara↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗