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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Probabilistic Parameter Uncertainty Analysis of Single Input Single Output Control Systems

The current standards for handling uncertainty in control systems use interval bounds for definition of the uncertain parameters. This approach gives no information about the likelihood of system performance, but simply gives the response bounds. When used in design, current methods of m-analysis and can lead to overly conservative controller design. With these methods, worst case conditions are weighted equally with the most likely conditions. This research explores a unique approach for probabilistic analysis of control systems. Current reliability methods are examined showing the strong areas of each in handling probability. A hybrid method is developed using these reliability tools for efficiently propagating probabilistic uncertainty through classical control analysis problems. The method developed is applied to classical response analysis as well as analysis methods that explore the effects of the uncertain parameters on stability and performance metrics. The benefits of using this hybrid approach for calculating the mean and variance of responses cumulative distribution functions are shown. Results of the probabilistic analysis of a missile pitch control system, and a non-collocated mass spring system, show the added information provided by this hybrid analysis.

Smith, Brett A.↗
DOE OSTI2026

Qubit lattice algorithm simulations of the scattering of a bounded two dimensional electromagnetic pulse from an infinite planar dielectric interface

Qubit lattice algorithm (QLA) simulations are performed for a two-dimensional spatially bounded pulse propagating onto a plane interface between two dielectric slabs. QLA is an initial value scheme that consists of a sequence of unitary collision and streaming operators, with appropriate potential operators, that recover Maxwell equations in inhomogeneous dielectric media to the second order in the lattice discreteness. For the case of total internal reflection, there is transient energy transfer into the second medium due to the evanescent fields as the Poynting unit vector of the pulse is rotated from its incident to reflected direction. Because of the finite spatial extent of the pulse, a self-consistent Goos–Hanchen-type displacement along the interface is found without imposing any explicit interface boundary conditions on the fields. For normal incidence, the standard Fresnel coefficients are recovered for appropriately averaged QLA fields. Energy is conserved at all times to seven significant figures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1994

Spin glasses and error-correcting codes

In this article, we study a model for error-correcting codes that comes from spin glass theory and leads to both new codes and a new decoding technique. Using the theory of spin glasses, it has been proven that a simple construction yields a family of binary codes whose performance asymptotically approaches the Shannon bound for the Gaussian channel. The limit is approached as the number of information bits per codeword approaches infinity while the rate of the code approaches zero. Thus, the codes rapidly become impractical. We present simulation results that show the performance of a few manageable examples of these codes. In the correspondence that exists between spin glasses and error-correcting codes, the concept of a thermal average leads to a method of decoding that differs from the standard method of finding the most likely information sequence for a given received codeword. Whereas the standard method corresponds to calculating the thermal average at temperature zero, calculating the thermal average at a certain optimum temperature results instead in the sequence of most likely information bits. Since linear block codes and convolutional codes can be viewed as examples of spin glasses, this new decoding method can be used to decode these codes in a way that minimizes the bit error rate instead of the codeword error rate. We present simulation results that show a small improvement in bit error rate by using the thermal average technique.

Belongie, M. L.↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Performance of coded MFSK in a Rician fading channel

The performance of convolutional codes in conjunction with noncoherent multiple frequency shift-keyed (MFSK) modulation and Viterbi maximum likelihood decoding on a Rician fading channel is examined in detail. While the primary motivation underlying this work has been concerned with system performance on the planetary entry channel, it is expected that the results are of considerably wider interest. Particular attention is given to modeling the channel in terms of a few meaningful parameters which can be correlated closely with the results of theoretical propagation studies. Fairly general upper bounds on bit error probability performance in the presence of fading are derived and compared with simulation results using both unquantized and quantized receiver outputs. The effects of receiver quantization and channel memory are investigated and it is concluded that the coded noncoherent MFSK system offers an attractive alternative to coherent BPSK in providing reliable low data rate communications in fading channels typical of planetary entry missions.

Modestino, J. W.↗
DOE OSTI2022

SchedInspector: A Batch Job Scheduling Inspector Using Reinforcement Learning

