Search NASA⌕ Search

SEARCH · Search NASA

Results for “one-shot method”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Airfoil optimization by the one-shot method

An efficient numerical approach for the design of optimal aerodynamic shapes is presented in this paper. The objective of any optimization problem is to find the optimum of a cost function subject to a certain state equation (Governing equation of the flow field) and certain side constraints. As in classical optimal control methods, the present approach introduces a costate variable (Language multiplier) to evaluate the gradient of the cost function. High efficiency in reaching the optimum solution is achieved by using a multigrid technique and updating the shape in a hierarchical manner such that smooth (low-frequency) changes are done separately from high-frequency changes. Thus, the design variables are changed on a grid where their changes produce nonsmooth (high-frequency) perturbations that can be damped efficiently by the multigrid. The cost of solving the optimization problem is approximately two to three times the cost of the equivalent analysis problem.

Kuruvila, G.↗
NASA NTRS1995

Airfoil Design and Optimization by the One-Shot Method

An efficient numerical approach for the design of optimal aerodynamic shapes is presented in this paper. The objective of any optimization problem is to find the optimum of a cost function subject to a certain state equation (governing equation of the flow field) and certain side constraints. As in classical optimal control methods, the present approach introduces a costate variable (Lagrange multiplier) to evaluate the gradient of the cost function. High efficiency in reaching the optimum solution is achieved by using a multigrid technique and updating the shape in a hierarchical manner such that smooth (low-frequency) changes are done separately from high-frequency changes. Thus, the design variables are changed on a grid where their changes produce nonsmooth (high-frequency) perturbations that can be damped efficiently by the multigrid. The cost of solving the optimization problem is approximately two to three times the cost of the equivalent analysis problem.

Kuruvila, G.↗
NASA NTRS1994

Initiation current measurements for hot bridgewire devices

One-shot type testing of hot bridgewire explosive cartridges provides the weakest possible firing characteristic data. One-shot type testing includes the Bruceton and the Probit methods, and all their off-shoots. One-shot testing is used for only one reason: the fear of 'dudding.' Modern programmable power supplies and oscilloscopes can now be used to obtain data with no fear of dudding. Any continued use of these old, one-shot type test methods is irresponsible behavior. Our society deserves better testing methods and will get them through the courts if we cannot make these changes on our own.

OBarr, Gerald L.↗
NASA NTRS1970

Optical probing of supersonic aerodynamic turbulence

Laser quasi-schlieren system and laser shadow-correlation system retrieve flow-related signals sufficient for computing accurate, reproducible correlation peaks. Statistical method for obtaining one-shot measurements of the decay history of turbulent structures in a stationary frame of reference is discussed.

Cikanek, H. A., Jr.↗
DOE OSTI2025

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding

In network communication, it is common in broadcasting scenarios for there to exist a hierarchy among receivers based on information they decode due, for example, to different physical conditions or premium subscriptions. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. This is modeled mathematically as a degraded message set, indicating a hierarchy between messages to be decoded by different receivers, where the default quality corresponds to a common message intended for all receivers, a higher quality is represented by a message for a smaller subset of receivers, and so forth. We extend these considerations to quantum communication, exploring three-receiver quantum broadcast channels with two- and three-degraded message sets. Our technical tool involves employing quantum non-unique decoding, a technique we develop by utilizing the simultaneous pinching method. Here, we construct one-shot codes for various scenarios and find achievable rate regions relying on various quantum Rényi mutual information error exponents. Our investigation includes a comprehensive study of pinching across tensor product spaces, presenting our findings as the asymptotic counterpart to our one-shot codes. By employing the non-unique decoding, we also establish a simpler proof to Marton’s inner bound for two-receiver quantum broadcast channels without the need for more involved techniques. Additionally, we derive no-go results and demonstrate their tightness in special cases.

