Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounding Analysis”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Exclusive π - electroproduction off the neutron in deuterium in the resonance region

We report new results for the exclusive and quasi-free cross sections off neutrons bound in deuterium y v n(p) →p π - (p) are presented over a wide final state hadron angle range with a kinematic coverage of the invariant mass (W) up to 1.825 GeV and the virtual photon four-momentum transfer squared (Q 2 ) from 0.4 to 1.0 GeV 2 . The exclusive structure functions have been extracted and their Legendre moments were obtained. Final-state-interaction contributions have been kinematically separated from the extracted quasi-free cross sections off bound neutrons solely based on the analysis of the experimental data. These new results will serve as long-awaited input for phenomenological analyses to extract the Q 2 evolution of previously unavailable n → N* electroexcitation amplitudes and to improve state-of-the-art models of neutrino scattering off nuclei by augmenting the already available results from free protons.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

HPC Network Simulation Tuning via Automatic Extraction of Hardware Parameters

Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.

Simulation, autotuning↗
DOE OSTI2024

Automatic Extraction of Network Configurations for Realistic Simulation and Validation

Popular HPC network interconnection simulators such as SST Macro provide a variety of configurable parameters to explore the design space of hardware components such as network links and switches. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or are intentionally omitted. In this work, we provide a methodology to automatically tune the simulation configuration of the multiple network models running within SST Macro using Bayesian optimization. We perform this optimization in the context of multiple messaging regimes (i.e., small to large and latency to bandwidth-bound messages) and provide a detailed analysis of the simulation error for four systems. With our automated framework, we achieve a 5x improvement in accuracy over best-effort configurations based on available hardware specifications.

Suetterlein, Joshua D.↗
DOE OSTI2024

Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration

The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.

complexity theory↗
DOE OSTI2025

Approaches to the Inverse Problem

In this talk, I describe some recent ideas relating to the spectral reconstruction inverse problem, which arises frequently in lattice QCD calculations of inclusive hadronic quantities, and provide some physical context for this work. Particular emphasis is given to a new method for rigorously bounding uncertainties using techniques from complex analysis.

