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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Performance Bounds on Two Concatenated, Interleaved Codes

A method has been developed of computing bounds on the performance of a code comprised of two linear binary codes generated by two encoders serially concatenated through an interleaver. Originally intended for use in evaluating the performances of some codes proposed for deep-space communication links, the method can also be used in evaluating the performances of short-block-length codes in other applications. The method applies, more specifically, to a communication system in which following processes take place: At the transmitter, the original binary information that one seeks to transmit is first processed by an encoder into an outer code (Co) characterized by, among other things, a pair of numbers (n,k), where n (n > k)is the total number of code bits associated with k information bits and n k bits are used for correcting or at least detecting errors. Next, the outer code is processed through either a block or a convolutional interleaver. In the block interleaver, the words of the outer code are processed in blocks of I words. In the convolutional interleaver, the interleaving operation is performed bit-wise in N rows with delays that are multiples of B bits. The output of the interleaver is processed through a second encoder to obtain an inner code (Ci) characterized by (ni,ki). The output of the inner code is transmitted over an additive-white-Gaussian- noise channel characterized by a symbol signal-to-noise ratio (SNR) Es/No and a bit SNR Eb/No. At the receiver, an inner decoder generates estimates of bits. Depending on whether a block or a convolutional interleaver is used at the transmitter, the sequence of estimated bits is processed through a block or a convolutional de-interleaver, respectively, to obtain estimates of code words. Then the estimates of the code words are processed through an outer decoder, which generates estimates of the original information along with flags indicating which estimates are presumed to be correct and which are found to be erroneous. From the perspective of the present method, the topic of major interest is the performance of the communication system as quantified in the word-error rate and the undetected-error rate as functions of the SNRs and the total latency of the interleaver and inner code. The method is embodied in equations that describe bounds on these functions. Throughout the derivation of the equations that embody the method, it is assumed that the decoder for the outer code corrects any error pattern of t or fewer errors, detects any error pattern of s or fewer errors, may detect some error patterns of more than s errors, and does not correct any patterns of more than t errors. Because a mathematically complete description of the equations that embody the method and of the derivation of the equations would greatly exceed the space available for this article, it must suffice to summarize by reporting that the derivation includes consideration of several complex issues, including relationships between latency and memory requirements for block and convolutional codes, burst error statistics, enumeration of error-event intersections, and effects of different interleaving depths. In a demonstration, the method was used to calculate bounds on the performances of several communication systems, each based on serial concatenation of a (63,56) expurgated Hamming code with a convolutional inner code through a convolutional interleaver. The bounds calculated by use of the method were compared with results of numerical simulations of performances of the systems to show the regions where the bounds are tight (see figure).

Moision, Bruce↗
NASA NTRS2009

Bounded Linear Stability Analysis - A Time Delay Margin Estimation Approach for Adaptive Control

This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.

Nguyen, Nhan T.↗
NASA NTRS2011

Bounding Species Distribution Models

Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern. Many investigators now recognize that extrapolations of these models with geographic information systems (GIS) might be sensitive to the environmental bounds of the data used in their development, yet there is no recommended best practice for "clamping" model extrapolations. We relied on two commonly used modeling approaches: classification and regression tree (CART) and maximum entropy (Maxent) models, and we tested a simple alteration of the model extrapolations, bounding extrapolations to the maximum and minimum values of primary environmental predictors, to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States. Findings suggest that multiple models of bounding, and the most conservative bounding of species distribution models, like those presented here, should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5): 642-647, 2011].

Stohlgren, Thomas J.↗
NASA NTRS2016

On the Calculation of Uncertainty Statistics with Error Bounds for CFD Calculations Containing Random Parameters and Fields