Salek, Farzin [Technical University of Munich (Ger↗
NASA NTRS1973

NASTRAN multipartitioning and one-shot substructuring

For intermediate size problems where all the data is accessible, the present method of substructuring in three separate phases (for static analysis) is unneccessarily cumbersome. The versatility of NASTRAN's DMAP and internal logic lends itself to finding a practical alternative to these procedures whereby self-contained special-purpose ALTER packages can be written to be run in one pass. Two examples are presented here under the titles of multipartitioning and one-shot substructuring. The flow of multipartitioning resembles that of the present three-phase substructuring. The basic effect is to partition the structure into substructures and operate on each substructure separately. This can be used to reduce the bandwidth of a given problem as well as to store information which will allow a change to be made in one of the substructures in a later run. This latter procedure is carried out in a second program titled one-shot substructuring.

Levy, A.↗
DOE OSTI2025

One-shot gas detection with transformer paired neural networks in Mako collected longwave infrared hyperspectral imagery

To date, careful data treatment workflows and statistical detectors are used to perform hyperspectral image (HSI) detection of any gas contained in a spectral library, which is often expanded with physics models to incorporate different spectral characteristics. In general, surrounding evidence or known gas-release parameters are used to provide confidence in or confirm detection capability, respectively. This makes quantifying detection performance difficult as it is nearly impossible to develop an absolute ground truth for gas target pixel presence in collected HSI. Consequently, developing and comparing new detection methods, especially machine learning (ML)-based methods, is susceptible to subjectivity in derived detection map quality. Here, in this work, we demonstrate the first use of transformer-based paired neural networks (PNNs) for one-shot gas target detection for multiple gases while providing quantitative classification and detection metrics for their use on labeled data. Terabytes of training data are generated from a database of long-wave infrared HSI obtained from historical Mako sensor campaigns over Los Angeles. By incorporating labels, singular signature representations, and a model development pipeline, we can tune and select PNNs to detect multiple gas targets that are not seen in training on a quantitative basis. We additionally assess our test set detections using interpretability techniques widely employed with ML-based predictors, but less common with detection methods relying on learned latent spaces.

Hyperspectral imaging↗
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.↗
DOE OSTI2025

One-shot learning for solution operators of partial differential equations

Learning and solving governing equations of a physical system, represented by partial differential equations (PDEs), from data is a central challenge in many areas of science and engineering. Traditional numerical methods can be computationally expensive for complex systems and require complete governing equations. Existing data-driven machine learning methods require large datasets to learn a surrogate solution operator, which could be impractical. Here, we propose a solution operator learning method that requires only one PDE solution, i.e., one-shot learning, along with suitable initial and boundary conditions. Leveraging the locality of derivatives, we define a local solution operator in small local domains, train it using a neural network, and use it to predict solutions of new input functions via mesh-based fixed-point iteration or meshfree neural-network based approaches. We test our method on various PDEs, complex geometries, and a practical spatial infection spread application, demonstrating its effectiveness and generalization capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Measurement techniques using the electron beam profile scanner at the Fermilab Main Injector

This work presents techniques for non-invasive transverse profile measurements of high-intensity proton beams using an Electron Beam Profile Scanner (EBPS). The EBPS utilizes low-energy electrons as a probe to analyze the transverse size of proton beams, allowing for potential analysis on a single-bunch basis. Recent upgrades to the Fermilab Main Injector have enhanced beam power on target to 1 MW, with future developments targeting 2 MW. The higher beam power has increased the demand for non-invasive diagnostics, as invasive methods can disrupt operations.The techniques presented include 1) the slow scan technique, which serves as a proof of concept for the probe beam, 2) the one-shot scan technique for measuring horizontal beam profiles, and 3) the raster scan technique for analyzing horizontal beam profiles as a function of the longitudinal distribution of the beam. The profiles obtained will be crucial for studying and understanding instabilities in high-power, high-intensity proton beams. This will contribute to optimizing the operation of high-power proton accelerators by minimizing beam loss, activation, and damage to both the diagnostics and the accelerator components.

Mwaniki, Matilda [IIT, Chicago]↗
DOE OSTI2026

Advanced Characterization of Wastewaters with a Focus on the Environment & Economics (Final Technical Progress Report)

This project, funded by the U.S. Department of Energy under award DE-FE0032457 and conducted at the University of Illinois at Urbana-Champaign, focused on advancing the characterization of coal combustion residual (CCR) effluents. The primary objectives were to develop analytical methods for detecting major cations, anions, trace metals, and rare earth elements (REEs) in CCR wastewater, assess environmental impacts, and explore opportunities for resource recovery. The project advanced the development of a "One-Shot" analysis system designed to simultaneously analyze multiple analytes in CCR effluents.

01 COAL, LIGNITE, AND PEAT↗
NASA NTRS1980

A low-cost forward fairing for the Bell Long Ranger Helicopter

