Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance bound”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Design of suboptimal regulators for nonlinear systems

An optimal feedback control law is preferred for the regulation of a deterministic nonlinear system. In this paper, a practical, iterative design method leading to a sequence of suboptimal control laws with successively improved performance is presented. The design method requires the determination of an upper bound to the performance of each successive control law. This is obtained by solving a partial differential inequality by means of a linear programming technique. Robustness properties and the application of the design method to the control of a robot manipulator arm are also presented.

Balaram, J.↗
NASA NTRS2023

A Confidence-Based Approach to Including Survivors in a Probabilistic TID Failure Assessment

A probabilistic total ionizing dose (TID) failure assessment is extended to include survivor data, enabling the bounding of failure probability to a desired confidence level (CL) without failure data. The extension provides an avenue for analyzing microelectronics tested for TID without reaching a failure mode, a scenario often encountered by missions utilizing commercial-off-the-shelf (COTS) technologies. Using the type-I censored likelihood formulation and a realistic upper bound on expected device performance, the failure probability space is bounded by confidence contours within the context of a variable environment. The framework accommodates any type of distribution assumed for the part failure or the environment under consideration. Furthermore, the framework can be utilized pre-emptively to plan future device TID tests, minimizing costs while meeting survival requirements. Heritage data may also be used as survivors to further minimize testing costs when parts are from the same lot, but the amount of constraint derived from heritage is limited. Altogether, the framework enables a formal, mathematically rigorous analysis of radiation tolerant devices tested to a maximum dose, as well as flight heritage, in a hardness assurance methodology.

confidence↗
NASA NTRS2003

Structured Uncertainty Bound Determination From Data for Control and Performance Validation

This report attempts to document the broad scope of issues that must be satisfactorily resolved before one can expect to methodically obtain, with a reasonable confidence, a near-optimal robust closed loop performance in physical applications. These include elements of signal processing, noise identification, system identification, model validation, and uncertainty modeling. Based on a recently developed methodology involving a parameterization of all model validating uncertainty sets for a given linear fractional transformation (LFT) structure and noise allowance, a new software, Uncertainty Bound Identification (UBID) toolbox, which conveniently executes model validation tests and determine uncertainty bounds from data, has been designed and is currently available. This toolbox also serves to benchmark the current state-of-the-art in uncertainty bound determination and in turn facilitate benchmarking of robust control technology. To help clarify the methodology and use of the new software, two tutorial examples are provided. The first involves the uncertainty characterization of a flexible structure dynamics, and the second example involves a closed loop performance validation of a ducted fan based on an uncertainty bound from data. These examples, along with other simulation and experimental results, also help describe the many factors and assumptions that determine the degree of success in applying robust control theory to practical problems.

Lim, Kyong B.↗
DOE OSTI2023

Lower Bounds on Quantum Annealing Times

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1991

Multi-stage decoding for multi-level block modulation codes

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the probability of an incorrect decoding are derived. Based on our study and computation results, we find that, if component codes of a multi-level modulation code and types of decoding at various stages are chosen properly, high spectral efficiency and large coding gain can be achieved with reduced decoding complexity. In particular, we find that the difference in performance between the suboptimum multi-stage soft-decision maximum likelihood decoding of a modulation code and the single-stage optimum decoding of the overall code is very small: only a fraction of dB loss in SNR at the probability of an incorrect decoding for a block of 10(exp -6). Multi-stage decoding of multi-level modulation codes really offers a way to achieve the best of three worlds, bandwidth efficiency, coding gain, and decoding complexity.

Lin, Shu↗
DOE OSTI2022

Secure mmWave Spectrum Sharing with Autonomous Beam Scheduling for 5G and Beyond

Spectrum Sharing (SS) has seen a renewed set of initiatives in 5G with the availability of shared and unlicensed spectrum bands that can be used by multiple cellular service providers and private cellular networks. Beam based transmission, instead of the traditional sector based transmission in conjunction with the spectrum agility of the 5G New Radio (NR) has brought new opportunities to optimized sharing of spectrum. Currently in the U.S., a centralized Spectrum Access Server (SAS) is used to co-ordinate spectrum sharing among networks sharing the same spectrum band. However, SAS becomes a focal point for security attacks and a performance bottleneck. In addition, SAS relies on an Environmental Sensor Network (ESN), separate from the 5G network. Without trusted spectral occupancy information, false reporting of spectrum sensing data can create sub-optimal and unfair spectrum usage. This paper summarizes our recent research findings in using a decentralized scheme for multiple networks to securely share spectrum with autonomous beam scheduling : 1) A new stochastic network framework based on Lyapunov Optimization approach is developed to optimize scheduling at the base stations; 2) Game theoretic (GT) approach is used to formulate the distributed scheduler; 3) Another distributed scheduler with Q-learning is presented that utilizes the Reinforcement Learning (RL) approach; 4) The performance and convergence rate of these distributed solutions to use shared and unlicensed spectrum are compared with existing solutions. Conditions under which the performance of these schedulers approach the theoretical upper bound, which is the performance possible with no interference among the operators sharing the spectrum, are presented; 5) The ability of a base station to use its own user equipment as sensors, for optimal spectrum sharing with base stations in other operator networks, is demonstrated to be an effective approach.

