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 685 records · Page 38

Preparation and Characterization of Fluorescent Derivatives of Chicken Egg White Lysozyme

Fluorescence is one of the most versatile and powerful tools for the study of macromolecules. While most proteins are intrinsically fluorescent, working at crystallization concentrations require the use of covalently prepared derivatives added as tracers. This approach requires derivatives that do not markedly affect the crystal packing. We have prepared a number of fluorescent derivatives of chicken egg white lysozyme with probes bound to one of two different sites on the protein molecule. Lucifer yellow, cascade blue, and 5-(2-aminoethyl)aminonapthalene-l-sulfonic acid (EDANS) have been attached to the side chain carboxyl of asp101 using a carbodiimide coupling procedure. asp101 lies within the active site cleft, and it is believed that the probes are at least partially "buried" within that cleft. Lucifer yellow and MANS probes with iodoacetamide reactive groups have been bound to hisl5, located on the "back side" of the molecule relative to the active site. The fluorescently labeled protein is readily purified from the starting material by cation exchange chromatography. All the derivatives fluoresce in both the solution and the crystalline states. Fluorescence characterization has focused on determining the bound probe quantum yields, lifetimes, absorption and emission spectra, and quenching by added solutes in comparison to the free probe. No appreciable changes are found in the lifetimes of any of the probes except for cascade blue, where Tau(sub free) = 3.52 ns vrs Tau(sub bound) = 2.8 ns. Spectral shifts are found in most cases. Particularly strong quenching upon binding is found in the case of the cascade blue derivative, likely due to probe interactions with the active site cleft. While none of the asp101 bound probes are well quenched by commonly employed solutes, such as potassium and sodium iodide, acrylamide, primuline, the chloride salts of manganese, cesium, and cobalt, trifluoroacetamide, trichloroethanol, and thallium iodide, in those cases where quenching is observed the bound probe is less efficiently quenched relative to the free probe. This indicates that the bound probes are less accessible to the bulk solution, an expected finding for attachment within the active site cleft. Attempts have been made to bind other molecules to these sites, with varying success. Interestingly, all three probes contain one or more sulfonate ((Ar-S03)-) groups. We have not been successful in binding analogous probes without sulfate groups such as pyrene, or with derivatized sulfonate groups such as dansyl type probes, analogous to MANS but where the sulfonate group is derivatized, Ar-S02-N2C2H7. None of the probes is rigidly bound to the protein, i.e., they all have a probe motion superimposed on that of the protein.

Sumida, John↗

Calculation of radiative transition probabilities and lifetimes

Procedures for calculating bound-bound and bound-continuum (free) radiative transition probabilities and radiative lifetimes are summarized. Calculations include rotational dependence and R-dependent electronic transition moments (no Franck-Condon or R-centroid approximation). Detailed comparisons of theoretical results with experimental measurements are made for bound-bound transitions in the A-X systems of LiH and Na2. New bound-free results are presented for LiH. New bound-free results and comparisons with very recent fluorescence experiments are presented for Na2.

Zemke, W. T.↗

Pressure Oscillations in Shuttle Solid Rocket Motors

