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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact

We compare existing techniques to bound the resource availability of partially ordered events. We first show that, contrary to intuition, two existing techniques, one due to Laborie and one due to Muscettola, are not strictly comparable in terms of the size of the search trees generated under chronological search with a fixed heuristic. We describe a generalization of these techniques called the Flow Balance Constraint to tightly bound the amount of available resource for a set of partially ordered events with piecewise constant resource impact We prove that the new technique generates smaller proof trees under chronological search with a fixed heuristic, at little increase in computational expense. We then show how to construct tighter resource bounds but at increased computational cost.

Frank, Jeremy↗
NASA NTRS1979

Application of the relative energy release criteria to enclosure fire testing

The five relative energy release criteria (RERC) which are a first step towards formulating a unified concept that can be applied to the development of fires in enclosures, place upper bounds on the rate and amount of energy released during a fire. They are independent, calculated readily, and may be applied generally to any enclosure regardless of size. They are useful in pretest planning and for interpreting experimental data. Data from several specific fire test programs were examined to evaluate the potential use of RERC to provide test planning guidelines. The RERC were compared with experimental data obtained in full-scale enclosures. These results confirm that in general the RERC do identify the proper limiting constraints on enclosure fire development and determine the bounds of the fire development envelope. Plotting actual fire data against the RERC reveals new valid insights into fire behavior and reveals the controlling constraints in fire development. The RERC were calculated and plotted for several descrpitions of full-scale fires in various aircraft compartments.

Roschke, E. J.↗
DOE OSTI2025

High-order limiting methods using maximum principle bounds derived from the Boltzmann equation I: Euler equations

The use of limiting methods for high-order numerical approximations of hyperbolic conservation laws generally requires defining an admissible region/bounds for the solution. In this work, we present a novel approach for computing solution bounds and limiting for the Euler equations through the kinetic representation provided by the Boltzmann equation, which allows for extending limiters designed for linear advection directly to the Euler equations. Given an arbitrary set of solution values to compute bounds over (e.g., numerical stencil) and a desired linear advection limiter, the proposed approach yields an analytic expression for the admissible region of particle distribution function values, which may be numerically integrated to yield a set of bounds for the density, momentum, and total energy. Further, these solution bounds are shown to preserve positivity of density/pressure/internal energy and, when paired with a limiting technique, can robustly resolve strong discontinuities while recovering high-order accuracy in smooth regions without any ad hoc corrections (e.g., relaxing the bounds). This approach is demonstrated in the context of an explicit unstructured high-order discontinuous Galerkin/flux reconstruction scheme for a variety of difficult problems in gas dynamics, including cases with extreme shocks and shock-vortex interactions. Furthermore, this work presents a foundation for limiting techniques for more complex macroscopic governing equations that can be derived from an underlying kinetic representation for which admissible solution bounds are not well-understood.

42 ENGINEERING↗
DOE OSTI2025

Near-Efficient and Non-Asymptotic Multiway Inference

We establish non-asymptotic efficiency guarantees for tensor decomposition–based inference in count data models. Under a Poisson framework, we consider two related goals: (i) parametric inference , the estimation of the full distributional parameter tensor, and (ii) multiway analysis , the recovery of its canonical polyadic (CP) decomposition factors. Our main result shows that in the rank-one setting, a rank-constrained maximum-likelihood estimator achieves multiway analysis with variance matching the Cramér–Rao Lower Bound (CRLB) up to absolute constants and logarithmic factors. This provides a general framework for studying “near-efficient” multiway estimators in finite-sample settings. For higher ranks, we illustrate that our multiway estimator may not attain the CRLB; nevertheless, CP-based parametric inference remains nearly minimax optimal, with error bounds that improve on prior work by offering more favorable dependence on the CP rank. Numerical experiments corroborate near-efficiency in the rank-one case and highlight the efficiency gap in higher-rank scenarios.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Generalization of the Time-Energy Uncertainty Relation of Anandan-Aharonov Type

A new type of time-energy uncertainty relation was proposed recently by Anandan and Aharonov. Their formula, to estimate the lower bound of time-integral of the energy-fluctuation in a quantum state is generalized to the one involving a set of quantum states. This is achieved by obtaining an explicit formula for the distance between two finitely separated points in the Grassman manifold.

Hirayama, Minoru↗
DOE OSTI2025

Benchmarking DFT Accuracy in Predicting O 1s Binding Energies on Metals

X-ray photoelectron spectroscopy (XPS) is a powerful tool for probing the electronic structure and composition of materials, particularly metals and metal oxides of relevance to solar cells and catalysis. Density functional theory (DFT) is often used to support XPS peak assignments, but its reliability for predicting oxygen species is not well established. Here, we compile a large data set of experimental oxygen binding energies and evaluate corresponding DFT predictions. We find that as the binding energies of metal-bound atomic oxygen species increase, especially above ≈530 eV, there is a general decrease in the accuracy of DFTpredicted values. Thus, high-binding-energy atomic oxygen species, such as those proposed as active for selective Ag-catalyzed epoxidation, are less well represented. The chemical nature of the oxygen species also influences accuracy, with molecularly bound species more reliably captured across the entire range of energies. These findings illustrate the limitations of DFT for interpreting XPS spectra and provide a benchmark for improving computational methods.

Adsorption↗
DOE OSTI2026

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting [L. P. García-Pintos et al ., SciPost Phys. 18 , 159 (2025)]. In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high-temperature limit.

open quantum systems & decoherence↗
NASA NTRS1987

High gain feedback and telerobotic tracking

Asymptotically stable linear time invariant systems are capable of tracking arbitrary reference signals with a bounded error proportional to the magnitude of the reference signal (and its derivatives). It is shown that a similar property holds for a general class of nonlinear dynamical systems which includes all robots. As in the linear case, the error bound may be made arbitrarily small by increasing the magnitude of the feedback gains which stabilize the system.

Koditschek, D. E.↗
NASA NTRS1975

Asymptotic form of the charge exchange cross section in the three body rearrangement collisions

A three body general rearrangement collision is considered where the initial and final bound states are described by the hydrogen-like wave functions. Mathematical models are developed to establish the relationships of quantum number, the reduced mass, and the nuclear charge of the final state. It is shown that for the low lying levels, the reciprocal of n cubed scaling law at all incident energies is only approximately satisfied. The case of the symmetric collisions is considered and it is shown that for high n and high incident energy, E, the cross section behaves as the reciprocal of E cubed. Zeros and minima in the differential cross sections in the limit of high n for protons on atomic hydrogen and positrons on atomic hydrogen are given.

Omidvar, K.↗
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.↗