Improving the performance of job executions is an important goal of HPC batch job schedulers, such as minimizing job waiting time, slowdown, or completion time. Such a goal is often accomplished using carefully designed heuristics based on job features, such as job size and job duration. However, these heuristics overlook important runtime factors (e.g., cluster availability and waiting job patterns), which may vary across time and make a previously sound scheduling decision not hold any longer. In this study, we propose a new approach to incorporate runtime factors into batch job scheduling for better job execution performance. The key idea is to add a scheduling inspector on top of the base job scheduler to scrutinize its scheduling decisions. The inspector will take the runtime factors into consideration and accordingly determine the fitness of the scheduled job. It then either accepts the scheduled job or rejects it and asks the base schedulers to try again later. We realize such an inspector, namely SchedInspector, by leveraging the intelligence of reinforcement learning. Through extensive experiments, we show SchedInspector can intelligently integrate the runtime factors into various batch job scheduling policies, including the state-of-the-art one, to gain better job execution performance, such as smaller average bounded job slowdown (up to 69% better) or average job waiting time (up to 52% better), across various real-world workloads. We also show that although rejecting scheduling decisions may leave the resources idle hence affect the system utilization, SchedInspector is able to achieve the job execution performance improvement with marginal impact on the system utilization (typically less than 1%). We consider one key advantage of SchedInspector is it automatically learns to work with and improve existing job scheduling policies without changing them, which makes it promising to serve as a generic enhancer for various batch job scheduling policies.

Zhang, Di↗
DOE OSTI2022

Ultrafast Error-bounded Lossy Compression for Scientific Datasets

Today's scientific high-performance computing applications and advanced instruments are producing vast volumes of data across a wide range of domains, which impose a serious burden on data transfer and storage. Error-bounded lossy compression has been developed and widely used in the scientific community because it not only can significantly reduce the data volumes but also can strictly control the data distortion based on the user-specified error bound. Existing lossy compressors, however, cannot offer ultrafast compression speed, which is highly demanded by numerous applications or use cases (such as in-memory compression and online instrument data compression). In this paper, we propose a novel ultrafast error-bounded lossy compressor that can obtain fairly high compression performance on both CPUs and GPUs and with reasonably high compression ratios. The key contributions are threefold. (1) We propose a generic error-bounded lossy compression framework---called SZx---that achieves ultrafast performance through its novel design comprising only lightweight operations such as bitwise and addition/subtraction operations, while still keeping a high compression ratio. (2) We implement SZx on both CPUs and GPUs and optimize the performance according to their architectures. (3) We perform a comprehensive evaluation with six real-world production-level scientific datasets on both CPUs and GPUs. Experiments show that SZx is 2~16x faster than the second-fastest existing error-bounded lossy compressor (either SZ or ZFP) on CPUs and GPUs, with respect to both compression and decompression.

Yu, Xiaodong↗
NASA NTRS2016

Transient Thermal Analysis of the 12.5 KW HERMeS Hall Thruster

NASA’s Dawn spacecraft entered orbit around the dwarf planet Ceres on March 6, 2015 thereby becoming the first mission to orbit two celestial bodies outside of the Earth-moon system. This feat was made possible due to the use of electric propulsion (EP) to provide the 11 km/s of delta-V that was necessary. This type of propulsion is also enabling for many of NASA’s future missions, such as the proposed Asteroid Redirect Robotic Mission (ARRM). Specifically, the Hall Effect Rocket with Magnetic Shielding (HERMeS) is the propulsive design baseline due to its long operational lifetime and high specific impulse. Extensive modeling is required to verify the thruster's predicted thermal performance and survival during the bounding mission phases. Since the thruster would constrain plasma on the order of tens of thousands of hours, components in the thruster must be able to accommodate much higher sustained temperatures than typical spacecraft hardware. Furthermore, the high temperatures necessitate care in analyzing thermal gradients within the thruster. In this paper, we describe a thermal model of the HERMeS thruster and focus upon the thruster's transient performance under different initial firing conditions. The thruster's transient thermal response is critical to verify margin in the thermal stresses inherent in the thruster and to determine safe start-up procedures to protect the thruster's critical components. This model is used to perform transient thermal analysis of the thruster during startup and shutdown, provide temperature maps for structural analysis, and plan for thermal cycle testing conducted at JPL. The thermal cycle testing includes thruster starts at the cold temperature limits and operation at maximum expected external heat flux. This work will support laboratory environmental testing of the HERMeS thruster, which is being conducted at JPL in 2016.

Reilly, Sean↗
NASA NTRS1974

The effects of a visual fidelity criterion on the encoding of images