All Shuttle Solid Rocket Motors (SRM's) exhibit low amplitude longitudinal pressure oscillations during motor burn. Although the oscillations have no known deleterious effect on motor ballistics, the acoustic pressure variations cause thrust oscillations that might affect Shuttle systems or components. The acoustic mode of greatest interest is the first or fundamental mode which, in the SRM, has a nominal frequency of 14-Hz. Oscillations in the SRM are believed to be caused by coupling between large scale vortices and the acoustic modes of the motor chamber. The vortices are thought to be created in the region of the motor segment interfaces and are inherent in the design of the motor. In such a situation the usual approach is to measure the oscillations and assess their impact on any sensitive components through tests and analysis. Questionable components can be altered to survive the vibration environment. As motor firings occur, oscillations are monitored to determine whether there are changes in the nature of the oscillations. Since the first static test, SRM's have been equipped with instrumentation especially designed to acquire chamber pressure oscillation data. Data from the first SRM static tests were used to establish predicted upper bounds for the maximum amplitudes in the latter half of burn. Those bounds have been used as a basis for worst-case simulation scenarios by specialists in structural dynamics at NASA and Rockwell International and to provide a basis for evaluating data from individual motors which were tested subsequent to the original SRM's. This paper updates the upper bounds prediction the High Performance Motors (HPM) by including data from all static tests performed to date including both original SRM's and post Challenger SRM's or Reusable Solid Rocket Motors (RSRM) in which the joint design was changed. All together, this study examines 27 SRM motors, 16 HPM motors and 11 RSRM motors. Predicted upper bounds will be made for both the first and second longitudinal modes. The first mode upper bounds will be compared to the original seven standard rocket motors (STD). The results indicate that, although the upper bounds have increased, they are still within acceptable bounds.

Blomshield, Fred S.↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

The Limits of Coding with Joint Constraints on Detected and Undetected Error Rates

We develop a remarkably tight upper bound on the performance of a parameterized family of bounded angle maximum-likelihood (BA-ML) incomplete decoders. The new bound for this class of incomplete decoders is calculated from the code's weight enumerator, and is an extension of Poltyrev-type bounds developed for complete ML decoders. This bound can also be applied to bound the average performance of random code ensembles in terms of an ensemble average weight enumerator. We also formulate conditions defining a parameterized family of optimal incomplete decoders, defined to minimize both the total codeword error probability and the undetected error probability for any fixed capability of the decoder to detect errors. We illustrate the gap between optimal and BA-ML incomplete decoding via simulation of a small code.

Undetected Error Rate↗

Explicit construction of quadratic Lyapunov functions for the small gain, positivity, circle, and Popov theorems and their application to robust stability

Lyapunov function proofs of sufficient conditions for asymptotic stability are given for feedback interconnections of bounded real and positive real transfer functions. Two cases are considered: (1) a proper bounded real (resp., positive real) transfer function with a bounded real (resp., positive real) time-varying memoryless nonlinearity; and (2) two strictly proper bounded real (resp., positive real) transfer functions. A similar treatment is given for the circle and Popov theorems. Application of these results to robust stability with time-varying bounded real, positive real, and sector-bounded uncertainty is discussed.

Haddad, Wassim M.↗

An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

Murphy, Patrick Charles↗

Interference Lattice-based Loop Nest Tilings for Stencil Computations

A common method for improving performance of stencil operations on structured multi-dimensional discretization grids is loop tiling. Tile shapes and sizes are usually determined heuristically, based on the size of the primary data cache. We provide a lower bound on the numbers of cache misses that must be incurred by any tiling, and a close achievable bound using a particular tiling based on the grid interference lattice. The latter tiling is used to derive highly efficient loop orderings. The total number of cache misses of a code is the sum of (necessary) cold misses and misses caused by elements being dropped from the cache between successive loads (replacement misses). Maximizing temporal locality is equivalent to minimizing replacement misses. Temporal locality of loop nests implementing stencil operations is optimized by tilings that avoid data conflicts. We divide the loop nest iteration space into conflict-free tiles, derived from the cache miss equation. The tiling involves the definition of the grid interference lattice an equivalence class of grid points whose images in main memory map to the same location in the cache-and the construction of a special basis for the lattice. Conflicts only occur on the boundaries of the tiles, unless the tiles are too thin. We show that the surface area of the tiles is bounded for grids of any dimensionality, and for caches of any associativity, provided the eccentricity of the fundamental parallelepiped (the tile spanned by the basis) of the lattice is bounded. Eccentricity is determined by two factors, aspect ratio and skewness. The aspect ratio of the parallelepiped can be bounded by appropriate array padding. The skewness can be bounded by the choice of a proper basis. Combining these two strategies ensures that pathologically thin tiles are avoided. They do not, however, minimize replacement misses per se. The reason is that tile visitation order influences the number of data conflicts on the tile boundaries. If two adjacent tiles are visited successively, there will be no replacement misses on the shared boundary. The iteration space may be covered with pencils larger than the size of the cache while avoiding data conflicts if the pencils are traversed by a scanning-face method. Replacement misses are incurred only on the boundaries of the pencils, and the number of misses is minimized by maximizing the volume of the scanning face, not the volume of the tile. We present an algorithm for constructing the most efficient scanning face for a given grid and stencil operator. In two dimensions it is based on a continued fraction algorithm. In three dimensions it follows Voronoi's successive minima algorithm. We show experimental results of using the scanning face, and compare with canonical loop orderings.

VanderWijngaart, Rob F.↗

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗

Validation of the SURE Program, phase 1

Presented are the results of the first phase in the validation of the SURE (Semi-Markov Unreliability Range Evaluator) program. The SURE program gives lower and upper bounds on the death-state probabilities of a semi-Markov model. With these bounds, the reliability of a semi-Markov model of a fault-tolerant computer system can be analyzed. For the first phase in the validation, fifteen semi-Markov models were solved analytically for the exact death-state probabilities and these solutions compared to the corresponding bounds given by SURE. In every case, the SURE bounds covered the exact solution. The bounds, however, had a tendency to separate in cases where the recovery rate was slow or the fault arrival rate was fast.

Dotson, Kelly J.↗

Preliminary investigation of stability of a fin-stiffened slender strut

A fin-stiffened strut concept which possesses high bending stiffness and low packaged volume has been identified for use on large space structures. The concept incorporates three curved fins which deploy from a core tube to increase the effective cross-sectional moment of inertia, the buckling load, and the vibration frequency of the strut. A strut design incorporating welded fin connections provides an upper bound of the strut buckling load. A strut design which allows the individual fins and core to move independently in the strut axial direction provides a lower bound of the strut buckling load which is approximately 20 to 25 percent of the upper bound. A practical strut design, incorporating hinge assemblies which constrain the fins to move together but independently of the core tube in the strut axial direction, provides a buckling load which is 75 to 80 percent of the upper bound. Euler's equation can be used to accurately predict buckling loads for the bounding designs. Flat plate finite element models of all designs give results that agree to within 10 percent of the experimental values. Equivalent beam models of the strut give results which are slightly less accurate.

Lake, Mark S.↗

Order reduction in linear state estimation under performance constraints

The design and analysis of minimal-order state estimators for possibly time-varying linear systems, under constraints on the maximal allowable mean-square error, are considered. A global lower bound on the optimal error is derived, along with a lower bound on the minimal estimator order, needed for meeting the performance constraint. The ideal reduced-order estimator which satisfies the lower bound is derived, along with conditions for its realizability. When the ideal estimator is not realizable, its structure forms a suboptimal estimator, which maintains, in some sense, a local optimality property and is called the pseudoideal estimator. The mean-square error of the pseudoideal estimator defines upper bounds on the optimal error and on the estimator order needed for meeting the performance constraint. The lower and the upper bounds on the order define a reduced search set for the design problem. When the distance between the ideal and the pseudoideal estimators is sufficiently small in a certain numerical sense, the pseudoideal estimator may be considered optimal for practical purposes.

Baram, Yoram↗

Ionic binding properties of carrier ampholytes

Radioactive ampholytes were synthesized with specific activity of 638 microCi/g. These were used in studies of ampholyte binding to target proteins under nonionic conditions. These radioactive ampholytes bound to target proteins but were dissociable in sodium chloride solutions with dissociation occurring in a concentration dependent way. The ampholytes could be dissociated from target molecules using excess unlabelled ampholytes synthesized in the laboratory as well as commercial ampholytes. Radioactive ampholytes were bound to target proteins with different isoelectric points, and the bound ampholytes were eluted and analyzed by recycling isoelectric focusing. The results showed that acidic proteins bound basic ampholytes and basic proteins bound acidic ampholytes.

Rodkey, L. Scott↗

Error control techniques for satellite and space communications

An expurgated upper bound on the event error probability of trellis coded modulation is presented. This bound is used to derive a lower bound on the minimum achievable free Euclidean distance d sub (free) of trellis codes. It is shown that the dominant parameters for both bounds, the expurgated error exponent and the asymptotic d sub (free) growth rate, respectively, can be obtained from the cutoff-rate R sub O of the transmission channel by a simple geometric construction, making R sub O the central parameter for finding good trellis codes. Several constellations are optimized with respect to the bounds.

Costello, Daniel J., Jr.↗

Astrophysics and cosmology closing in on neutrino masses

Massive neutrinos are expected in most grand unified theories that attempt to unify the strong and electroweak interactions. So far, heroic laboratory experiments have yielded only upper bounds on the masses of the elusive neutrinos. These bounds, however, are not very restrictive and cannot even exclude the possibility that the dark matter in the universe consists of neutrinos. The astrophysical and cosmological bounds on the masses of the muon and tau neutrinos, m(nu sub mu) and m(nu sub tau), which already are much more restrictive than the laboratory bounds, and the laboratory bound on the mass of the electron neutrino, m(nu sub e) can be improved significantly by future astrophysical and cosmological observations that perhaps will pin down the neutrino masses. Indeed, the recent results from the solar neutrino experiments combined with the seesaw mechanism for generating neutrino masses suggest that m(nu sub e) of about 10 to the -8th electron volts, m(nu sub mu) of about 0.001 electron volts, and m(nu sub tau) of about 10 electron volts, which can be tested in the near future by solar neutrino and accelerator experiments.

Dar, Arnon↗

Uncertainty relations as Hilbert space geometry

Precision measurements involve the accurate determination of parameters through repeated measurements of identically prepared experimental setups. For many parameters there is a 'natural' choice for the quantum observable which is expected to give optimal information; and from this observable one can construct an Heinsenberg uncertainty principle (HUP) bound on the precision attainable for the parameter. However, the classical statistics of multiple sampling directly gives us tools to construct bounds for the precision available for the parameters of interest (even when no obvious natural quantum observable exists, such as for phase, or time); it is found that these direct bounds are more restrictive than those of the HUP. The implication is that the natural quantum observables typically do not encode the optimal information (even for observables such as position, and momentum); we show how this can be understood simply in terms of the Hilbert space geometry. Another striking feature of these bounds to parameter uncertainty is that for a large enough number of repetitions of the measurements all V quantum states are 'minimum uncertainty' states - not just Gaussian wave-packets. Thus, these bounds tell us what precision is achievable as well as merely what is allowed.

Braunstein, Samuel L.↗

An analysis of spectral envelope-reduction via quadratic assignment problems

A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

George, Alan↗

Uncertainty Considerations for Ballistic Limit Equations

The overall risk for any spacecraft system is typically determined using a Probabilistic Risk Assessment (PRA). A PRA attempts to determine the overall risk associated with a particular mission by factoring in all known risks (and their corresponding uncertainties, if known) to the spacecraft during its mission. The threat to mission and human life posed by the mircro-meteoroid & orbital debris (MMOD) environment is one of the risks. NASA uses the BUMPER II program to provide point estimate predictions of MMOD risk for the Space Shuttle and the International Space Station. However, BUMPER II does not provide uncertainty bounds or confidence intervals for its predictions. With so many uncertainties believed to be present in the models used within BUMPER II, providing uncertainty bounds with BUMPER II results would appear to be essential to properly evaluating its predictions of MMOD risk. The uncertainties in BUMPER II come primarily from three areas: damage prediction/ballistic limit equations, environment models, and failure criteria definitions. In order to quantify the overall uncertainty bounds on MMOD risk predictions, the uncertainties in these three areas must be identified. In this paper, possible approaches through which uncertainty bounds can be developed for the various damage prediction and ballistic limit equations encoded within the shuttle and station versions of BUMPER II are presented and discussed. We begin the paper with a review of the current approaches used by NASA to perform a PRA for the Space Shuttle and the International Space Station, followed by a review of the results of a recent sensitivity analysis performed by NASA using the shuttle version of the BUMPER II code. Following a discussion of the various equations that are encoded in BUMPER II, we propose several possible approaches for establishing uncertainty bounds for the equations within BUMPER II. We conclude with an evaluation of these approaches and present a recommendation regarding which of them would be the most appropriate to follow.

Schonberg, W. P.↗