This chapter discusses the ongoing development of combined uncertainty and error bound estimates for computational fluid dynamics (CFD) calculations subject to imposed random parameters and random fields. An objective of this work is the construction of computable error bound formulas for output uncertainty statistics that guide CFD practitioners in systematically determining how accurately CFD realizations should be approximated and how accurately uncertainty statistics should be approximated for output quantities of interest. Formal error bounds formulas for moment statistics that properly account for the presence of numerical errors in CFD calculations and numerical quadrature errors in the calculation of moment statistics have been previously presented in [8]. In this past work, hierarchical node-nested dense and sparse tensor product quadratures are used to calculate moment statistics integrals. In the present work, a framework has been developed that exploits the hierarchical structure of these quadratures in order to simplify the calculation of an estimate of the quadrature error needed in error bound formulas. When signed estimates of realization error are available, this signed error may also be used to estimate output quantity of interest probability densities as a means to assess the impact of realization error on these density estimates. Numerical results are presented for CFD problems with uncertainty to demonstrate the capabilities of this framework.

Uncertainty↗
NASA NTRS1971

Bounding filters in the presence of inexactly known parameters.

Optimum bounding filters are derived for a specific version (steady state time-invariant with scalar observations) of the Kalman-Bucy filtering problem with inexactly known system parameters and for the Wiener filtering problem with inexactly known spectral densities. The designed filter obtains a bound on the actual error covariance which is not known, and it also prevents apparent divergence. Conditions are derived for the design of the optimum bounding filter within a permissible class of solutions; this turns out to be the min-max mean-square error filter for an extended class of solutions. The bounding filter can be of lower order than the original system, and a technique is devised for reducing the order of the filtering system and concurrently obtaining a figure of merit for its performance.

Nahi, N. E.↗
NASA NTRS1973

The initiation, development, and decay of the secondary flow in a bounded jet

The secondary flow in a low aspect ratio incompressible turbulent bounded jet is described in terms of a near, middle, and far field in which the secondary motion is initiated, developed, and decayed, respectively. The initiation of the secondary flow is explained by the distortion of the planar vortex loops which bound the jet at the exit plane. In the region away from the bounding plates, the vortex loop distortion is similar to that found in rectangular free jets; however, the bounding plates cause an additional production of streamwise vorticity near the plates which has no counterpart in the free jet flow. Downstream of the jet core region, a large-scale secondary flow developes from this vorticity. Farther downstream the secondary flow decays; the resultant flow may be characterized as a combination of a plane jet and boundary layer flows. This explanation is supported by the vorticity and velocity data of this investigation.

Holdeman, J. D.↗
NASA NTRS1976

Conjugate quasilinear Dirichlet and Neumann problems and a posteriori error bounds

Quasilinear Dirichlet and Neumann problems on a rectangle D with boundary D prime are considered. Using these concepts, conjugate problems, that is, a pair of one Dirichlet and one Neumann problem, the minima of the energies of which add to zero, are introduced. From the concept of conjugate problems, two-sided bounds for the energy of the exact solution of any given Dirichlet or Neumann problem are constructed. These two-sided bounds for the energy at the exact solution are in turn used to obtain a posteriori error bounds for the norm of the difference of the approximate and exact solutions of the problem. These bounds do not involve the unknown exact solution and are easily constructed numerically.

Lavery, J. E.↗
NASA NTRS1976

Linear feedback rate bounds for regressive channels

Bounds for the linear feedback capacity of m-th order Gaussian autoregressive channels are derived. The upper bound is tighter than that found by Tiernan and Schalwijk (1974) for the feedback capacity of a first-order autoregressive Gaussian channel with not necessarily linear processing. The separation between the upper and lower bounds is small, and it is conjectured that the lower bound converges to the feedback capacity of the first-order channel as the number of signals tends to infinity.

Butman, S. A.↗
NASA NTRS1977

Imaginary-frequency polarizability and van der Waals force constants of two-electron atoms, with rigorous bounds