5G↗
NASA NTRS1984

On the impact of communication complexity in the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D.↗
NASA NTRS2014

Evaluation of the Trade Space Between UAS Maneuver Performance and SAA System Performance Requirements

A need exists to safely integrate Unmanned Aircraft Systems (UAS) into the National Airspace System. Replacing manned aircraft's see-and-avoid capability in the absence of an onboard pilot is one of the key challenges associated with safe integration. Sense-and-avoid (SAA) systems will have to achieve yet-to-be-determined required separation distances for a wide range of encounters. They will also need to account for the maneuver performance of the UAS they are paired with. The work described in this paper is aimed at developing an understanding of the trade space between UAS maneuver performance and SAA system performance requirements. An assessment of current manned and unmanned aircraft performance was used to establish potential UAS performance test matrix bounds. Then, nearterm UAS integration work was used to narrow down the scope. A simulator was developed with sufficient fidelity to assess SAA system performance requirements for a wide range of encounters. The simulator generates closest-point-of-approach (CPA) data from the wide range of UAS performance models maneuvering against a single intruder with various encounter geometries. The simulator is described herein and has both a graphical user interface and batch interface to support detailed analysis of individual UAS encounters and macro analysis of a very large set of UAS and encounter models, respectively. Results from the simulator using approximate performance data from a well-known manned aircraft is presented to provide insight into the problem and as verification and validation of the simulator. Analysis of climb, descent, and level turn maneuvers to avoid a collision is presented. Noting the diversity of backgrounds in the UAS community, a description of the UAS aerodynamic and propulsive design and performance parameters is included. Initial attempts to model the results made it clear that developing maneuver performance groups is required. Discussion of the performance groups developed and how to know in which group an aircraft belongs for a given flight condition and encounter is included. The groups are specific to airplane, flight condition, and encounter, rather than airplane-only specific. Results and methodology for developing UAS maneuver performance requirements are presented for each maneuver as well. Results for the vertical maneuver indicate that a minimum specific excess power value can assure a minimum CPA for a given time-to-go prediction. However, smaller values of specific excess power may achieve or exceed the same CPA if the UAS has sufficient speed to trade for altitude. Level turn results are less impacted by specific excess power and are presented as a function of turn rate. The effect of altitude is also discussed for the turns. Next steps and future work are discussed. Future studies will lead to better quantification of the preliminary results and cover the remainder of the proposed test matrix. It is anticipated that this will be done in conjunction with RTCA SC-228 over the next few months.

Jack, Devin P.↗
NASA NTRSDate not supplied

Monte Carlo Simulations for Evaluating the Accuracy of GLM Detection Efficiency and False Alarm Rate Retrievals

The performance of the Geostationary Lightning Mapper has been evaluated through comparison with other satellite lightning sensors and ground-based networks. However, because the performance of these reference sensors is both imperfect and imperfectly known, the true performance of GLM can only be estimated through such a process. In particular, GLM performance metrics such as detection efficiency (DE) and false alarm rate (FAR) retrieved through comparison with reference networks are affected by those networks’ own DE, FAR, and spatiotemporal accuracy, as well as the selected flash matching criteria. This study presents follow-on results from an ongoing analysis that uses a Monte Carlo simulation-based inversion technique to quantify the effect on retrieved GLM performance of a reasonable range of reference network DE, FAR, spatiotemporal accuracy, and the associated geographic patterns of each. These results help quantify and bound the actual performance of GLM and the attendant uncertainties when comparing GLM to imperfect reference networks.

Katrina Virts↗
NASA NTRS1984

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗
DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗
NASA NTRS2014

Exploration of the Trade Space Between Unmanned Aircraft Systems Descent Maneuver Performance and Sense-and-Avoid System Performance Requirements

