Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 145 records · Page 8

An upper bound on the radius of a highly electrically conducting lunar core

Parker's (1980) nonlinear inverse theory for the electromagnetic sounding problem is converted to a form suitable for analysis of lunar day-side transfer function data by: (1) transforming the solution in plane geometry to that in spherical geometry; and (2) transforming the theoretical lunar transfer function in the dipole limit to an apparent resistivity function. The theory is applied to the revised lunar transfer function data set of Hood et al. (1982), which extends in frequency from 10 to the -5th to 10 to the -3rd Hz. On the assumption that an iron-rich lunar core, whether molten or solid, can be represented by a perfect conductor at the minimum sampled frequency, an upper bound of 435 km on the maximum radius of such a core is calculated. This bound is somewhat larger than values of 360-375 km previously estimated from the same data set via forward model calculations because the prior work did not consider all possible mantle conductivity functions.

Hobbs, B. A.↗

Solitons in superfluid (He-3)-A - Bound states on domain walls

The effects of solitons on the spectrum of fermion excitations in superfluid (He-3)-A are investigated. It is found that there is a two-dimensional manifold of bound states with energies within the gap of the bulk superfluid. The bound-state spectrum lacks inversion symmetry parallel to the wall.

Ho, T. L.↗

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗

Reliability bounds for fault-tolerant systems with competing responses to component failures

Bounds are established on the probability of system failure for fault-tolerant systems of the type used, for example, in aviation control. Event series leading to system failure are assumed to follow a semi-Markov model in which the potential sojourn times associated with component failures have exponential distributions and those associated with system responses have distributions with unspecified form. A product form of the bounds is derived by using a model that provides for multiple competing system responses to component failures.

Lee, L. D.↗

Synthetic bounds for semi-Markov reliability models

Upper and lower bounds are derived for the probability of failure for a class of highly reliable process control computers. The bounds are synthetic in the sense that the descriptions of component failure and system recovery are assumed to be obtained from different sources. The reliability model is constructed under the assumption that the processes are independent.

White, A. L.↗

Reliability bounds for fault-tolerant systems with competing responses to component failures

Bounds are established on the probability of system failure for fault-tolerant systems of the type used, for example, in aviation control. Event series leading to system failure are assumed to follow a semi-Markov model in which the potential sojourn times associated with component failures have exponential distributions and those associated with system responses have distributions with unspecified form. A product form of the bounds is derived by using a model that provides for multiple competing system responses to component failures.

Lee, L. D.↗

Cramer-Rao bounds for signal-to-noise ratio and combiner weight estimation

Cramer-Rao lower bounds on estimator variance are calculated for arbitrary unbiased estimates of signal-to-noise ratio and combiner weight parameters. Estimates are assumed to be based on a discrete set of observables obtained by matched filtering of a biphase modulated signal. The bounds are developed first for a problem model based on one observable per channel symbol period, and then extended to a more general problem in which subperiod observables are also available.

Dolinar, S. J.↗

Computable optimal value bounds for generalized convex programs

It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonlinear programming problem can readily be exploited to calculate global parametric upper and lower bounds on the optimal value function. The approach is attractive because it involves manipulation of information normally required to characterize solution optimality. A procedure is briefly described for calculating and improving the bounds as well as its extensions to generalized convex and concave functions. Several areas of applications are also indicated.

Fiacco, Anthony V.↗

Dynamic optimization problems with bounded terminal conditions

Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector pi. Three example problems with bounded terminal conditions are solved to verify this technique.

Lee, A. Y.↗

WHAMII - An enumeration and insertion procedure with binomial bounds for the stochastic time-constrained traveling salesman problem

This paper presents an algorithm (WHAMII) designed to solve the Artificial Intelligence Design Challenge at the 1987 AIAA Guidance, Navigation and Control Conference. The problem under consideration is a stochastic generalization of the traveling salesman problem in which travel costs can incur a penalty with a given probability. The variability in travel costs leads to a probability constraint with respect to violating the budget allocation. Given the small size of the problem (eleven cities), an approach is considered that combines partial tour enumeration with a heuristic city insertion procedure. For computational efficiency during both the enumeration and insertion procedures, precalculated binomial probabilities are used to determine an upper bound on the actual probability of violating the budget constraint for each tour. The actual probability is calculated for the final best tour, and additional insertions are attempted until the actual probability exceeds the bound.

Dahl, Roy W.↗

Bounds on exotic-particle interactions from SN 1987A

The observation of a neutrino pulse from the supernova SN 1987A constrains the production of light exotic particles in the protoneutron star. A new bound on the axion decay constant is derived, f(a) of greater than about 10 to the 10th GeV. If right-handed (RH) neutrinos exist, 'RH Fermi constant' is G(RH) of less than about 10 exp-4 G(F), two orders of magnitude below laboratory bounds. The Dirac mass of hv sub m can be constrained below laboratory limits. The Dirac mass of the mu-neutrino can be constrained below laboratory limits.