A description is presented of work concerned with determining the effects of long-term flight service on advanced composite helicopter airframe components. The helicopter chosen for the program is the Long Ranger Model 206L. The components to be evaluated include the baggage door, litter door, vertical fin, and forward fairing. Only the vertical fin is classified as primary structure. Loss of any of the other components will not compromise safety of the aircraft. Attention is given to the program objectives, the design of the forward fairing, the fabrication procedures, the exterior surface, the cocure procedure, material tests, and initial cost-tracking. The considered program demonstrates the ability to produce an acceptable fairing by the 'one-shot' cocured process and, based on learning curve experience, production costs will be low. The low-temperature 200 F cure does not affect the structural properties to an unacceptable degree. A method for obtaining a smooth, exterior painted surface for Kevlar/epoxy fabric has been developed.

Zinberg, H.↗
NASA NTRS1993

Classification of multispectral image data by the Binary Diamond neural network and by nonparametric, pixel-by-pixel methods

The classification of multispectral image data obtained from satellites has become an important tool for generating ground cover maps. This study deals with the application of nonparametric pixel-by-pixel classification methods in the classification of pixels, based on their multispectral data. A new neural network, the Binary Diamond, is introduced, and its performance is compared with a nearest neighbor algorithm and a back-propagation network. The Binary Diamond is a multilayer, feed-forward neural network, which learns from examples in unsupervised, 'one-shot' mode. It recruits its neurons according to the actual training set, as it learns. The comparisons of the algorithms were done by using a realistic data base, consisting of approximately 90,000 Landsat 4 Thematic Mapper pixels. The Binary Diamond and the nearest neighbor performances were close, with some advantages to the Binary Diamond. The performance of the back-propagation network lagged behind. An efficient nearest neighbor algorithm, the binned nearest neighbor, is described. Ways for improving the performances, such as merging categories, and analyzing nonboundary pixels, are addressed and evaluated.

Salu, Yehuda↗
NASA NTRS2011

Coding for Parallel Links to Maximize the Expected Value of Decodable Messages

When multiple parallel communication links are available, it is useful to consider link-utilization strategies that provide tradeoffs between reliability and throughput. Interesting cases arise when there are three or more available links. Under the model considered, the links have known probabilities of being in working order, and each link has a known capacity. The sender has a number of messages to send to the receiver. Each message has a size and a value (i.e., a worth or priority). Messages may be divided into pieces arbitrarily, and the value of each piece is proportional to its size. The goal is to choose combinations of messages to send on the links so that the expected value of the messages decodable by the receiver is maximized. There are three parts to the innovation: (1) Applying coding to parallel links under the model; (2) Linear programming formulation for finding the optimal combinations of messages to send on the links; and (3) Algorithms for assisting in finding feasible combinations of messages, as support for the linear programming formulation. There are similarities between this innovation and methods developed in the field of network coding. However, network coding has generally been concerned with either maximizing throughput in a fixed network, or robust communication of a fixed volume of data. In contrast, under this model, the throughput is expected to vary depending on the state of the network. Examples of error-correcting codes that are useful under this model but which are not needed under previous models have been found. This model can represent either a one-shot communication attempt, or a stream of communications. Under the one-shot model, message sizes and link capacities are quantities of information (e.g., measured in bits), while under the communications stream model, message sizes and link capacities are information rates (e.g., measured in bits/second). This work has the potential to increase the value of data returned from spacecraft under certain conditions.

Klimesh, Matthew A.↗
NASA NTRS1992

Derivation of hard deadlines for real-time control systems

The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. A dynamic failure is said to occur if this delay exceeds a certain limit called a hard deadline. The authors present a method for calculating the hard deadlines in linear time-invariant control systems. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space-which is derived from given input and state constraints-is used to calculate the hard deadline as a function of time and the system state. The authors consider a one-shot delay model in which a single event causes a dynamic failure.

Shin, Kang G.↗
NASA NTRS1992

Derivation and application of hard deadlines for real-time control systems

The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. If this delay exceeds a certain limit called a hard deadline, either the necessary conditions for system stability are violated or the system leaves the allowed state-space. In such a case a dynamic failure is said to occur to the system. A method for calculating the hard deadlines in linear time-invariant control systems by considering system stability and the allowed state-space is presented. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space - which is derived from given input and state constraints - is used to calculate the hard deadline as a function of time and the system state. A one-shot delay model in which a single event causes a dynamic failure is also considered. The knowledge of hard deadline is then applied to the design of error recovery in a triple modular redundant (TMR) controller computer.

Shin, Kang G.↗
NASA NTRS1986

Reliable One-Shot Separation of Connectors

Concept for separating electrical connectors by remote control simple and reliable. Suitable for one-time, irreversible separations, method uses weak explosion to destroy one member of the connector.

Holmberg, W. R.↗