Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounded”

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 613 records · Page 34

Finishing with Free and Bound Abrasive

Abrasive finishing of a single crystal by means of free and bound abrasive is compared in conditions with forced and free workpiece rotation. Experimental data show that the influence of forced and free workpiece rotation is different for finishing by means of free and bound abrasive. In machining by bound abrasive with forced rotation, the cutting rate and productivity are 25% higher, on average, than with free rotation.

36 MATERIALS SCIENCE↗

Universal lower bound on the axion decay constant from free streaming effects

We show that enhancement of the axion relic abundance compared to the standard misalignment contribution generically leads to the production of nonzero momentum axion modes, resulting in warm dark matter behavior and enhanced isocurvature perturbations. It leads to universal constraints on the axion parameter space that are independent of detailed model assumptions and cosmological history. For models enhancing relic abundance with gradient axion modes, observations of the Lyman-$α$ forest impose a lower bound on the axion decay constant, $f_a \gtrsim 10^{15} {\rm GeV}\,(10^{-18}{\rm eV}/m_a)$, from the free-streaming effect. For models relying on the delay of coherent axion oscillations, we obtain a slightly weaker bound, $f_a \gtrsim 10^{14} {\rm GeV}\,(10^{-18}{\rm eV}/m_a)$. We make relatively conservative choices to establish these universal bounds but also provide scaling parameters that can be calibrated for stronger constraints in concrete models and updated as observations improve.

Harigaya, Keisuke [Chicago U., EFI; Tokyo U., IPMU↗

Bounded state variables and the calculus of variations

An optimal control problem with bounded state variables is transformed into a Lagrange problem by means of differentiable mappings which take some Euclidean space onto the control and state regions. Whereas all such mappings lead to a Lagrange problem, it is shown that only those which are defined as acceptable pairs of transformations are suitable in the sense that solutions to the transformed Lagrange problem will lead to solutions to the original bounded state problem and vice versa. In particular, an acceptable pair of transformations is exhibited for the case when the control and state regions are right parallelepipeds. Finally, a description of the necessary conditions for the bounded state problem which were obtained by this method is given.

Hanafy, L. M.↗

Bounded state space

This investigation is divided functionally into three different areas: (1) study of bounded state space, (2) nonlinear smoothing theory, and (3) system identification. (1) Study of bounded state space: necessary and sufficient conditions for an optimal control are obtained for a bounded state space optimal control problem. The difficulty of determining the so-called jump conditions is eliminated; however, the problem of determining the points where the response either enters or leaves the boundary still remains unsolved. (2) Nonlinear smoothing theory: nonlinear fixed-interval, fixed-point and fixed-lag smoothing of a random signal generated by a stochastic differential equation are investigated. Results on the asymptotic stability of a linear constant-parameter fixed-interval smoothing filter are obtained. (3) System identification: a particular stochastic modelling problem is solved. An Ito stochastic integral equation is used to mathematically model a black box having multiple inputs and multiple outputs. A new method for identifying system parameters is presented.

Eyman, E. D.↗

High altitude infrared spectroscopic evidence for bound water on Mars.

The reflectivity of the Martian surface has been measured between 2.0 and 4.0 microns. A broad absorption band is observed which has a minimum at 2.85 microns. The position and shape of the band is compared to features in numerous terrestrial minerals. Bound water in the Martian surface material is the most likely cause of the observed band. The strength of the observed band suggests a bound water content of approximately 1% by weight. The band is inconsistent with more than a few % limonite or hydrated polymeric carbon suboxide. A mean particle radius of about 100 microns is deduced. The quality of bound water derived has a range of geological, climatic, and exobiological implications.

Houck, J. R.↗

Bounds on the performance of a class of digital communication systems

Bounds on the capacity of a class of digital communication channels are derived. Equating the bounds on capacity to rate-distortion functions of (typical) sources in turn produces bounds on the performance of a class of digital communication systems. For ratios of squared quantization level to noise variance much less than one, the power requirements for this class of digital communication systems are shown to be within approximately 3 dB of the theoretical optimum.

Polk, D. R.↗

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