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 217 records · Page 12

Upper bound on neutrino cross sections

Asymptotic bounds on the total cross sections of neutrino (weak) scattering processes are obtained. It is shown that the elastic neutrino-neutrino cross section obeys the following bound in the high energy region: sigma sub T (S) equals ImF(S,0)/S is less than or equal to const. (LogS) squared. Assumptions of analyticity, crossing, unitarity, polynomial boundaries, and a zero-condition on the absorptive part of the scattering amplitude, are used to obtain this bound.

Mickens, R. E.↗

An upper bound for codes in a two-access binary erasure channel

A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.

Van Tilborg, H. C. A.↗

The condition of a finite Markov chain and perturbation bounds for the limiting probabilities

The inequalities bounding the relative error the norm of w- w squiggly/the norm of w are exhibited by a very simple function of E and A. Let T denote the transition matrix of an ergodic chain, C, and let A = I - T. Let E be a perturbation matrix such that T squiggly = T - E is also the transition matrix of an ergodic chain, C squiggly. Let w and w squiggly denote the limiting probability (row) vectors for C and C squiggly. The inequality is the best one possible. This bound can be significant in the numerical determination of the limiting probabilities for an ergodic chain. In addition to presenting a sharp bound for the norm of w-w squiggly/the norm of w an explicit expression for w squiggly will be derived in which w squiggly is given as a function of E, A, w and some other related terms.

Meyer, C. D., Jr.↗

Consistent Tolerance Bounds for Statistical Distributions

Assumption that sample comes from population with particular distribution is made with confidence C if data lie between certain bounds. These "confidence bounds" depend on C and assumption about distribution of sampling errors around regression line. Graphical test criteria using tolerance bounds are applied in industry where statistical analysis influences product development and use. Applied to evaluate equipment life.

Mezzacappa, M. A.↗

Determining Normal-Distribution Tolerance Bounds Graphically

Graphical method requires calculations and table lookup. Distribution established from only three points: mean upper and lower confidence bounds and lower confidence bound of standard deviation. Method requires only few calculations with simple equations. Graphical procedure establishes best-fit line for measured data and bounds for selected confidence level and any distribution percentile.

Mezzacappa, M. A.↗

Transfer Function Bounds for Partial-unit-memory Convolutional Codes Based on Reduced State Diagram

The performance of a coding system consisting of a convolutional encoder and a Viterbi decoder is analytically found by the well-known transfer function bounding technique. For the partial-unit-memory byte-oriented convolutional encoder with m sub 0 binary memory cells and (k sub 0 m sub 0) inputs, a state diagram of 2(K) (sub 0) was for the transfer function bound. A reduced state diagram of (2 (m sub 0) +1) is used for easy evaluation of transfer function bounds for partial-unit-memory codes.

Lee, P. J.↗

Bounds and approximations for rapid evaluation of coherent MPSK error probabilities

The error probability for MPSK detection is expressed here as a sum of a familiar upper-bound approximation and a correction term which is well suited for numerical integration. An asymptotic expansion of the correction term is derived, from which simple and extremely tight upper and lower bounds are obtained. Relative errors in using these bounds and approximations of them are graphed for cases of practical interest.

Chie, C. M.↗

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.↗

Reduced conservatism in stability robustness bounds by state transformation

This note addresses the issue of 'conservatism' in the time domain stability robustness bounds obtained by the Liapunov approach. A state transformation is employed to improve the upper bounds on the linear time-varying perturbation of an asymptotically stable linear time-invariant system for robust stability. This improvement is due to the variance of the conservatism of the Liapunov approach with respect to the basis of the vector space in which the Liapunov function is constructed. Improved bounds are obtained, using a transformation, on elemental and vector norms of perturbations (i.e., structured perturbations) as well as on a matrix norm of perturbations (i.e., unstructured perturbations). For the case of a diagonal transformation, an algorithm is proposed to find the 'optimal' transformation. Several examples are presented to illustrate the proposed analysis.

Yedavalli, R. K.↗

A comparison of the bounded derivative and the normal-mode initialization methods using real data

