Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generalization 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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Retransmission error control with memory

In this paper, an error control technique that is a basic improvement over automatic-repeat-request ARQ is presented. Erroneously received blocks in an ARQ system are used for error control. The technique is termed ARQ-with-memory (MRQ). The general MRQ system is described, and simple upper and lower bounds are derived on the throughput achievable by MRQ. The performance of MRQ with respect to throughput, message delay and probability of error is compared to that of ARQ by simulating both systems using error data from a VHF satellite channel being operated in the ALOHA packet broadcasting mode.

Sindhu, P. S.↗
NASA NTRS1978

Diagnosable systems for intermittent faults

The fault diagnosis capabilities of systems composed of interconnected units capable of testing each other are studied for the case of systems with intermittent faults. A central role is played by the concept of t(i)-fault diagnosability. A system is said to be t(i)-fault diagnosable when it is such that if no more than t(i) units are intermittently faulty then a fault-free unit will never be diagnosed as faulty and the diagnosis at any time is at worst incomplete. Necessary and sufficient conditions for t(i)-fault diagnosability are proved, and bounds for t(i) are established. The conditions are in general more restrictive than those for permanent-fault diagnosability. For intermittent faults there is only one testing strategy (repetitive testing), and consequently only one type of intermittent-fault diagnosable system.

Mallela, S.↗
NASA NTRS1982

Evaluation of trends in wheat yield models

Trend terms in models for wheat yield in the U.S. Great Plains for the years 1932 to 1976 are evaluated. The subset of meteorological variables yielding the largest adjusted R(2) is selected using the method of leaps and bounds. Latent root regression is used to eliminate multicollinearities, and generalized ridge regression is used to introduce bias to provide stability in the data matrix. The regression model used provides for two trends in each of two models: a dependent model in which the trend line is piece-wise continuous, and an independent model in which the trend line is discontinuous at the year of the slope change. It was found that the trend lines best describing the wheat yields consisted of combinations of increasing, decreasing, and constant trend: four combinations for the dependent model and seven for the independent model.

Ferguson, M. C.↗
NASA NTRS1983

An intercomparison of ozone profile measurements from LIMS, SAGE, and SBUV

Ozone profile measurements by the Limb IR Monitor of Stratosphere (LIMS) and the Solar Backscatter UV (SBUV) aboard the Nimbus satellite, and the Stratospheric Aerosol and Gas Experiment (SAGE) aboard the AEM-2 satellite are intercompared in an effort to assess the quality of satellite ozone retrieval techniques. Good correlation between LIMS and SBUV observations is noted in the ozone layer bounded by pressures of 31.2-15.6 mb; absolute differences are generally less than 10 percent, with similar zonal variations. Above 35 km SAGE values are systematically larger than SBUV or LIMS. The differences generally increase with height and are largest in the tropics. Finally, excellent agreement is noted to exist among the three data sets between 10 and 35 km of altitude with respect to the latitude dependence of the ozone profiles.

Fleig, A. J.↗
NASA NTRS1990

Bounds on halo-particle interactions from interstellar calorimetry

It is shown that the existence of neutral interstellar clouds constrains the interaction of any particulate dark-matter candidate with atomic hydrogen to be quite small. Even for a halo particle of mass 1 PeV (10 to the 6 GeV), it is shown that the cross section with hydrogen must be smaller than the typical atomic cross section that is expected for a positively charged particle bound to an electron. The argument presented is that if the clouds are in equilibrium, then the rate at which energy is deposited by collisions with dark-matter particles must be smaller than the rate at which the cloud can cool. This argument is used to constrain the interaction cross section of dark matter with hydrogen. Remarks are made on the general viability of charged dark matter. Comments are also made on a bound which derives from the dynamical stability of the halo.

Chivukula, Sekhar R.↗
NASA NTRSDate not supplied

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗
NASA NTRS2008

Safe Upper-Bounds Inference of Energy Consumption for Java Bytecode Applications

