Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “robustness”

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

Neural Image Compression: Generalization, Robustness, and Spectral Biases

Recent advances in neural image compression (NIC) have resulted in models which are starting to outperform traditional codecs. While this has led to growing excitement about using these methods in real-world applications, the successful adoption of any machine learning system (including NIC) in the wild requires it to generalize (and be robust) to unseen distribution shifts at deployment time. Unfortunately, current research lacks comprehensive datasets and informative tools to evaluate and understand compression performance in real-world settings. To bridge this crucial gap, first, this paper presents a comprehensive benchmark suite to evaluate the out-of-distribution (OOD) performance of image compression methods. Specifically, we design CLIC-C and Kodak-C by introducing 15 common corruptions to popular CLIC and Kodak benchmarks. Next, we propose spectrally inspired introspection tools to gain a deeper understanding of errors introduced by image compression methods as well as their OOD performance. To this end, we carry out a detailed performance comparison of the classical codec with various variants of NIC (e.g., original, variable rate, pruned), revealing intriguing findings that challenge our current understanding of the strengths and limitations of NIC. Finally, we corroborate our empirical findings with theoretical analysis, providing an in-depth view of the OOD performance of NIC. Our benchmarks, spectral introspection tools, and findings provide a crucial bridge to the real-world adoption of NIC. We hope that our work will propel future efforts in designing more robust and generalizable NIC methods.

neural networks, Variational Autoencoder, robustne↗
DOE OSTI2018

Mechanically Robust, Ultraelastic Hierarchical Foam with Tunable Properties via 3D Printing

We present a mechanically robust, ultraelastic foam with controlled multiscale architectures and tunable mechanical/conductive performance is fabricated via 3D printing. Hierarchical porosity, including both macro- and microscaled pores, are produced by the combination of direct ink writing (DIW), acid etching, and phase inversion. The thixotropic inks in DIW are formulated by a simple one-pot process to disperse duo nanoparticles (nanoclay and silica nanoparticles) in a polyurethane suspension. The resulting lightweight foam exhibits tailorable mechanical strength, unprecedented elasticity (standing over 1000 compression cycles), and remarkable robustness (rapidly and fully recover after a load more than 20 000 times of its own weight). Surface coating of carbon nanotubes yields a conductive elastic foam that can be used as piezoresistivity sensor with high sensitivity. For the first time, this strategy achieves 3D printing of elastic foam with controlled multilevel 3D structures and mechanical/conductive properties. In conclusion, the facile ink preparation method can be utilized to fabricate foams of various materials with desirable performance via 3D printing.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Hierarchically Porous M-N-C (M = Co and Fe) Single-Atom Electrocatalysts with Robust MN x Active Moieties Enable Enhanced ORR Performance

The great interest in fuel cells inspires a substantial amount of research on nonprecious metal catalysts as alternatives to Pt-based oxygen reduction reaction (ORR) electrocatalysts. In this work, bimodal template-based synthesis strategies are proposed for the scalable preparation of hierarchically porous M-N-C (M = Fe or Co) single-atom electrocatalysts featured with active and robust MN 2 active moieties. Multiscale tuning of M-N-C catalysts regarding increasing the number of active sites and boosting the intrinsic activity of each active site is realized simultaneously at a single-atom scale. In addition to the antipoisoning power and high affinity for O 2 , the optimized Fe-N-C catalysts with FeN 2 active site presents a superior electrocatalytic activity for ORR with a half-wave potential of 0.927 V (vs reversible hydrogen electrode (RHE)) in an alkaline medium, which is 49 and 55 mV higher than those of the Co-N-C counterpart and commercial Pt/C, respectively. Density functional theory calculations reveal that the FeN 2 site is more active than the CoN 2 site for ORR due to the lower energy barriers of the intermediates and products involved. In conclusion, the present work may help rational design of more robust ORR electrocatalysts at the atomic level, realizing the significant advances in electrochemical conversion and storage devices.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Rapid Aqueous Spray Fabrication of Robust NiO x : A Simple and Scalable Platform for Efficient Perovskite Solar Cells