Shannon's rate-distortion function provides a potentially useful lower bound against which to compare the rate-versus-distortion performance of practical encoding-transmission systems. However, this bound is not applicable unless one can arrive at a numerically-valued measure of distortion which is in reasonable correspondence with the subjective evaluation of the observer or interpreter. We have attempted to investigate this choice of distortion measure for monochrome still images. This investigation has considered a class of distortion measures for which it is possible to simulate the optimum (in a rate-distortion sense) encoding. Such simulation was performed at a fixed rate for various measures in the class and the results compared subjectively by observers. For several choices of transmission rate and original images, one distortion measure was fairly consistently rated as yielding the most satisfactory appearing encoded images.

Mannos, J. L.↗
DOE OSTI2022

Offering of Variable Resources in Regulation Markets with Performance Targets: An Analysis

To date, wind and solar power plants have mainly provided energy. Going forward, with the application of appropriate controls, they can offer additional grid services, such as regulating reserves. Additional grid services can present an opportunity for additional value streams to wind and solar power plants. However, the additional value might not be realized when operator-determined performance targets and settlement adjustments for the delivery of regulation capacity are disregarded. Additionally, this article studies the participation of variable resources in centralized regulation markets. We derive analytical results for regulation offers in terms of quantity and price considering that a variable resource does not want to risk being disqualified as a regulation provider, incurring losses, or foregoing more profitable opportunities. Our analysis suggests that U.S. operator-determined performance targets impose an upper bound on the quantity of a variable resource’s regulation offer; and settlement adjustments for the delivery of regulation affect the price at which variable resources offer and the calculations of opportunity costs in case of imperfect regulation delivery.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗
NASA NTRS2025

A Comparison of Bank Control and Direct Force Control for Aerocapture at Uranus

We compare bank angle control and direct force control for aerocapture at Uranus. We utilize the Fully Numerical Predictor-corrector Aerocapture Guidance for both configurations and discuss modifications to the direct force control corrector to handle multiple roots. Using the Genesis flight mechanics simulation, we analyze both nominal and dispersed three-degree-of-freedom trajectories with perfect navigation and control. We present Monte Carlo results and discuss differences between the performance of the two control approaches. We find that increased bank angle rate and acceleration limits do not increase the performance of the bank control configuration. We analyze a variation with tighter angle of attack bounds and find that the tuning and performance of the two configurations converges, because direct force control is less able to modulate drag.

Sergio A Sandoval↗
NASA NTRS2011

Statistical Analysis of Thermal Analysis Margin

NASA Goddard Space Flight Center requires that each project demonstrate a minimum of 5 C margin between temperature predictions and hot and cold flight operational limits. The bounding temperature predictions include worst-case environment and thermal optical properties. The purpose of this work is to: assess how current missions are performing against their pre-launch bounding temperature predictions and suggest any possible changes to the thermal analysis margin rules

Garrison, Matthew B.↗
NASA NTRS1998

Demonstration of a Probabilistic Technique for the Determination of Economic Viability of Very Large Transport Configurations

Over the past few years, modem aircraft design has experienced a paradigm shift from designing for performance to designing for affordability. This report contains a probabilistic approach that will allow traditional deterministic design methods to be extended to account for disciplinary, economic, and technological uncertainty. The probabilistic approach was facilitated by the Fast Probability Integration (FPI) technique; a technique which allows the designer to gather valuable information about the vehicle's behavior in the design space. This technique is efficient for assessing multi-attribute, multi-constraint problems in a more realistic fashion. For implementation purposes, this technique is applied to illustrate how both economic and technological uncertainty associated with a Very Large Transport aircraft concept may be assessed. The assessment is evaluated with the FPI technique to determine the cumulative probability distributions of the design space, as bound by economic objectives and performance constraints. These distributions were compared to established targets for a comparable large capacity aircraft, similar in size to the Boeing 747-400. The conventional baseline configuration design space was determined to be unfeasible and marginally viable, motivating the infusion of advanced technologies, including reductions in drag, specific fuel consumption, wing weight, and Research, Development, Testing, and Evaluation costs. The resulting system design space was qualitatively assessed with technology metric "k" factors. The infusion of technologies shifted the VLT design into regions of feasibility and greater viability. The study also demonstrated a method and relationship by which the impact of new technologies may be assessed in a more system focused approach.

Mavris, Dimitri N.↗
DOE OSTI2022

Understanding Strong Scaling on GPUs Using Empirical Performance Saturation Size

