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 577 records · Page 32

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↗

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↗

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↗

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-↗

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↗

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↗

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)↗

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 ↗

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↗

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↗

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↗

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↗

Quantum theory as a description of robust experiments: Derivation of the Pauli equation

It is shown that the Pauli equation and the concept of spin naturally emerge from logical inference applied to experiments on a charged particle under the conditions that (i) space is homogeneous (ii) the observed events are logically independent, and (iii) the observed frequency distributions are robust with respect to small changes in the conditions under which the experiment is carried out. The derivation does not take recourse to concepts of quantum theory and is based on the same principles which have already been shown to lead to e.g. the Schrödinger equation and the probability distributions of pairs of particles in the singlet or triplet state. Application to Stern–Gerlach experiments with chargeless, magnetic particles, provides additional support for the thesis that quantum theory follows from logical inference applied to a well-defined class of experiments. - Highlights: • The Pauli equation is obtained through logical inference applied to robust experiments on a charged particle. • The concept of spin appears as an inference resulting from the treatment of two-valued data. • The same reasoning yields the quantum theoretical description of neutral magnetic particles. • Logical inference provides a framework to establish a bridge between objective knowledge gathered through experiments and their description in terms of concepts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Incorporate day-ahead robustness and real-time incentives for electricity market design

In this paper, we propose a two-stage electricity market framework to explore the participation of distributed energy resources (DERs) in a day-ahead (DA) market and a real-time (RT) market. The objective is to determine the optimal bidding strategies of the aggregated DERs in the DA market and generate online incentive signals for DER-owners to optimize the social-welfare taking into account network operational constraints. Distributionally robust optimization is used to explicitly incorporate data-based statistical information of renewable forecasts into the supply/demand decisions in the DA market. We evaluate the conservativeness of bidding strategies distinguished by different risk aversion settings. In the RT market, a bi-level time-varying optimization problem is proposed to design the online incentive signals to tradeoff the RT imbalance penalty for distribution system operators (DSOs) and the costs of individual DER-owners. This enables tracking their optimal dispatch to provide fast balancing services, in the presence of time-varying network states while satisfying the voltage regulation requirement. Simulation results on both DA wholesale market and RT balancing market demonstrate the necessity of this two-stage design, and its robustness to uncertainties, the performance of convergence, the tracking ability and the feasibility of the resulting network operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Tailoring Microbial Fitness Through Computational Steering and CRISPRi-Driven Robustness Regulation

The widespread application of genetically modified microorganisms (GMMs) across diverse sectors underscores the pressing need for robust strategies to mitigate the risks associated with their potential uncontrolled escape. This study merges computational modeling with CRISPR interference (CRISPRi) to refine GMM metabolic robustness. Utilizing ensemble modeling, we achieved high-throughput in silico screening for enzymatic targets susceptible to expression alterations. Translating these insights, we developed functional CRISPRi, boosting fitness control via multiplexed gene knockdown. Our method, enhanced by an insulator-improved gRNA structure and an off-switch circuit controlling a compact Cas12m, resulted in rationally engineered strains with escape frequencies below National Institutes of Health standards. The effectiveness of this approach was confirmed under various conditions, showcasing its ability for secure GMM management. This research underscores the resilience of microbial metabolism, strategically modifying key nodes to halt growth without provoking significant resistance, thereby enabling more reliable and precise GMM control. A record of this paper's transparent peer review process is included in the supplemental information.

59 BASIC BIOLOGICAL SCIENCES↗

Robustness of cement-based materials: From dosage variations to yield stress fluctuations

The idea behind the present work is to assess robustness of fresh cement-based materials (i.e. their ability to display the same properties when submitted to variations in the way they are produced) from a generic and analytical point of view. First, analytical models from literature relating components proportions and yield stress are combined into a multi-scale and physical approach and compared to our experimental yield stress measurements. In the second part, the derivation of these analytical relationships is used to assess robustness as a function of components proportions, which allows for the most sensitive variations to be mapped onto component dosage from a yield stress point of view. In the case of fluid concretes, this approach showcases the interest of working at slightly higher water content and slightly lower aggregates fraction along with benefits of viscosity modifying agents / plasticizers combination.

36 MATERIALS SCIENCE↗

Radiation Controllable Synthesis of Robust Covalent Organic Framework Conjugates for Efficient Dynamic Column Extraction of 99 TcO4 -

Wang et al. report here an ultra-robust imidazolium-decorated covalent organic framework (COF) conjugate fabricated by an ionizing radiation strategy for efficient capture of 99 TcO 4 -, where tunable ReO 4 - uptake up to 952 mg g -1 can be achieved by simply adjusting the γ-ray dose. The COFs feature high porosity, ultra-robust nanofiber structure, and fast adsorption kinetics, thus emphasizing their advantages in terms of column experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Python Materials Genomics (pymatgen): A robust, open-source python library for materials analysis

We present the Python Materials Genomics (pymatgen) library, a robust, open-source Python library for materials analysis. A key enabler in high-throughput computational materials science efforts is a robust set of software tools to perform initial setup for the calculations (e.g., generation of structures and necessary input files) and post-calculation analysis to derive useful material properties from raw calculated data. The pymatgen library aims to meet these needs by (1) defining core Python objects for materials data representation, (2) providing a well-tested set of structure and thermodynamic analyses relevant to many applications, and (3) establishing an open platform for researchers to collaboratively develop sophisticated analyses of materials data obtained both from first principles calculations and experiments. The pymatgen library also provides convenient tools to obtain useful materials data via the Materials Project's REpresentational State Transfer (REST) Application Programming Interface (API). As an example, using pymatgen's interface to the Materials Project's RESTful API and phasediagram package, we demonstrate how the phase and electrochemical stability of a recently synthesized material, Li 4 SnS 4 , can be analyzed using a minimum of computing resources. Here, we find that Li 4 SnS 4 is a stable phase in the Li-Sn-S phase diagram (consistent with the fact that it can be synthesized), but the narrow range of lithium chemical potentials for which it is predicted to be stable would suggest that it is not intrinsically stable against typical electrodes used in lithium-ion batteries.

36 MATERIALS SCIENCE↗