Raffelt, Georg↗

Confidence set inference with a prior quadratic bound

In the uniqueness part of a geophysical inverse problem, the observer wants to predict all likely values of P unknown numerical properties z=(z sub 1,...,z sub p) of the earth from measurement of D other numerical properties y (sup 0) = (y (sub 1) (sup 0), ..., y (sub D (sup 0)), using full or partial knowledge of the statistical distribution of the random errors in y (sup 0). The data space Y containing y(sup 0) is D-dimensional, so when the model space X is infinite-dimensional the linear uniqueness problem usually is insoluble without prior information about the correct earth model x. If that information is a quadratic bound on x, Bayesian inference (BI) and stochastic inversion (SI) inject spurious structure into x, implied by neither the data nor the quadratic bound. Confidence set inference (CSI) provides an alternative inversion technique free of this objection. Confidence set inference is illustrated in the problem of estimating the geomagnetic field B at the core-mantle boundary (CMB) from components of B measured on or above the earth's surface.

Backus, George E.↗

Bounds on current collection from the far field by plasma clouds in the ionosphere

Plasma clouds can enhance the collection of current to a charged body in the ionosphere in two ways. The first is by providing a large collection area for ionospheric electrons to be collected. The second is by ionization of neutral gas in the vicinity of the plasma cloud. The collection of electrons across a magnetic field is examined, and it is shown that the effective collection area is limited to the region of the cloud where the magnetic field effects are overwhelmed by the electric field effects from the charged body. Upper and lower bounds are obtained for the radius of the core region where the electric field influence dominates. From these, upper and lower bounds are obtained for the current collection.

Hastings, D. E.↗

Motivating the sure bounds

Motivation is provided for a theorem that provides upper and lower bounds for the reliability of reconfigurable digital control systems. The reliability goals for these systems are too high to be established by natural life testing, which means the probability of system failure must be computed from mathematical models that capture the essential elements of fault occurence and system fault recovery. The upper and lower bound theorem shows that system recovery can be adequately described by its first two moments, provided component failure rate is low and system recovery is fast. This result greatly simplifies both the fault injection experiments that study system recovery and the numerical computations that estimate the probability of system failure from a mathematical model.

White, Allan L.↗

Uncertainty bounds using sector theory

An approach based on sector-stability theory can furnish a description of the uncertainty associated with the frequency response of a model, given sector-bounds on the individual parameters of the model. The application of the sector-based approach to the formulation of useful uncertainty descriptions for linear, time-invariant multivariable systems is presently explored, and the approach is applied to two generic forms of parameter uncertainty in order to investigate its advantages and limitations. The results obtained show that sector-uncertainty bounds can be used to evaluate the impact of parameter uncertainties on the frequency response of the design model.

Waszak, Martin R.↗

Perturbation guidance for aerocruise with bounded control

A perturbation guidance algorithm is developed for the constant-altitude portion of the orbital-plane change maneuver, called aerocruise. It is obtained by solving a linear-quadratic regulator problem in terms of the perturbed state and control variables. The regulator problem with hard control-variable constraints is then studied. For the two-control-variable case, the simulation results show that the bounded-control algorithm gives better performance than that obtained using a limiter for the case where control variables exceed the bounds.

Hull, David G.↗

The mechanism of high-T(sub c) superconductivity due to bound hole mediators: Relationship to ferroelectricity

The mediation by bound holes creating Cooper pairing in high T(sub c) superconductors has its origin in charge transfer excitations on the multivalence cation (virtual excitions) and in bound excitions or polarizations associated with the oxygen 2p electrons. These phenomena are produced and/or enhanced by a high internal electric field which is itself created by virtue of the unique crystal structures and polyhedral building blocks of high T(sub c) materials. The polarizations which can create oxygen holes (in addition to excitions) may be due to simply the internal electric field or to polaronic and electron-deficient bond behavior. This gives rise to two energy-dependent oxygen bands near the Fermi level. The magnitude and direction of the internal electric fields were calculated for Y1Ba2Cu3O(7-delta) (1-2-3) and show strong z-direction fields at the Cu(2), O2, and O3 sites and an even stronger -z direction field at the O4 site. The field calculations also show why electrical conductivity in the 1-2-3 material is essentially in the base plane of the CuO5 pyramid (the CuO2 plane).

Vezzoli, G. C.↗

Shock-layer bounds for a singularly perturbed equation

The size of the shock-layer governed by a conservation law is studied. The conservation law is a parabolic reaction-convection-diffusion equation with a small parameter multiplying the diffusion term and convex flux. Rigorous upper and lower bounding functions for the solution of the conservation law are established based on maximum-principle arguments. The bounding functions demonstrate that the size of the shock-layer is proportional to the parameter multiplying the diffusion term.

Scroggs, Jeffrey S.↗