Variational functionals of Braunn and Rebane (1972) for the imagery-frequency polarizability (IFP) have been generalized by the method of Gramian inequalities to give rigorous upper and lower bounds, valid even when the true (but unknown) unperturbed wavefunction must be represented by a variational approximation. Using these formulas in conjunction with flexible variational trial functions, tight error bounds are computed for the IFP and the associated two- and three-body van der Waals interaction constants of the ground 1(1S) and metastable 2(1,3S) states of He and Li(+). These bounds generally establish the ground-state properties to within a fraction of a per cent and metastable properties to within a few per cent, permitting a comparative assessment of competing theoretical methods at this level of accuracy. Unlike previous 'error bounds' for these properties, the present results have a completely a priori theoretical character, with no empirical input data.

Glover, R. M.↗
NASA NTRS1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

An upper bound on the rate of a binary code as a function of minimum code distance (using a Hamming code metric) is arrived at from Delsarte-MacWilliams inequalities. The upper bound so found is asymptotically less than Levenshtein's bound, and a fortiori less than Elias' bound. Appendices review properties of Krawtchouk polynomials and Q-polynomials utilized in the rigorous proofs.

Mceliece, R. J.↗
NASA NTRS1991

Analysis of upper and lower bounds of the frame noise in linear detector arrays

This paper estimates the upper and lower bounds of the frame noise of a linear detector array that uses a one-dimensional scan pattern. Using chi-square distribution, it is analytically shown why it is necessary to use the average of the variances and not the average of the standard deviations to estimate these bounds. Also, a criteria for determining whether any excessively noisy lines exist among the detectors is derived from these bounds. Using a Gaussian standard random variable generator, these bounds are demonstrated to be accurate within the specified confidence interval. A silicon detector array is then used for actual dark current measurements. The criterion developed for determination of noisy detectors is checked on the experimentally obtained data.

Jaggi, S.↗
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 NTRS1999

Cramer-Rao Bounds for M-PSK Packets with Random Phase

In this paper, we derive new Cramer-Rao bounds (CRBs) for the estimation of phase from a block of random M-PSK (M=8) symbols for the case where the phase to be estimated is a random variable(r.v.). Existing bounds for 2 and 4-PSK which model the phase as non-random are extended to obtain a new 8-PSK CRB. The new bound which models the phase as a r.v. is compared to the new 8-PSK bound which models the phase as non-random. With 8-PSK we see clearly that use of the random phase CRB more accurately models the behavior if the phase, as normally happens, is supposed to be constrained to the interval [-pi/M,pi/M).

Drake, Jeffrey↗
NASA NTRS1999

Lower Bounds for Phase Estimation of PSK Packets with Random Phase

In this paper, we derive new Cramer-Rao bounds (CRBs) for the estimation of phase from a block of random M-PSK (M=2,4,8) symbols where the phase to be estimated is a random variable. Existing bounds for 2 and 4-PSK which model the phase as non-random are extended to obtain a new 8-PSK CRB. The new random phase bounds are compared to the new 8-PSK and existing 2,4-PSK bounds which model the phase as non-random. We see that the random phase CRBs more accurately model the behavior if the phase, as normally happens, is suppose to be constrained to the interval [-pi/M,pi/M).

Drake, Jeffrey↗
NASA NTRS2001

Lifetime of a Chemically Bound Helium Compound

The rare-gas atoms are chemically inert, to an extent unique among all elements. This is due to the stable electronic structure of the atoms. Stable molecules with chemically bound rare-gas atoms are, however, known. A first such compound, XePtF6, W2S prepared in 1962 and since then a range of molecules containing radon, xenon and krypton have been obtained. Most recently, a first stable chemically bound compound of argon was prepared, leaving neon and helium as the only elements for which stable chemically bound molecules are not yet known. Electronic structure calculations predict that a metastable species HHeF exists, but significance of the result depends on the unknown lifetime. Here we report quantum dynamics calculations of the lifetime of HHeF, using accurate interactions computed from electronic structure theory. HHeF is shown to disintegrate by tunneling through energy barriers into He + HF and H + He + F the first channel greatly dominating. The lifetime of HHeF is more than 120 picoseconds, that of DHeF is 14 nanoseconds. The relatively long lifetimes are encouraging for the preparation prospects of this first chemically bound helium compound.