The roofline model provides a concise overview of the maximum performance capabilities of a given computer system through a combination of peak memory bandwidth and compute performance rates. The increasing complexity of scheduling and cache in recent GPUs, however, has introduced complicated performance variability that is not captured by arithmetic intensity alone. This work examines the effect of problem size and GPU launch configurations on roofline performance for V100, A100, MI100, and MI250X graphics processing units. We introduce an extended roofline model that takes problem size into account, and find that strong scaling on GPUs can be characterized by saturation problem sizes as additional key metrics. Saturation problem sizes break up a plot of GPU performance vs. problem size into three distinct performance regimes– size-limited, cache-bound, and DRAM-bound. With our extended roofline model, we are able to provide a robust view of these performance regimes across recent GPU architectures.

Eberius, David↗
DOE OSTI2020

Pyrazine-Fused Porous Graphitic Framework-Based Mixed Matrix Membranes for Enhanced Gas Separations

Membrane-based separations can mitigate the capital- and energy-intensive challenges associated with traditional thermally driven processes. To further push the boundary of gas separations, mixed matrix membranes (MMMs) have been extensively exploited; however, identifying an optimal nanofiller to boost the separation performance of MMMs beyond Robeson permeability-selectivity upper bounds remains an ongoing challenge. In this study, a new class of MMMs based on pyrazine-fused crystalline porous graphitic frameworks (PGFs) is reported. At a loading of 6 wt % PGFs, the MMMs surpass the current H 2 /CH 4 Robeson upper bound, ideally suited for applications such as H 2 regeneration. In addition, the fabricated MMMs exhibit appealing CO 2 separation performance, closely approaching the current Robeson upper bounds for CO 2 separation. Compared with the pristine polymeric membranes, the PGF-based MMMs display a record-high enhancement of gas permeability over 120% while maintaining intrinsic gas selectivities. Highlighting the crucial role of the crystallinity of nanofillers, this study demonstrates a facile and effective approach in formulating high-performance MMMs, complementing state-of-the-art membrane formation processes. The design principles open the door to energy-efficient separations of gas mixtures with enhanced productivity compatible with the current membrane manufacturing.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Tunable Catalytic Performance of Palladium Nanoparticles for H 2 O 2 Direct Synthesis via Surface-Bound Ligands

There is a critical need for sustainable routes to produce hydrogen peroxide, H 2 O 2 . A promising approach involves direct synthesis from molecular hydrogen and oxygen at (sub)ambient temperatures using unmodified supported Pd catalysts, which are limited by low selectivities. Controlling the environment of Pd active sites via surface ligands is shown to enhance selectivity. Trends among a myriad of surface ligands (i.e., phosphines, thiols, weakly bound molecules) suggest that those containing H-bonding groups lead to the highest H 2 O 2 production, potentially by affecting reaction energetics via H-bonding with key intermediates. These insights lay the groundwork for ligand design to achieve the optimal catalyst performance for H 2 O 2 synthesis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Benchmark CO 2 separation achieved by highly fluorinated nanoporous molecular sieve membranes from nonporous precursor via in situ cross-linking

Molecular sieve membranes with rigid micropores and CO 2 -philic functionalities within the architectures are promising candidates in CO 2 separation. However, the development of ctieve approaches for their fabrication still remains a significant challenge. In this study, an in situ cross-linking strategy is developed for the preparation of nanoporous fluorinated moleffecular sieve membranes using commercially available dense and non-porous polystyrene (M PS ) as a precursor template. Based on the dehydrative Friedel-Crafts reactions with highly fluorinated benzylic alcohols, M PS membranes are cross-linked in situ upon exposure to Brønsted acid (CF 3 SO 3 H), affording fluorinated microporous polymeric membranes with surface areas up to 523 m 2 g –1 and the presence of micropores centered at 1.1–1.3 nm as well as ultra-micropores (~0.6 nm). The obtained modified membranes exhibit good ideal CO 2 permeability of 797 barrer and CO 2 /N 2 selectivity of 28.5. In addition, high fluorine content (up to 28.5 wt%) and good thermal stability made the cross-linked membranes promising candidates to produce fluorinated carbon molecular sieve membranes with improved textural properties, exhibiting surface areas up to 1020 m 2 g –1 and ultra-micropores of ~0.4 nm. These membranes achieve superior CO 2 /N 2 separation performances exceeding the Robeson upper bound limit (2008).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