A need exists to safely integrate Unmanned Aircraft Systems (UAS) into the United States' National Airspace System. Replacing manned aircraft's see-and-avoid capability in the absence of an onboard pilot is one of the key challenges associated with safe integration. Sense-and-avoid (SAA) systems will have to achieve yet-to-be-determined required separation distances for a wide range of encounters. They will also need to account for the maneuver performance of the UAS they are paired with. The work described in this paper is aimed at developing an understanding of the trade space between UAS maneuver performance and SAA system performance requirements, focusing on a descent avoidance maneuver. An assessment of current manned and unmanned aircraft performance was used to establish potential UAS performance test matrix bounds. Then, near-term UAS integration work was used to narrow down the scope. A simulator was developed with sufficient fidelity to assess SAA system performance requirements. The simulator generates closest-point-of-approach (CPA) data from the wide range of UAS performance models maneuvering against a single intruder with various encounter geometries. Initial attempts to model the results made it clear that developing maneuver performance groups is required. Discussion of the performance groups developed and how to know in which group an aircraft belongs for a given flight condition and encounter is included. The groups are airplane, flight condition, and encounter specific, rather than airplane-only specific. Results and methodology for developing UAS maneuver performance requirements are presented for a descent avoidance maneuver. Results for the descent maneuver indicate that a minimum specific excess power magnitude can assure a minimum CPA for a given time-to-go prediction. However, smaller amounts of specific excess power may achieve or exceed the same CPA if the UAS has sufficient speed to trade for altitude. The results of this study will support UAS maneuver performance requirements development for integrating UAS in the NAS. The methods described are being used to help RTCA Special Committee 228 develop requirements.

Jack, Devin P.↗
DOE OSTI2023

Machine learning the relationship between Debye temperature and superconducting transition temperature

Recently a relationship between the Debye temperature $Θ_D$ and the superconducting transition temperature $T_c$ of conventional superconductors has been proposed [Esterlis et al., npj Quantum Mater. 3, 59 (2018)]. The relationship indicates that $T_c$ ≤ $AΘ_D$ for phonon-mediated BCS superconductors, with $A$ being a prefactor of order ~ $0.1$. In order to verify this bound, we train machine learning (ML) models with 10 330 samples in the Materials Project database to predict $Θ_D$. Here, by applying our ML models to 9860 known superconductors in the NIMS SuperCon database, we find that the conventional superconductors in the database indeed follow the proposed bound. We also perform first-principles phonon calculations for $\mathrm{H_3S}$ and $\mathrm{LaH_{10}}$ at 200 GPa. The calculation results indicate that these high-pressure hydrides essentially saturate the bound of $T_c$ versus $Θ_D$.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1998

The P-Mesh: A Commodity-based Scalable Network Architecture for Clusters

We designed a new network architecture, the P-Mesh which combines the scalability and fault resilience of a torus with the performance of a switch. We compare the scalability, performance, and cost of the hub, switch, torus, tree, and P-Mesh architectures. The latter three are capable of scaling to thousands of nodes, however, the torus has severe performance limitations with that many processors. The tree and P-Mesh have similar latency, bandwidth, and bisection bandwidth, but the P-Mesh outperforms the switch architecture (a lower bound for tree performance) on 16-node NAB Parallel Benchmark tests by up to 23%, and costs 40% less. Further, the P-Mesh has better fault resilience characteristics. The P-Mesh architecture trades increased management overhead for lower cost, and is a good bridging technology while the price of tree uplinks is expensive.

Nitzberg, Bill↗
NASA NTRS2013

Performance Evaluation of Large Aperture 'Polished Panel' Optical Receivers Based on Experimental Data

Recent interest in hybrid RF/Optical communications has led to the development and installation of a "polished-panel" optical receiver evaluation assembly on the 34-meter research antenna at Deep-Space Station 13 (DSS-13) at NASA's Goldstone Communications Complex. The test setup consists of a custom aluminum panel polished to optical smoothness, and a large-sensor CCD camera designed to image the point-spread function (PSF) generated by the polished aluminum panel. Extensive data has been obtained via realtime tracking and imaging of planets and stars at DSS-13. Both "on-source" and "off-source" data were recorded at various elevations, enabling the development of realistic simulations and analytic models to help determine the performance of future deep-space communications systems operating with on-off keying (OOK) or pulse-position-modulated (PPM) signaling formats with photon-counting detection, and compared with the ultimate quantum bound on detection performance for these modulations. Experimentally determined PSFs were scaled to provide realistic signal-distributions across a photon-counting detector array when a pulse is received, and uncoded as well as block-coded performance analyzed and evaluated for a well-known class of block codes.

on-off keying (OOK)↗
DOE OSTI2022

To what extent can space be compressed? Bandwidth limits of spaceplates

Spaceplates are novel flat-optic devices that implement the optical response of a free-space volume over a smaller length, effectively “compressing space” for light propagation. Together with flat lenses such as metalenses or diffractive lenses, spaceplates have the potential to enable the miniaturization of any free-space optical system. While the fundamental and practical bounds on the performance metrics of flat lenses have been well studied in recent years, a similar understanding of the ultimate limits of spaceplates is lacking, especially regarding the issue of bandwidth, which remains as a crucial roadblock for the adoption of this platform. In this work, we derive fundamental bounds on the bandwidth of spaceplates as a function of their numerical aperture and compression ratio (ratio by which the free-space pathway is compressed). The general form of these bounds is universal and can be applied and specialized for different broad classes of space-compression devices, regardless of their particular implementation. Our findings also offer relevant insights into the physical mechanism at the origin of generic space-compression effects and may guide the design of higher performance spaceplates, opening new opportunities for ultra-compact, monolithic, planar optical systems for a variety of applications.

