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 199 records · Page 11

Pressure Oscillations in Shuttle Solid Rocket Motors

All Shuttle Solid Rocket Motors (SRM's) exhibit low amplitude longitudinal pressure oscillations during motor burn. Although the oscillations have no known deleterious effect on motor ballistics, the acoustic pressure variations cause thrust oscillations that might affect Shuttle systems or components. The acoustic mode of greatest interest is the first or fundamental mode which, in the SRM, has a nominal frequency of 14-Hz. Oscillations in the SRM are believed to be caused by coupling between large scale vortices and the acoustic modes of the motor chamber. The vortices are thought to be created in the region of the motor segment interfaces and are inherent in the design of the motor. In such a situation the usual approach is to measure the oscillations and assess their impact on any sensitive components through tests and analysis. Questionable components can be altered to survive the vibration environment. As motor firings occur, oscillations are monitored to determine whether there are changes in the nature of the oscillations. Since the first static test, SRM's have been equipped with instrumentation especially designed to acquire chamber pressure oscillation data. Data from the first SRM static tests were used to establish predicted upper bounds for the maximum amplitudes in the latter half of burn. Those bounds have been used as a basis for worst-case simulation scenarios by specialists in structural dynamics at NASA and Rockwell International and to provide a basis for evaluating data from individual motors which were tested subsequent to the original SRM's. This paper updates the upper bounds prediction the High Performance Motors (HPM) by including data from all static tests performed to date including both original SRM's and post Challenger SRM's or Reusable Solid Rocket Motors (RSRM) in which the joint design was changed. All together, this study examines 27 SRM motors, 16 HPM motors and 11 RSRM motors. Predicted upper bounds will be made for both the first and second longitudinal modes. The first mode upper bounds will be compared to the original seven standard rocket motors (STD). The results indicate that, although the upper bounds have increased, they are still within acceptable bounds.

Blomshield, Fred S.↗

Binary weight distributions of some Reed-Solomon codes

The binary weight distributions of the (7,5) and (15,9) Reed-Solomon (RS) codes and their duals are computed using the MacWilliams identities. Several mappings of symbols to bits are considered and those offering the largest binary minimum distance are found. These results are then used to compute bounds on the soft-decoding performance of these codes in the presence of additive Gaussian noise. These bounds are useful for finding large binary block codes with good performance and for verifying the performance obtained by specific soft-coding algorithms presently under development.

Pollara, F.↗

Microstructural evaluation of the creep behavior in L-PBF Ni-based superalloys

This presentation at ICAM 2024 Conference focuses on the commonalities and differences in the creep rupture behavior and creep mechanisms for three distinct classes of laser powder-bed fusion (L-PBF) Ni-based superalloys (γ’-precipitate strengthened Haynes® 282®, γ’/γ”/δ-precipitate strengthened Alloy 718, and solid-solution strengthened Alloy 625) as compared to conventionally processed counterparts. A comparison of Larson-Miller parameter plots establishes that these alloys perform statistically within the bounds established for the wrought product, despite having dissimilar microstructural features and other artefacts associated with PBF-LB manufacturing and post-processing heat treatment. To understand the failure and the impact of composition, minor phases, and deformation defects on creep behavior, the fractography has been performed and microstructures have been evaluated in detail with SEM-EDS, EBSD, and HAADF-STEM. The underlying diffusional and dislocation creep mechanisms associated with this microstructural evaluation is discussed. This work is supported by NETL-FWP-1022408 Advanced Turbines.

Sudbrack, Chantal↗

Quantitative Performance Assessment of Proxy Apps and Parents (ECP Proxy App Project Milestone ADCD-504-9)

This report presents highlights of these efforts. Section 2 describes work that has been done to compare the performance of proxy applications on AMD MI60 vs. Nvidia V100 GPUs. So far only a small set of ECP proxies are running on AMD GPUs, but we will continue to expand this analysis as additional proxies become available. We find that although the MI60 and V100 have nearly the same measured memory bandwidth, memory bound proxy app kernels perform 20-30% worse on the MI60. Further work is needed to refine these comparisons to determine whether the root cause is due to differences in the hardware, software stack, platform specific optimization, or some combination of the three. Section 3 describes our continuing effort to find methods to accurately assess the similarity of proxies and parents. We have recently seen very encouraging results using a cosine similarity metric. This technique uses the angle between two vectors of hardware performance counters to characterize the similarity (or difference) between two applications or proxies. We show not only that several widely used proxies are highly similar to their parents, but also that they differ from non-related codes. We also show that cosine similarity can be used to identify gaps and redundancies in suites and even to gain insight into the effects of architectural differences between platforms. Our work on assessing the Exascale toolchain is ongoing. Our successes with performance measurement tools are evident from the data provided in this report. However, our assessments across the broader tool chain are still too incomplete to provide a meaningful report at this time. We will continue to assess tools and work with vendors and third party developers as issues are identified.

97 MATHEMATICS AND COMPUTING↗

Perturbation guidance for aerocruise with bounded control

A perturbation guidance algorithm is developed for the constant-altitude portion of the orbital-plane change maneuver, called aerocruise. It is obtained by solving a linear-quadratic regulator problem in terms of the perturbed state and control variables. The regulator problem with hard control-variable constraints is then studied. For the two-control-variable case, the simulation results show that the bounded-control algorithm gives better performance than that obtained using a limiter for the case where control variables exceed the bounds.

Hull, David G.↗

High Performance, Robust Control of Flexible Space Structures: MSFC Center Director's Discretionary Fund

Many spacecraft systems have ambitious objectives that place stringent requirements on control systems. Achievable performance is often limited because of difficulty of obtaining accurate models for flexible space structures. To achieve sufficiently high performance to accomplish mission objectives may require the ability to refine the control design model based on closed-loop test data and tune the controller based on the refined model. A control system design procedure is developed based on mixed H2/H(infinity) optimization to synthesize a set of controllers explicitly trading between nominal performance and robust stability. A homotopy algorithm is presented which generates a trajectory of gains that may be implemented to determine maximum achievable performance for a given model error bound. Examples show that a better balance between robustness and performance is obtained using the mixed H2/H(infinity) design method than either H2 or mu-synthesis control design. A second contribution is a new procedure for closed-loop system identification which refines parameters of a control design model in a canonical realization. Examples demonstrate convergence of the parameter estimation and improved performance realized by using the refined model for controller redesign. These developments result in an effective mechanism for achieving high-performance control of flexible space structures.

Whorton, M. S.↗

A Computational Framework to Control Verification and Robustness Analysis

This paper presents a methodology for evaluating the robustness of a controller based on its ability to satisfy the design requirements. The framework proposed is generic since it allows for high-fidelity models, arbitrary control structures and arbitrary functional dependencies between the requirements and the uncertain parameters. The cornerstone of this contribution is the ability to bound the region of the uncertain parameter space where the degradation in closed-loop performance remains acceptable. The size of this bounding set, whose geometry can be prescribed according to deterministic or probabilistic uncertainty models, is a measure of robustness. The robustness metrics proposed herein are the parametric safety margin, the reliability index, the failure probability and upper bounds to this probability. The performance observed at the control verification setting, where the assumptions and approximations used for control design may no longer hold, will fully determine the proposed control assessment.

Crespo, Luis G.↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗

Multi-stage decoding for multi-level block modulation codes

Various types of multistage decoding for multilevel 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 are discussed. Error performance for 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. It was found 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. It was found 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↗

Understanding the Conductivity and Transference Trade-Off in Polymer Electrolytes Using a Robeson-Inspired Upper Bound

The development of high-performance electrolytes is crucial for advancing next-generation lithium and sodium battery technologies. Since the cation is the working ion in both technologies, electrolytes exhibiting the rapid cation transport are essential for making progress. Pathways to optimize electrolytes are unclear due to the inherent trade-off between conductivity and cation transference. While this trade-off is sometimes recognized, there are no well-accepted methodologies for quantifying it. Inspired by the Robeson upper bound for the permeability–selectivity trade-off in gas separation membranes, we propose an approach for quantifying the trade-off in electrolytes using Newman’s concentrated solution theory. We suggest calling this the Newman upper bound. By analyzing published data from 30 polymer electrolytes containing univalent lithium and sodium salts, the Newman upper bound is expressed as κ = 2.0­(1/ρ+ – 1) where κ (mS/cm) is conductivity and ρ+ is the current fraction measured in a symmetric cell as first described by Bruce et al. [J. Electroanal. Chem. Interfacial Electrochem. 1987, 225 (1), 1–17]. This formulation of the upper bound introduces a critical guiding metric for designing next-generation polymer electrolytes; it highlights factors underlying the trade-off, including the salt diffusion coefficient (D), cation transference number relative to solvent velocity ( t + 0 ), and thermodynamic factor (1 + (d lnγ+–)/(d lnm)), where γ+– is the mean molar activity coefficient and m is the molality. These parameters have been measured for very few electrolytes. We posit that establishing the molecular properties that govern these parameters will lead to improved electrolytes that greatly exceed the current upper bound.

He, Zirong↗

Di-nucleons do not form bound states at heavy pion mass

We perform a high-statistics lattice QCD calculation of the low-energy two-nucleon scattering amplitudes. To address discrepancies in the literature, the calculation is performed at a heavy pion mass in the limit that the light quark masses are equal to the physical strange quark mass, 𝑚 𝜋 = 𝑚 𝐾 ≃ 714 MeV. Using a state-of-the-art momentum space method, we rule out the presence of a bound di-nucleon in both the isospin 0 (deuteron) and 1 (di-neutron) channels, in contrast with many previous results that made use of compact hexaquark creation operators. To diagnose the discrepancy, we add such hexaquark interpolating operators to our basis and find that they do not affect the determination of the two-nucleon finite-volume spectrum, and thus they do not couple to deeply bound di-nucleons that are missed by the momentum-space operators. Furthermore, we perform a high-statistics calculation of the HAL QCD potential on the same gauge ensembles and find qualitative agreement with our main results. We conclude that di-nucleons do not form bound states at heavy pion masses and that previous identification of deeply bound di-nucleons must have arisen from a misidentification of the spectrum from off-diagonal elements of a correlation function.

Physics - Physics of elementary particles and fiel↗

Di-nucleons do not form bound states at heavy pion mass

We perform a high-statistics lattice QCD calculation of the low-energy two-nucleon scattering amplitudes. In order to address discrepancies in the literature, the calculation is performed at a heavy pion mass in the limit that the light quark masses are equal to the physical strange quark mass, $m_π= m_K \simeq 714 $ MeV. Using a state-of-the-art momentum space method, we rule out the presence of a bound di-nucleon in both the isospin 0 (deuteron) and 1 (di-neutron) channels, in contrast with many previous results that made use of compact hexaquark creation operators. In order to diagnose the discrepancy, we add such hexaquark interpolating operators to our basis and find that they do not affect the determination of the two-nucleon finite volume spectrum, and thus they do not couple to deeply bound di-nucleons that are missed by the momentum-space operators. Further, we perform a high-statistics calculation of the HAL QCD potential on the same gauge ensembles and find qualitative agreement with our main results. We conclude that two-nucleons do not form bound states at heavy pion masses and that previous identification of deeply bound di-nucleons must have arisen from a misidentification of the spectrum from off-diagonal elements of a correlation function.

FOS: Physical sciences↗

Sulfur-functionalized solid-phase materials for the selective separation of arsenic and selenium

Radioactive arsenic (As) isotopes are of growing interest for applications in nuclear medicine, national security, and environmental research. Recent efforts at the Facility for Rare Isotope Beams (FRIB) have focused on aqueous harvesting of selenium-72,73 ( 72,73 Se) and their daughter isotopes, arsenic-72,73 ( 72,73 As), which are particularly valuable for medical applications and nuclear data studies, respectively. Both conventional isotope production and harvesting methods require chemical separations to purify radioactive As from parent and co-produced Se radioisotopes. While several solid-phase separation methods for As and Se exist, many depend on complex oxidation state control or highly acidic conditions. This study presents results for sulfur-based solid-phase materials selected to enable uptake at lower acidity and eliminate the need for intricate redox chemistry. Specifically, the performance of three covalently bound sulfur-based ligands were evaluated: (1) thiophenol-polystyrene, (2) propanethiol-silica, and (3) thiourea-silica. Uptake characteristics—including distribution coefficients (Dw), kinetics, and column separation behavior—were assessed using 75 Se and 73 As in hydrochloric (HCl) acid and nitric (HNO 3 ) solutions. The resins demonstrated high-yield (>95%) and high-purity As recovery across a range of HCl concentrations. Comparable results in HNO 3 were achieved when combined with anion exchange chromatography. Furthermore, the potential application of these materials for medical isotope generators was also investigated through ligand stability and repeated elution studies. Overall, sulfur leaching from the resins was negligible at the concentrations relevant for these separations but increased with higher acid concentrations.

Arsenic↗

A Novel Modeling Framework for Computationally Efficient and Accurate Real-Time Ensemble Flood Forecasting With Uncertainty Quantification

A novel modeling framework that simultaneously improves accuracy, predictability, and computational efficiency is presented. It embraces the benefits of three modeling techniques integrated together for the first time: surrogate modeling, parameter inference, and data assimilation. The use of polynomial chaos expansion (PCE) surrogates significantly decreases computational time. Parameter inference allows for model faster convergence, reduced uncertainty, and superior accuracy of simulated results. Ensemble Kalman filters assimilate errors that occur during forecasting. To examine the applicability and effectiveness of the integrated framework, we developed 18 approaches according to how surrogate models are constructed, what type of parameter distributions are used as model inputs, and whether model parameters are updated during the data assimilation procedure. We conclude that (1) PCE must be built over various forcing and flow conditions, and in contrast to previous studies, it does not need to be rebuilt at each time step; (2) model parameter specification that relies on constrained, posterior information of parameters (so-called Selected specification) can significantly improve forecasting performance and reduce uncertainty bounds compared to Random specification using prior information of parameters; and (3) no substantial differences in results exist between single and dual ensemble Kalman filters, but the latter better simulates flood peaks. The use of PCE effectively compensates for the computational load added by the parameter inference and data assimilation (up to ~80 times faster). Therefore, the presented approach contributes to a shift in modeling paradigm arguing that complex, high-fidelity hydrologic and hydraulic models should be increasingly adopted for real-time and ensemble flood forecasting.

54 ENVIRONMENTAL SCIENCES↗

Heterogenous catalysis for oxygen tolerant photoredox atom transfer radical polymerization and small-molecule dehalogenation

Heterogeneous photocatalysts (PCs) have garnered attention for their sustainability and cost-effectiveness. Despite the existence of various types of these PCs, their synthesis often involves complex, multi-step procedures and laborious purification. Herein, we propose a simple method for attaching small-molecule photocatalytic species onto crosslinked 3-D polymer networks as insoluble scaffolds to create robust heterogeneous PCs. The highly swellable poly(ethylene glycol)-based ChemMatrix (CM) resin, known for its amphiphilic properties and high functional group loading, facilitated the covalent immobilization of the photoredox dye Eosin Y (EY), but also streamlined functionalization with Ir( III ) complexes. The resulting heterogeneous CM-EY demonstrated efficient photocatalytic performance in open-to-air dual photoredox catalysis of atom transfer radical polymerization (photo-ATRP) under green light. This was confirmed by the well-controlled synthesis of polymers with molecular masses ranging from 20 kDa to 300 kDa and low dispersities. Furthermore, CM-EY exhibited excellent photostability and recyclability over multiple cycles of ATRP. The heterogeneous catalysis of photo-ATRP provided high temporal control and enabled benign conditions for synthesizing protein-polymer hybrids (PPH). When combined with the initiator-modified CM (CM-BIB), CM-EY facilitated the solid-phase synthesis of homopolymers and block copolymers with recyclable performance. However, the coordinatively bound Ir@CM showed decreased catalytic activity and efficiency toward photoredox dehalogenation due to the leaching of active species during recycling. This study highlights the advantages of the covalent linking of catalysts to solid supports over non-covalent interactions, underscoring the potential of functionalized polymer resin as a promising scaffold. Such an approach offers customization and tunability, presenting opportunities for innovation in green chemistry.

Kapil, Kriti↗

Spatiotemporally Adaptive Compression for Scientific Dataset with Feature Preservation – A Case Study on Simulation Data with Extreme Climate Events Analysis

Scientific discoveries are increasingly constrained by limited storage space and I/O capacities. For time-series simulations and experiments, their data often need to be decimated over timesteps to accommodate storage and I/O limitations. In this paper, we propose a technique that addresses storage costs while improving post-analysis accuracy through spatiotemporal adaptive, error-controlled lossy compression. We investigate the trade-off between data precision and temporal output rates, revealing that reducing data precision and increasing timestep frequency lead to more accurate analysis outcomes. Additionally, we integrate spatiotemporal feature detection with data compression and demonstrate that performing adaptive error-bounded compression in higher dimensional space enables greater compression ratios, leveraging the error propagation theory of a transformation-based compressor. To evaluate our approach, we conduct experiments using the well-known E3SM climate simulation code and apply our method to compress variables used for cyclone tracking. Our results show a significant reduction in storage size while enhancing the quality of cyclone tracking analysis, both quantitatively and qualitatively, in comparison to the prevalent timestep decimation approach. Compared to three state-of-the-art lossy compressors lacking feature preservation capabilities, our adaptive compression framework improves perfectly matched cases in TC tracking by 26.4-51.3% at medium compression ratios and by 77.3-571.1% at large compression ratios, with a merely 5–11% computational overhead.

Gong, Qian↗

Online Learning and Pricing for Service Systems with Reusable Resources

We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how the arrival and service rates depend on posted prices, and thus it makes adaptive pricing decisions in each period based only on past observations to maximize the cumulative revenue. Given a discrete price set with cardinality P, we propose two online learning algorithms, termed batch upper confidence bound (BUCB) and batch Thompson sampling (BTS), and prove that the cumulative regret upper bound is O˜(√PT) , which matches the regret lower bound. In establishing the regret, we bound the transient system performance upon price changes via a novel coupling argument, and also generalize bandits to accommodate subexponential rewards. Here, we also extend our approach to models with balking and reneging customers and discuss a continuous price setting. Our numerical experiments demonstrate the efficacy of the proposed BUCB and BTS algorithms.

97 MATHEMATICS AND COMPUTING↗