Many space applications such as sensor networks, on-board satellite-based platforms, on-board vehicle monitoring systems, etc. handle large amounts of data and analysis of such data is often critical for the scientific mission. Transmitting such large amounts of data to the remote control station for analysis is usually too expensive for time-critical applications. Instead, modern space applications are increasingly relying on autonomous on-board data analysis. All these applications face many resource constraints. A key requirement is to minimize energy consumption. Several approaches have been developed for estimating the energy consumption of such applications (e.g. [3, 1]) based on measuring actual consumption at run-time for large sets of random inputs. However, this approach has the limitation that it is in general not possible to cover all possible inputs. Using formal techniques offers the potential for inferring safe energy consumption bounds, thus being specially interesting for space exploration and safety-critical systems. We have proposed and implemented a general frame- work for resource usage analysis of Java bytecode [2]. The user defines a set of resource(s) of interest to be tracked and some annotations that describe the cost of some elementary elements of the program for those resources. These values can be constants or, more generally, functions of the input data sizes. The analysis then statically derives an upper bound on the amount of those resources that the program as a whole will consume or provide, also as functions of the input data sizes. This article develops a novel application of the analysis of [2] to inferring safe upper bounds on the energy consumption of Java bytecode applications. We first use a resource model that describes the cost of each bytecode instruction in terms of the joules it consumes. With this resource model, we then generate energy consumption cost relations, which are then used to infer safe upper bounds. How energy consumption for each bytecode instruction is measured is beyond the scope of this paper. Instead, this paper is about how to infer safe energy consumption estimations assuming that those energy consumption costs are provided. For concreteness, we use a simplified version of an existing resource model [1] in which an energy consumption cost for individual Java opcodes is defined.

Navas, Jorge↗
NASA NTRS2013

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗
NASA NTRS1992

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗
NASA NTRS1977

An implicit-iterative solution of the heat conduction equation with a radiation boundary condition

For the problem of predicting one-dimensional heat transfer between conducting and radiating mediums by an implicit finite difference method, four different formulations were used to approximate the surface radiation boundary condition while retaining an implicit formulation for the interior temperature nodes. These formulations are an explicit boundary condition, a linearized boundary condition, an iterative boundary condition, and a semi-iterative boundary method. The results of these methods in predicting surface temperature on the space shuttle orbiter thermal protection system model under a variety of heating rates were compared. The iterative technique caused the surface temperature to be bounded at each step. While the linearized and explicit methods were generally more efficient, the iterative and semi-iterative techniques provided a realistic surface temperature response without requiring step size control techniques.

Williams, S. D.↗
NASA NTRS1979

A two-dimensional unsteady Euler-equation solver for flow regions with arbitrary boundaries

A new technique is described for solving supersonic fluid dynamic problems containing multiple regions of continuous flow, each bounded by a permeable or impermeable surface. Region boundaries are, in general, arbitrarily shaped and time dependent. Discretization of such a region for solution by conventional finite difference procedures is accomplished using an elliptic solver which alleviates the dependence on a particular base coordinate system. Multiple regions are coupled together through the boundary conditions. The technique has been applied to a variety of problems including the shock diffraction and pointed wedge with detached bow shock.

Hindman, R. G.↗
NASA NTRS1981

Numerical analysis of spectral properties of coupled oscillator Schroedinger operators. I - Single and double well anharmonic oscillators

Several methods for computing many eigenvalues and eigenfunctions of a single anharmonic oscillator Schroedinger operator whose potential may have one or two minima are described. One of the methods requires the solution of an ill-conditioned generalized eigenvalue problem. This method has the virtue of using a bounded amount of work to achieve a given accuracy in both the single and double well regions. Rigorous bounds are given, and it is proved that the approximations converge faster than any inverse power of the size of the matrices needed to compute them. The results of computations for the g:phi(4):1 theory are presented. These results indicate that the methods actually converge exponentially fast.

Isaacson, D.↗
NASA NTRS1987

Alternative methods for calculating sensitivity of optimized designs to problem parameters

Optimum sensitivity is defined as the derivative of the optimum design with respect to some problem parameter, P. The problem parameter is usually fixed during optimization, but may be changed later. Thus, optimum sensitivity is used to estimate the effect of changes in loads, materials or constraint bounds on the design without expensive re-optimization. Here, the general topic of optimum sensitivity is discussed, available methods identified, examples given, and the difficulties encountered in calculating this information in nonlinear constrained optimization are identified.