Organometal halide perovskites have powerful intrinsic potential to drive next-generation solar technology, but their insufficient thermomechanical reliability and unproven large-area manufacturability limit competition with incumbent silicon photovoltaics. This work addresses these limitations by leveraging large-area processing and robust inorganic hole transport layers (HTLs). Inverted perovskite solar cells utilizing NiO x HTLs deposited by rapid aqueous spray-coating that outperform spin-coated NiO x and lead to a 5× improvement in the fracture energy (Gc), a primary metric of thermomechanical stability, are presented. Additionally, the morphology, chemical composition, and optoelectronic properties of the NiO x films are characterized to understand and optimize compatibility with an archetypal double cation perovskite, Cs .17 FA .83 Pb(Br .17 I .83 ) 3 . Perovskite solar cells with sprayed NiO x show higher photovoltaic performance, exhibiting up to 82% fill factor and 17.7% power conversion efficiency (PCE)—the highest PCE reported for inverted cell with scalable charge transport layers—as well as excellent stability under full illumination and after 4000 h aging in inert conditions at room temperature. By utilizing open-air techniques and aqueous precursors, this combination of robust materials and low-cost processing provides a platform for scaling perovskite modules with long-term reliability.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Design of Star‐Shaped Trimer Acceptors for High‐Performance (Efficiency > 19%), Photostable, and Mechanically Robust Organic Solar Cells

Abstract High power conversion efficiency (PCE), long‐term stability, and mechanical robustness are prerequisites for the commercial applications of organic solar cells (OSCs). In this study, a new star‐shaped trimer acceptor (TYT‐S) is developed and high‐performance OSCs with a PCE of 19.0%, high photo‐stability (t 80% lifetime = 2600 h under 1‐sun illumination), and mechanical robustness with a crack‐onset strain (COS) of 21.6% are achieved. The isotropic molecular structure of TYT‐S affords efficient multi‐directional charge transport and high electron mobility. Furthermore, its amorphous structure prevents the formation of brittle crystal‐to‐crystal interfaces, significantly enhancing the mechanical properties of the OSC. As a result, the TYT‐S‐based OSCs demonstrate a significantly higher PCE (19.0%) and stretchability (COS = 21.6%) than the linear‐shaped trimer acceptor (TYT‐L)‐based OSCs (PCE = 17.5% and COS = 6.4%) and the small‐molecule acceptor (MYT)‐based OSCs (PCE = 16.5% and COS = 1.3%). In addition, the increased molecular size of TYT‐S, relative to that of MYT and dimer (DYT), suppresses the diffusion kinetics of the acceptor molecules, substantially improving the photostability of the OSCs. Finally, to effectively demonstrate the potential of TYT‐S, intrinsically stretchable (IS)‐OSCs are constructed. The TYT‐S‐based IS‐OSCs exhibit high device stretchability (strain at PCE 80% = 31%) and PCE of 14.4%.

Chemistry↗
DOE OSTI2016

Identification of robust microsatellite markers for wild pig fecal DNA

ABSTRACT Collection of fecal samples for use in a genetic capture‐mark‐recapture framework has become popular as a noninvasive method of monitoring wildlife populations. A major caveat to this process, however, is that fecal samples often yield low quality DNA that is prone to genotyping errors, potentially leading to biases in population parameter estimation. Therefore, considerable care is required to identify robust genetic markers, especially in hot or humid conditions that may accelerate DNA degradation. We identified microsatellite loci in wild pig ( Sus scrofa ) fecal samples that were robust and informative within warm, humid ecosystems. To examine how degradation affected genotyping success, we sampled pig feces across 5 days and calculated how the number of quantitative polymerase chain reaction (qPCR) cycles required to reach the fluorescent threshold ( C t ) changed over time. We identified 17 microsatellite loci that had high polymorphism and amplification success and low genotyping error rates (0–0.050 per locus). In the degradation experiment, C t increased over the 5 days, but in the absence of rain, the majority of samples produced accurate genotypes after 5 days (2,211/2,550 genotypes). Based on the high amplification success and low error rates, even after 5 days of exposure to warm, humid conditions, these loci are useful for estimating population parameters in pig fecal samples. © 2016 The Wildlife Society.

Kierepka, Elizabeth M.↗
DOE OSTI2026

Overlapping Schwarz Methods Are Not Anisotropy‐Robust Multigrid Smoothers

We analyze overlapping multiplicative Schwarz methods as smoothers in the geometric multigrid solution of two-dimensional anisotropic diffusion problems. For diffusion equations, it is well known that the smoothing properties of point-wise smoothers, such as Gauss Seidel, rapidly deteriorate as the strength of anisotropy increases. On the other hand, global smoothers based on line smoothing are known to generally provide good smoothing for diffusion problems, independent of the anisotropy strength. Here, a natural question is whether global methods are really necessary to achieve good smoothing in such problems, or whether it can be obtained with locally overlapping block smoothers using sufficiently large blocks and overlap. Through local Fourier analysis and careful numerical experimentation, we show that global methods are indeed necessary to achieve anisotropy-robust smoothing. Specifically, for any fixed block size bounded sufficiently far away from the global domain size, we find that the smoothing properties of overlapping multiplicative Schwarz rapidly deteriorate with increasing anisotropy, irrespective of the amount of overlap between blocks. Moreover, our results indicate that anisotropy-robust smoothing requires blocks of diameter 𝒪⁡(𝜖 −1/2 ) for anisotropy ratio 𝜖 ∈(0,1] .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices

Summary In this article, we introduce a fast, memory efficient and robust sparse preconditioner that is based on a direct factorization scheme for sparse matrices arising from the finite‐element discretization of elliptic partial differential equations. We use a fast (but approximate) multifrontal approach as a preconditioner and use an iterative scheme to achieve a desired accuracy. This approach combines the advantages of direct and iterative schemes to arrive at a fast, robust, and accurate preconditioner. We will show that this approach is faster (∼2×) and more memory efficient (∼2–3×) than a conventional direct multifrontal approach. Furthermore, we will demonstrate that this preconditioner is both faster and more effective than other preconditioners such as the incomplete LU preconditioner. Specific speedups depend on the matrix size and improve as the size of the matrix increases. The preconditioner can be applied to both structured and unstructured meshes in a similar manner. We build on our previous work and utilize the fact that dense frontal and update matrices, in the multifrontal algorithm, can be represented as hierarchically off‐diagonal low‐rank matrices. Using this idea, we replace all large dense matrix operations in the multifrontal elimination process with O ( N ) hierarchically off‐diagonal low‐rank operations to arrive at a faster and more memory efficient factorization scheme. We then use this direct factorization method at low accuracies as a preconditioner and apply it to various real‐life engineering test cases. Copyright © 2016 John Wiley & Sons, Ltd.

Aminfar, AmirHossein↗
DOE OSTI2025

Robust Spectral Anomaly Detection in EELS Spectral Images via 3D Convolutional Variational Autoencoders

Abstract A 3D Convolutional Variational Autoencoder (3D‐CVAE) is introduced for automated anomaly detection in electron energy‐loss spectroscopy spectrum imaging (EELS‐SI) data. This approach leverages the full 3D structure of EELS‐SI data to detect subtle spectral anomalies while preserving both spatial and spectral correlations across the datacube. By employing cross‐entropy loss and training on bulk spectra, the model learns to reconstruct bulk features characteristic of the defect‐free material. In exploring methods for anomaly detection, both the 3D‐CVAE approach and principal component analysis (PCA) are evaluated, testing their performance using FeL‐edge ΔEpeak shifts designed to simulate material defects. These results show that 3D‐CVAE achieves superior anomaly detection and maintains consistent performance across various shift magnitudes. The method demonstrates clear bimodal separation between bulk and anomalous spectra, enabling reliable classification. Further analysis verifies that lower‐dimensional representations are robust to anomalies in the data. While performance advantages over PCA diminish with decreasing anomaly concentration, our method maintains high reconstruction quality even in challenging, noise‐dominated spectral regions. This approach provides a robust framework for unsupervised automated detection of spectral anomalies in EELS‐SI data, particularly valuable for analyzing complex material systems.

Chemistry↗
DOE OSTI2024

Robust surfactant-assisted one-pot sample preparation for label-free single-cell and nanoscale proteomics

With advanced mass spectrometry (MS)-based proteomics, genome-scale proteome coverage can be achieved from bulk cells. However, such bulk measurement obscures cell to cell heterogeneity, precluding proteome profiling of single cells and small numbers of cells of interest. To address this issue, in recent 5 years there are a surge of small sample preparation methods developed for robust effective collection and processing of single cells and small numbers of cells for in-depth MS-based proteome profiling. Based on their broad accessibility, they can be categorized into two types: specific device- and standard PCR tube- or multi-well plate-based methods. Herein we describe the detailed protocol of our recently developed, easily adoptable, Surfactant-assisted One-Pot (SOP) sample preparation coupled with MS method termed SOP-MS for label-free single-cell and nanoscale proteomics. SOP-MS capitalizes on the combination of a MS-compatible surfactant, DDM (n-Dodecyl-ß-D-maltoside), and standard low-bind PCR tube or multi-well plate for ‘all-in-one’ one-pot sample preparation without sample transfer. With its robust and convenient features, SOP-MS can be readily implemented in any MS laboratory for single-cell and nanoscale proteomics. With further improvements in MS detection sensitivity and sample throughput, we believe that SOP-MS could open an avenue for single-cell proteomics with broad applicability in the biological and biomedical research.