Jay, William [Massachusetts Institute of Technolog↗
NASA NTRS1981

Coding tradeoffs for improved performance of FH/MFSK systems in partial band noise

Partial band noise jamming can severely degrade the performance of frequency-hopped, M-ary frequency-shift keyed communciation systems. This paper illustrates the tradeoffs between channel coding, diversity, and block orthogonal (MFSK) modulation as a means of overcoming the advantage of worst case, non-adaptive (as opposed to repeat-back) partial band jamming. For ease of computation, the analysis relies on exponentially tight error bounds, and is based on a noncoherent detection metric that requires jamming state information for each hop. A more robust, less complex receiver structure which eliminates the jamming knowledge requirement is shown to degrade performance less than 2-1/2 dB. The coding tradeoffs discussed in this report are exemplified in the design of a hypothetical 32 kb/s military frequency-hopped communication link.

Levitt, B. K.↗
NASA NTRS1993

Integrated flight/propulsion control - Subsystem specifications for performance

A procedure is presented for calculating multiple subsystem specifications given a number of performance requirements on the integrated system. This procedure applies to problems where the control design must be performed in a partitioned manner. It is based on a structured singular value analysis, and generates specifications as magnitude bounds on subsystem uncertainties. The performance requirements should be provided in the form of bounds on transfer functions of the integrated system. This form allows the expression of model following, command tracking, and disturbance rejection requirements. The procedure is demonstrated on a STOVL aircraft design.

Neighbors, W. K.↗
NASA NTRS1994

Robustness of reduced-order multivariable state-space self-tuning controller

In this paper, we present a quantitative analysis of the robustness of a reduced-order pole-assignment state-space self-tuning controller for a multivariable adaptive control system whose order of the real process is higher than that of the model used in the controller design. The result of stability analysis shows that, under a specific bounded modelling error, the adaptively controlled closed-loop real system via the reduced-order state-space self-tuner is BIBO stable in the presence of unmodelled dynamics.

Yuan, Zhuzhi↗
NASA NTRS2008

A Verification-Driven Approach to Control Analysis and Tuning

This paper proposes a methodology for the analysis and tuning of controllers using control verification metrics. These metrics, which are introduced in a companion paper, measure the size of the largest uncertainty set of a given class for which the closed-loop specifications are satisfied. This framework integrates deterministic and probabilistic uncertainty models into a setting that enables the deformation of sets in the parameter space, the control design space, and in the union of these two spaces. In regard to control analysis, we propose strategies that enable bounding regions of the design space where the specifications are satisfied by all the closed-loop systems associated with a prescribed uncertainty set. When this is unfeasible, we bound regions where the probability of satisfying the requirements exceeds a prescribed value. In regard to control tuning, we propose strategies for the improvement of the robust characteristics of a baseline controller. Some of these strategies use multi-point approximations to the control verification metrics in order to alleviate the numerical burden of solving a min-max problem. Since this methodology targets non-linear systems having an arbitrary, possibly implicit, functional dependency on the uncertain parameters and for which high-fidelity simulations are available, they are applicable to realistic engineering problems..

Crespo, Luis G.↗
DOE OSTI2026

An Integrated Framework for Memory-Centric Analysis: From Trace Collection to Co-Design

The memory wall phenomenon—where advances in processor performance significantly outpace those in memory subsystems—poses a fundamental challenge for contemporary computing systems. In memory-bound applications, memory subsystem behavior dominates performance, yet existing analysis approaches present significant limitations: detailed microarchitectural simulators require days to weeks to simulate modest workloads; hardware performance counters provide only aggregate statistics that obscure temporal and spatial access patterns; and scaled simulation approaches face challenges in capturing certain behaviors that emerge at larger scales. These limitations reflect a processor-centric design philosophy increasingly misaligned with memory-bound workloads where detailed understanding of memory access patterns, cache hierarchy interactions, and contention is critical for effective optimization. This paper presents an integrated framework for memory-centric analysis that enables effective hardware-software co-design. We describe practical trace collection techniques, including hardware-assisted processor tracing with minimal overhead and portable software-based instrumentation with statistical sampling. We present multi-perspective analysis methods that examine memory behavior from temporal, sequential, spatial, and relational viewpoints, revealing distinct optimization opportunities invisible in aggregate metrics. We detail an architectural modeling framework that uses sampled traces with temporal interpolation and confidence-based filtering to evaluate cache and memory configurations. Evaluation on representative benchmarks demonstrates that this framework achieves practical accuracy (L2 cache errors of 2.64\%, confidence-filtered L3 errors of 9.92\%, bandwidth errors of 7.33\%) while providing substantial speedup (26.8×) over cycle-accurate simulation, enabling rapid design space exploration. We demonstrate how this integrated framework enables systematic identification of both hardware optimizations (memory controller tuning, bank partitioning, NUMA configuration) and software optimizations (data layout restructuring, prefetching strategies, memory-aware scheduling). Through this comprehensive treatment of the memory-centric analysis pipeline—from trace collection through architectural modeling to co-design application—we provide researchers and practitioners with practical techniques for addressing memory bottlenecks in contemporary computing systems.

Gajaria, Dhruv Mayur↗
DOE OSTI2022

A Framework for Error-Bounded Approximate Computing, with an Application to Dot Products

Approximate computing techniques, which trade off the computation accuracy of an algorithm for better performance and energy efficiency, have been successful in reducing computation and power costs in several domains. However, error sensitive applications in high-performance computing are unable to benefit from existing approximate computing strategies that are not developed with guaranteed error bounds. While approximate computing techniques can be developed for individual high-performance computing applications by domain specialists, this often requires additional theoretical analysis and potentially extensive software modification. Hence, the development of low-level error-bounded approximate computing strategies that can be introduced into any high-performance computing application without requiring additional analysis or significant software alterations is desirable. In this paper, we provide a contribution in this direction by proposing a general framework for designing error-bounded approximate computing strategies and apply it to the dot product kernel to develop \bf qdot---an error-bounded approximate dot product kernel. Following the introduction of qdot, here we perform a theoretical analysis that yields a deterministic bound on the relative approximation error introduced by qdot. Empirical tests are performed to illustrate the tightness of the derived error bound and to demonstrate the effectiveness of qdot on a synthetic dataset, as well as two scientific benchmarks---the conjugate gradient (CG) and power methods. In some instances, using qdot for the dot products in CG can result in many components being quantized to half precision without increasing the iteration count required for convergence to the same solution as CG using a double precision dot product.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗
NASA NTRS1982

On the scaling of crater dimensions. II - Impact processes

Holsapple and Schmidt (1980) previously addressed the problem of the scaling of explosive cratering. Their analysis included results which show under which conditions the scaling can be bounded between quarter-root and cube-root rules. The present investigation is an extension of the earlier analysis and approaches the case of impact cratering. More restrictive bounds are found for impact cratering than for the explosive case. These stronger results come from considering the role of the impactor momentum as an independent variable for impact cratering. Attention is given to impact cratering variables, general scaling rules, the bounds on scaling rules, a generalization to more variables, and previous scaling rules and results.

Holsapple, K. A.↗
DOE OSTI2024

New dark matter analysis of milky way dwarf satellite galaxies with madhatv2

We obtain bounds on dark matter annihilation using 14 years of publicly available Fermi-LAT data from a set of 54 dwarf spheroidal galaxies, using spectral information from 16 energy bins. We perform this analysis using our updated and publicly available code , which can be used to test a variety of models for dark matter particle physics and astrophysics in an accessible manner. In particular, we note that including Carina III in the analysis strengthens constraints on s -wave annihilation into two-body Standard Model final states by a factor of ∼ 3 but broadens the error on the constraint due to the large uncertainty of its J -factor. Our findings illustrate the importance of verifying if Carina III is in fact a dwarf spheroidal galaxy and measuring more precisely its J -factor. More generally, they highlight the significance of forthcoming discoveries of nearby ultrafaint dwarfs for dark matter indirect detection. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
NASA NTRS1992

Statistical plant set estimation using Schroeder-phased multisinusoidal input design

A frequency domain method is developed for plant set estimation. The estimation of a plant 'set' rather than a point estimate is required to support many methods of modern robust control design. The approach here is based on using a Schroeder-phased multisinusoid input design which has the special property of placing input energy only at the discrete frequency points used in the computation. A detailed analysis of the statistical properties of the frequency domain estimator is given, leading to exact expressions for the probability distribution of the estimation error, and many important properties. It is shown that, for any nominal parametric plant estimate, one can use these results to construct an overbound on the additive uncertainty to any prescribed statistical confidence. The 'soft' bound thus obtained can be used to replace 'hard' bounds presently used in many robust control analysis and synthesis methods.

Bayard, D. S.↗
DOE OSTI2026

Crystal structure of Methanococcus jannaschii dihydroorotase with substrate bound

Here, we report the X-ray structural analysis of dihydroorotase from Methanococcus jannaschii co-crystallized with dihydroorotate at pH 6.5. The crystals are isomorphous with the crystals of the apoenzyme, with space group P3 2 21 and unit-cell dimensions a = b = 111.4, c = 101.2 Å. The structure was refined to R = 0.169 and R free = 0.186 at a resolution of 1.87 Å at room temperature. During crystallization the degradative reaction took place, and the electron density in the active site corresponds to the substrate carbamoyl aspartate. Carbamoyl aspartate interacts with the protein in the active site in a manner similar to that observed for Escherichia coli and human dihydroorotases. However, the flexible loop (residues 140–151) adopts both conformations in the crystal, loop-out and loop-in, with the loop-out conformation having higher occupancy. This contrasts with our expectations for the flexible loop to be exclusively in the loop-in conformation, which is the conformation that it adopts to stabilize the binding of the substrate in the known systems. Additional studies with substrate analogs that resemble carbamoyl aspartate and different crystallization conditions would provide further insight into the conformation of the flexible loop in this system.

Methanococcus jannaschii↗
DOE OSTI2024

Leveraging Extremal Dependence to Better Characterize the 2021 Pacific Northwest Heatwave

Abstract In late June, 2021, a devastating heatwave affected the US Pacific Northwest and western Canada, breaking numerous all-time temperature records by large margins and directly causing hundreds of fatalities. The observed 2021 daily maximum temperature across much of the U.S. Pacific Northwest exceeded upper bound estimates obtained from single-station temperature records even after accounting for anthropogenic climate change, meaning that the event could not have been predicted under standard univariate extreme value analysis assumptions. In this work, we utilize a flexible spatial extremes model that considers all stations across the Pacific Northwest domain and accounts for the fact that many stations simultaneously experience extreme temperatures. Our analysis incorporates the effects of anthropogenic forcing and natural climate variability in order to better characterize time-varying changes in the distribution of daily temperature extremes. We show that greenhouse gas forcing, drought conditions and large-scale atmospheric modes of variability all have significant impact on summertime maximum temperatures in this region. Our model represents a significant improvement over corresponding single-station analysis, and our posterior medians of the upper bounds are able to anticipate more than 96% of the observed 2021 high station temperatures after properly accounting for extremal dependence. Supplementary materials accompanying this paper appear online.

Zhang, Likun (ORCID:0000000154584556)↗