Vanderplaats, G. N.↗
NASA NTRS1989

Effect of water on the composition of partial melts of greenstone and amphibolite

Closed-system partial melts of hydrated, metamorphosed arc basalts and andesites (greenstones and amphibolites), where only water structurally bound in metamorphic minerals is available for melting (dehydration melting), are generally water-undersaturated, coexist with plagioclase-rich, anhydrous restites, and have compositions like island arc tonalites. In contrast, water-saturated melting at water pressures of 3 kilobars yields strongly peraluminous, low iron melts that coexist with an amphibole-bearing, plagioclase-poor restite. These melt compositions are unlike those of most natural silicic rocks. Thus, dehydration melting over a range of pressures in the crust of island arcs is a plausible mechanism for the petrogenesis of islands arc tonalite, whereas water-saturated melting at pressure of 3 kilobars and above is not.

Beard, James S.↗
NASA NTRS1993

Robust root clustering for linear uncertain systems using generalized Lyapunov theory

Consideration is given to the problem of matrix root clustering in subregions of a complex plane for linear state space models with real parameter uncertainty. The nominal matrix root clustering theory of Gutman & Jury (1981) using the generalized Liapunov equation is extended to the perturbed matrix case, and bounds are derived on the perturbation to maintain root clustering inside a given region. The theory makes it possible to obtain an explicit relationship between the parameters of the root clustering region and the uncertainty range of the parameter space.

Yedavalli, R. K.↗
NASA NTRS1981

Two-Dimensional Unsteady Euler-Equation Solver for Arbitrarily Shaped Flow Regions

A new technique is described for solving supersonic fluid dynamics problems containing multiple regions of continuous flow, each bounded by a permeable or impermeable surface. Region boundaries are, in general, arbitrarily shaped and time dependent. Discretization of such a region for solution by conventional finite difference procedures is accomplished using an elliptic solver which alleviates the dependence on a particular base coordinate system. Multiple regions are coupled together through the boundary conditions. The technique has been applied to a variety of problems including a shock diffraction problem and supersonic flow over a pointed ogive.

Hindman, R. G.↗
NASA NTRS2015

Tetrahedral-Mesh Simulation of Turbulent Flows with the Space-Time Conservative Schemes

Direct numerical simulations of turbulent flows are predominantly carried out using structured, hexahedral meshes despite decades of development in unstructured mesh methods. Tetrahedral meshes offer ease of mesh generation around complex geometries and the potential of an orientation free grid that would provide un-biased small-scale dissipation and more accurate intermediate scale solutions. However, due to the lack of consistent multi-dimensional numerical formulations in conventional schemes for triangular and tetrahedral meshes at the cell interfaces, numerical issues exist when flow discontinuities or stagnation regions are present. The space-time conservative conservation element solution element (CESE) method - due to its Riemann-solver-free shock capturing capabilities, non-dissipative baseline schemes, and flux conservation in time as well as space - has the potential to more accurately simulate turbulent flows using unstructured tetrahedral meshes. To pave the way towards accurate simulation of shock/turbulent boundary-layer interaction, a series of wave and shock interaction benchmark problems that increase in complexity, are computed in this paper with triangular/tetrahedral meshes. Preliminary computations for the normal shock/turbulence interactions are carried out with a relatively coarse mesh, by direct numerical simulations standards, in order to assess other effects such as boundary conditions and the necessity of a buffer domain. The results indicate that qualitative agreement with previous studies can be obtained for flows where, strong shocks co-exist along with unsteady waves that display a broad range of scales, with a relatively compact computational domain and less stringent requirements for grid clustering near the shock. With the space-time conservation properties, stable solutions without any spurious wave reflections can be obtained without a need for buffer domains near the outflow/farfield boundaries. Computational results for the isotropic turbulent flow decay, at a relatively high turbulent Mach number, show a nicely behaved spectral decay rate for medium to high wave numbers. The high-order CESE schemes offer very robust solutions even with the presence of strong shocks or widespread shocklets. The explicit formulation in conjunction with a close to unity theoretical upper Courant number bound has the potential to offer an efficient numerical framework for general compressible turbulent flow simulations with unstructured meshes.

Chang, Chau-Lyan↗