Shastri, Kunal (ORCID:0000000169282753)↗
DOE OSTI2024

A detailed chemical study of the extreme velocity stars in the galaxy

ABSTRACT Two decades on, the study of hypervelocity stars is still in its infancy. These stars can provide novel constraints on the total mass of the Galaxy and its dark matter distribution. However how these stars are accelerated to such high velocities is unclear. Various proposed production mechanisms for these stars can be distinguished using chemo-dynamic tagging. The advent of Gaia and other large surveys have provided hundreds of candidate hyper velocity objects to target for ground-based high-resolution follow-up observations. We conduct high-resolution spectroscopic follow-up observations of 16 candidate late-type hyper velocity stars using the Apache Point Observatory and the McDonald Observatory. We derive atmospheric parameters and chemical abundances for these stars. We measure up to 22 elements, including the following nucleosynthetic families: $\alpha$ (Mg, Si, Ca, and Ti), light/odd-Z (Na, Al, V, Cu, and Sc), Fe-peak (Fe, Cr, Mn, Co, Ni, and Zn), and neutron capture (Sr, Y, Zr, Ba, La, Nd, and Eu). Our kinematic analysis shows one candidate is unbound, two are marginally bound, and the remainder are bound to the Galaxy. Finally, for the three unbound or marginally bound stars, we perform orbit integration to locate possible globular cluster or dwarf galaxy progenitors. We do not find any likely candidate systems for these stars and conclude that the unbound stars are likely from the the stellar halo, in agreement with the chemical results. The remaining bound stars are all chemically consistent with the stellar halo as well.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

2023 American Society for Mass Spectrometry (ASMS) 71st Annual Conference on Mass Spectrometry and Allied Topics

Introduction (120 words max) Understanding metal-cluster chemistry occuring at solvent boundaries in the aqueous and organic phases has applications in environments from cellular processes to nuclear fuel reprocessing. Transport of metal ions at the boundaries from aqueous to organic phases involves forming a metal-ligand complex, and wherever the initial metal coordination environment is significantly different from the final one, the metal transitions through a series of transient species in passing from one phase to another. Here an investigation of the role of coordination in the chemistry of the transient species using gas-phase measurements that are free of solvent effects to better understand the binding of complexes of metals with triphenylphosphine chalcogenide ligands, examining metal-ligand homo- and hetero-dimers to better understand transient species. Methods (120 word max) Mass spectrometry and collision induced dissociation (CID) experiments were performed with a Bruker (Billerica, MA, USA) micrOTOF-Q II quadrupole time-of-flight mass spectrometer (QTOF) and Bruker amaZon speed ETD (ion trap). High resolution/high mass accuracy spectra were generated using the QTOF. External calibration was performed with Agilent (Santa Clara, CA, USA) ESI-L Low Concentration tuning mix. Both mass spectrometers were equipped with either the electrospray ionization source or nanospray sources. Metal samples were prepared between 40 – 60 uM of the metal-ligand complex in 25% water and 75% acetonitrile. Metal-ion clusters were isolated and subjected to collision induced dissociation. Density functional theory calculations were performed. Preliminary Data or Plenary Speakers Abstract (300 words max) Metal ion clusters with triphenylphosphine chalcogenide ligands were observed for group I metals with triphenylphosphine chalcogenide samples in the mass spectrum upon electrospray ionization. For each metal ligand complex of interest, the parent ion was isolated and collision induced dissociation fragmentation spectra were acquired. We observed clusters of group I metal with triphenylphosphine oxide, triphenyl phosphine sulfide, and triphenylphosphine selenide, with homodimers and heterodimer formation. In samples where the ligands were mixed, we observed mixed sodium ligand clusters at varying amounts. These mixed ligand clusters were fragmented. Metal clusters of mixed ligand dimers containing triphenylphosphine oxide showed preferential loss of the other ligand, either triphenylphosphine sulfide or triphenyl selenide. In samples with mixed triphenylphosphine sulfide and triphenylphosphine selenium ligands, sodium bound similarly between the ligands, and losses were more evenly split, showing loss ratio upon CID with losses of triphenylphosphine sulfide:triphenylphosphine selenide 43:57 ratio observed on CID. These results suggest that the oxide binds significantly more strongly than either the selenium or sulfur triphenylphosphine ligand, and the sulfur and selenium ligands are more evenly bound. Calculations were performed using density functional theory to calculate likely structures and bond energies between the group I metal and the ligands. Novel Aspect Novel analysis of sodium bound dimers with chalcogenide triphenylphosphine ligands were investigated using mass spectrometry and theoretical calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