Chaban, Galina M.↗
NASA NTRS2003

Structured Uncertainty Bound Determination From Data for Control and Performance Validation

This report attempts to document the broad scope of issues that must be satisfactorily resolved before one can expect to methodically obtain, with a reasonable confidence, a near-optimal robust closed loop performance in physical applications. These include elements of signal processing, noise identification, system identification, model validation, and uncertainty modeling. Based on a recently developed methodology involving a parameterization of all model validating uncertainty sets for a given linear fractional transformation (LFT) structure and noise allowance, a new software, Uncertainty Bound Identification (UBID) toolbox, which conveniently executes model validation tests and determine uncertainty bounds from data, has been designed and is currently available. This toolbox also serves to benchmark the current state-of-the-art in uncertainty bound determination and in turn facilitate benchmarking of robust control technology. To help clarify the methodology and use of the new software, two tutorial examples are provided. The first involves the uncertainty characterization of a flexible structure dynamics, and the second example involves a closed loop performance validation of a ducted fan based on an uncertainty bound from data. These examples, along with other simulation and experimental results, also help describe the many factors and assumptions that determine the degree of success in applying robust control theory to practical problems.

Lim, Kyong B.↗
NASA NTRS2003

Search for Chemically Bound Water in the Surface Layer of Mars Based on HEND/Mars Odyssey Data

This study is emphasized on search for signatures of chemically bound water in surface layer of Mars based on data acquired by High Energy Neutron Detector (HEND) which is part of the Mars Odyssey Gamma Ray Spectrometer (GRS). Fluxes of epithermal (probe the upper 1-2 m) and fast (the upper 20-30 cm) neutrons, considered in this work, were measured since mid February till mid June 2002. First analysis of this data set with emphasis of chemically bound water was made. Early publications of the GRS results reported low neutron flux at high latitudes, interpreted as signature of ground water ice, and in two low latitude areas: Arabia and SW of Olympus Mons (SWOM), interpreted as 'geographic variations in the amount of chemically and/or physically bound H2O and or OH...'. It is clear that surface materials of Mars do contain chemically bound water, but its amounts are poorly known and its geographic distribution was not analyzed.

Basilevsky, A. T.↗
NASA NTRS1992

Casein kinase II protein kinase is bound to lamina-matrix and phosphorylates lamin-like protein in isolated pea nuclei

A casein kinase II (CK II)-like protein kinase was identified and partially isolated from a purified envelope-matrix fraction of pea (Pisum sativum L.) nuclei. When [gamma-32P]ATP was directly added to the envelope-matrix preparation, the three most heavily labeled protein bands had molecular masses near 71, 48, and 46 kDa. Protein kinases were removed from the preparation by sequential extraction with Triton X-100, EGTA, 0.3 M NaCl, and a pH 10.5 buffer, but an active kinase still remained bound to the remaining lamina-matrix fraction after these treatments. This kinase had properties resembling CK II kinases previously characterized from animal and plant sources: it preferred casein as an artificial substrate, could use GTP as efficiently as ATP as the phosphoryl donor, was stimulated by spermine, was calcium independent, and had a catalytic subunit of 36 kDa. Some animal and plant CK II kinases have regulatory subunits near 29 kDa, and a lamina-matrix-bound protein of this molecular mass was recognized on immunoblot by anti-Drosophila CK II polyclonal antibodies. Also found associated with the envelope-matrix fraction of pea nuclei were p34cdc2-like and Ca(2+)-dependent protein kinases, but their properties could not account for the protein kinase activity bound to the lamina. The 71-kDa substrate of the CK II-like kinase was lamin A-like, both in its molecular mass and in its cross-reactivity with anti-intermediate filament antibodies. Lamin phosphorylation is considered a crucial early step in the entry of cells into mitosis, so lamina-bound CK II kinases may be important control points for cellular proliferation.

NASA Discipline Plant Biology↗