Single-cell proteomics, nanoscale proteomics, SOP-↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Given $\mathrm{X}\subset\mathbb{R}^n, ε \in (0,1)$, a parametrized family of probability distributions $(μ_a)_{a\in \mathrm{A}}$ on $\mathrm{Ω}\subset \mathbb{R}^p$, we consider the feasible set $\mathrm{X}^*_ε \subset\mathrm{X}$ associated with the distributionally robust chance-constraint $\mathrm{X}^*_ε = \mathrm{x \in X : Prob}_μ[f(\mathrm{x}, ω) >0] > 1 - ε, \forall μ \in \mathscr{M}_{\mathrm{a}}$}, where $\mathscr{M}_{\mathrm{a}}$ is the set of all possibles mixtures of distributions $μ_{\mathrm{a}}, \mathrm{a \in A}$. For instance and typically, the family $\mathscr{M}_{\mathrm{a}}$ is the set of all mixtures of Gaussian distributions on $\mathbb{R}$ with mean and standard deviation $\mathrm{a}=(a,σ)$ in some compact set $\mathrm{A}\subset \mathbb{R}^2$. We provide a sequence of inner approximations $\mathrm{X}^d_ε = {\mathrm{x \in X} : w_d(\mathrm{x}) < ε}, d \in \mathbb{N}$, where $w_d$ is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that $λ(\mathrm{X}^*_ε$\$\mathrm{X}^d_ε$) → 0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. Finally, there is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Adversarial classification via distributional robustness with Wasserstein ambiguity

Abstract We study a model for adversarial classification based on distributionally robust chance constraints. We show that under Wasserstein ambiguity, the model aims to minimize the conditional value-at-risk of the distance to misclassification, and we explore links to adversarial classification models proposed earlier and to maximum-margin classifiers. We also provide a reformulation of the distributionally robust model for linear classification, and show it is equivalent to minimizing a regularized ramp loss objective. Numerical experiments show that, despite the nonconvexity of this formulation, standard descent methods appear to converge to the global minimizer for this problem. Inspired by this observation, we show that, for a certain class of distributions, the only stationary point of the regularized ramp loss minimization problem is the global minimizer.

Ho-Nguyen, Nam (ORCID:0000000344647730)↗
DOE OSTI2018

Design of a Robust Digital Control System for the Rectification Column Used in the Production of Divinyl

A complex optimization criterion that takes into account the integral quadratic error and the stability margin of a robust digital control system for the rectification column used for the butylene-divinyl fraction is proposed. The influence of the weight coefficient, taking into account the ratio of the performance and stability indicators, on the dynamic characteristics of the system is investigated. High system performance and system stability indices over a sufficiently broad range of variation of the parameters of the rectification column are achieved through the use of the proposed optimization criterion and a stability estimation algorithm in the synthesis of a robust digital control system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking

In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. Finally, more importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Robust and non-fragile finite time H{sub ∞} synchronization control for complex networks with uncertain inner coupling

This paper addresses robust finite time H{sub ∞} synchronization problem for non-fragile complex networks with uncertain inner coupling. In order to achieve synchronization, a non-fragile controller subjected to randomly occurring perturbations will be considered. By constructing a suitable Lyapunov–Krasovskii functional and utilizing reciprocally convex approach, the criteria for the networks are established in terms of linear matrix inequalities (LMIs). Theoretical analysis and numerical simulations about robust finite time H{sub ∞} synchronization for uncertain inner coupling complex networks are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust deep learning framework for constitutive relations modeling

Modeling the full-range deformation behaviors of materials under complex loading and materials conditions is a significant challenge for constitutive relations (CRs) modeling. Here, we propose a general encoder-decoder deep learning framework that can model high-dimensional stress-strain data and complex loading histories with robustness and universal capability. The framework employs an encoder to project high-dimensional input information (e.g., loading history, loading conditions, and materials information) to a lower-dimensional hidden space and a decoder to map the hidden representation to the stress of interest. We evaluated various encoder architectures, including gated recurrent unit (GRU), GRU with attention, temporal convolutional network (TCN), and the Transformer encoder, on two complex stress-strain datasets that were designed to include a wide range of complex loading histories and loading conditions. All architectures achieved excellent test results with an root-mean-square error (RMSE) below 1 MPa. Additionally, we analyzed the capability of the different architectures to make predictions on out-of-domain applications, with an uncertainty estimation based on deep ensembles. The proposed approach provides a robust alternative to empirical/semi-empirical models for CRs modeling, offering the potential for more accurate and efficient materials design and optimization.

36 MATERIALS SCIENCE↗