Application of the bounded-derivative and normal-mode methods to a simple linear barotropic model at a typical middle latitude shows that the two methods lead to identical constraints up to a certain degree of approximation. Beyond this accuracy the two methods may differ from each other. When applied to a global nonlinear barotropic model using real data, again the two methods lead to similar balanced initial states. The gravity oscillations in the unbalanced height field, which have amplitudes of up to 60 m with a dominant periodicity of about 5 to 6 h, are practically eliminated by both initialization methods. The rotational wind component is smooth even for the unbalanced initial state. The small-scale spatial features of the irrotational wind component are drastically reduced by initialization. Both the nonlinear normal-mode and the bounded-derivative initialization methods yield similar divergence fields centered around the areas of highest orography. The comparison shows that there is no significant loss of information in the mass and momentum fields, despite the fact that the bounded-derivative method employs only the original, rotational wind component to construct a balanced initial state compared to the normal-mode method, which, in addition, makes use of the unbalanced divergent wind and height fields.

Semazzi, F. H. M.↗

An error bound for a discrete reduced order model of a linear multivariable system

The design of feasible controllers for high dimension multivariable systems can be greatly aided by a method of model reduction. In order for the design based on the order reduction to include a guarantee of stability, it is sufficient to have a bound on the model error. Previous work has provided such a bound for continuous-time systems for algorithms based on balancing. In this note an L-infinity bound is derived for model error for a method of order reduction of discrete linear multivariable systems based on balancing.

Al-Saggaf, Ubaid M.↗

A lower bound for the decoder error probability of the linear MDS code

A lower bound for the decoder error probability (P sub E (u)) of a linear maximum distance separable (MDS) code is derived by counting the dominant types of decoding words around code words. It is shown that the lower bound derived is similar in form, and close numerically, to the upper bound derived.

Cheung, K.-M.↗

Inflectional instabilities in the wall region of bounded turbulent shear flows

The primary thrust of this research was to identify one or more mechanisms responsible for strong turbulence production events in the wall region of bounded turbulent shear flows. Based upon previous work in a transitional boundary layer, it seemed highly probable that the production events were preceded by an inflectional velocity profile which formed on the interface between the low-speed streak and the surrounding fluid. In bounded transitional flows, this unstable profile developed velocity fluctuations in the streamwise direction and in the direction perpendicular to the sheared surface. The rapid growth of these instabilities leads to a breakdown and production of turbulence. Since bounded turbulent flows have many of the same characteristics, they may also experience a similar type of breakdown and turbulence production mechanism.

Swearingen, Jerry D.↗

Search for bound states of the eta-meson in light nuclei

A search for nuclear-bound states of the eta meson was carried out. Targets of lithium, carbon, oxygen, and aluminum were placed in a pion(+) beam at 800 MeV/c. A predicted eta bound state in O-15* (E sub x approx. = 540 MeV) with a width of approx. 9 MeV was not observed. A bound state of a size 1/3 of the predicted cross section would have been seen in this experiment at a confidence level of 3sigma (P is greater than 0.9987).

Chrien, R. E.↗

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.↗

Bounds on dark matter in solar orbit

The possibility is considered that a spherical distribution of dark matter (DM), matter not visible with current instruments, is trapped in the sun's gravitational field. Bounds are placed from the motion of Uranus and Neptune, on the amount of DM that could be so trapped within the radius of those planets' orbits, as follows: from the Voyager 2, Uranus-flyby data new, more accurate ephemeris values are generated. Trapped DM mass is bounded by noting that such a distribution would increase the effective mass of the sun as seen by the outer planets and by using the new ephemeris values to bound such an increase.

Anderson, John D.↗

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗

General upper bound on single-event upset rate

A technique of predicting an upper bound on the rate at which single-event upsets due to ionizing radiation occur in semiconducting memory cells is described. The upper bound on the upset rate, which depends on the high-energy particle environment in earth orbit and accelerator cross-section data, is given by the product of an upper-bound linear energy-transfer spectrum and the mean cross section of the memory cell. Plots of the spectrum are given for low-inclination and polar orbits. An alternative expression for the exact upset rate is also presented. Both methods rely only on experimentally obtained cross-section data and are valid for sensitive bit regions having arbitrary shape.

Chlouber, Dean↗