Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “bounds preservation”

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 55 records · Page 3

Duality and supersymmetry constraints on the weak gravity conjecture

Positivity bounds coming from consistency of UV scattering amplitudes are not always sufficient to prove the weak gravity conjecture for theories beyond Einstein-Maxwell. Additional ingredients about the UV may be necessary to exclude those regions of parameter space which are naïvely in conflict with the predictions of the weak gravity conjecture. In this paper we explore the consequences of imposing additional symmetries inherited from the UV theory on higher-derivative operators for Einstein-Maxwell-dilaton-axion theory. Using black hole thermodynamics, for a preserved SL(2, $\mathbb{R}$) symmetry we find that the weak gravity conjecture then does follow from positivity bounds. For a preserved O(d, d; $\mathbb{R}$) symmetry we find a simple condition on the two Wilson coefficients which ensures the positivity of corrections to the charge-to-mass ratio and that follows from the null energy condition alone. We find that imposing supersymmetry on top of either of these symmetries gives corrections which vanish identically, as expected for BPS states.

79 ASTRONOMY AND ASTROPHYSICS↗

Fouling behavior of zwitterionic membranes compared to polyamide membranes

Membrane fouling remains a critical bottleneck for reverse osmosis (RO) desalination, driving energy consumption and reducing membrane lifetime. Here, we employ all-atom molecular dynamics simulations to investigate the antifouling behavior of random zwitterionic amphiphilic copolymer (r-ZAC) membranes composed of sulfobetaine methacrylate (SBMA) and allyl methacrylate (AMA), benchmarked against conventional polyamide (PA) RO membranes. Structural and dynamical analyses—including radial distribution functions, coordination numbers, tetrahedral order parameters, vector orientation, and residence-time correlation functions—reveal that r-ZAC surfaces sustain tightly bound, long-lived hydration layers with preserved tetrahedrality and anisotropic water orientation, in sharp contrast to the weak and disordered hydration of PA. Steered molecular dynamics simulations demonstrate that r-ZAC membranes impose substantial free-energy barriers to foulant approach (alginate ≈ 90 kcal/mol, sucrose ≈ 35 kcal/mol, humic acid ≈ 15 kcal/mol), whereas PA membranes exhibit negligible barriers (< 1 kcal/mol) and thermodynamically favorable adsorption. Detailed foulant–surface interaction analyses show that zwitterionic hydration and electrostatic heterogeneity in r-ZAC suppress adhesion, except in the case of amphiphilic humic acid, which exploits multiple binding modes. Together, these results establish molecular-level design principles for antifouling membranes: the combination of zwitterionic hydration, structured interfacial water, and controlled amphiphilic balance in r-ZAC membranes provides superior resistance to organic fouling relative to PA.

Cross-linked polyamide↗

Possible Spin-Triplet Excitonic Insulator in the Ultraquantum Limit of HfTe 5

More than 50 years ago, excitonic insulators formed by the pairing of electrons and holes due to Coulomb interactions were first predicted [A. N. Kozlov and L. A. Maksimov, Sov. J. Exp. Theor. Phys. 21, 790 (1965); L. V. Keldysh and Y. V. Kopaev, Sov. Phys. Solid State 6, 2219 (1965); D. Jérome, T. M. Rice, and W. Kohn, Phys. Rev. 158, 462 (1967)]. Since then, excitonic insulators have been observed in various classes of materials, including quantum Hall bilayers, graphite, transition metal chalcogenides, and more recently in moiré superlattices. In these excitonic insulators, an electron and a hole with the same spin bind together, and the resulting exciton is a spin singlet. Here, we report the experimental observation of a spin-triplet excitonic insulator in the ultra-quantum limit of a three-dimensional topological material HfTe 5 . We observe that the spin-polarized zeroth Landau bands dispersing along the field direction cross each other beyond a characteristic magnetic field in HfTe 5 , forming the one-dimensional Weyl mode. Transport measurements reveal the emergence of a gap of about 2⁢5⁢0 μ⁢eV when the field surpasses a critical threshold. By performing the material-specific modeling, we identify this gap as a consequence of a spin-triplet exciton formation, where electrons and holes with opposite spin form bound states, and the translational symmetry is preserved. The system reaches charge neutrality following the gap opening, as evidenced by the zero Hall conductivity over a wide magnetic field range (10–72 T). In conclusion, our finding of the spin-triplet excitonic insulator paves the way for studying novel spin transport including spin superfluidity, spin Josephson currents, and Coulomb drag of spin currents in analogy to the transport properties associated with the layer pseudospin in quantum Hall bilayers.

36 MATERIALS SCIENCE↗

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

Optimization-based, property-preserving algorithm for passive tracer transport

Here we present a new optimization-based property-preserving algorithm for passive tracer transport. The algorithm utilizes a semi-Lagrangian approach based on incremental remapping of the mass and the total tracer. However, unlike traditional semi-Lagrangian schemes, which remap the density and the tracer mixing ratio through monotone reconstruction or flux correction, we utilize an optimization-based remapping that enforces conservation and local bounds as optimization constraints. In so doing we separate accuracy considerations from preservation of physical properties to obtain a conservative, second-order accurate transport scheme that also has a notion of optimality. Moreover, we prove that the optimization-based algorithm preserves linear relationships between tracer mixing ratios. We illustrate the properties of the new algorithm using a series of standard tracer transport test problems in a plane and on a sphere.

97 MATHEMATICS AND COMPUTING↗

Leveraging Free Volume Manipulation to Improve the Membrane Separation Performance of Amine‐Functionalized PIM‐1

Abstract Gas‐separation polymer membranes display a characteristic permeability–selectivity trade‐off that has limited their industrial use. The most comprehensive approach to improving performance is to devise strategies that simultaneously increase fractional free volume, narrow free volume distribution, and enhance sorption selectivity, but generalizable methods for such approaches are exceedingly rare. Here, we present an in situ crosslinking and solid‐state deprotection method to access previously inaccessible sorption and diffusion characteristics in amine‐functionalized polymers of intrinsic microporosity. Free volume element (FVE) size can be increased while preserving a narrow FVE distribution, enabling below‐upper bound polymers to surpass the H 2 /N 2 , H 2 /CH 4 , and O 2 /N 2 upper bounds and improving CO 2 ‐based selectivities by 200 %. This approach can transform polymers into chemical analogues with improved performance, thereby overcoming traditional permeability–selectivity trade‐offs.

Mizrahi Rodriguez, Katherine↗

Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels

We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of tripartite quantum channels. Since the receivers are constrained by causal ordering, additional temporal relationships naturally emerge between the parties. These causal constraints enforce intrinsic no-signalling conditions on any tripartite operation, ensuring that it constitutes a physically realizable quantum code for a quantum broadcast channel. We analyze these constraints and, more broadly, characterize the most general quantum codes for communication over such channels. We examine the capabilities of codes that are fully no-signalling among the three parties, positive partial transpose (PPT)-preserving, or both, and derive simple semidefinite programs to compute the achievable entanglement fidelity. We then establish a hierarchy of semidefinite programming converse bounds -- both weak and strong -- for the capacity of quantum broadcast channels for EPR pair generation, in both one-shot and asymptotic regimes. Notably, in the special case of a point-to-point channel, our strong converse bound recovers and strengthens existing results. Finally, we demonstrate how the PPT-preserving codes we develop can be leveraged to construct PPT-preserving entanglement combing schemes, and vice versa.

FOS: Physical sciences↗

A Converse to Lieb–Robinson Bounds in One Dimension Using Index Theory

Abstract Unitary dynamics with a strict causal cone (or “light cone”) have been studied extensively, under the name of quantum cellular automata (QCAs). In particular, QCAs in one dimension have been completely classified by an index theory. Physical systems often exhibit only approximate causal cones; Hamiltonian evolutions on the lattice satisfy Lieb–Robinson bounds rather than strict locality. This motivates us to study approximately locality preserving unitaries (ALPUs). We show that the index theory is robust and completely extends to one-dimensional ALPUs. As a consequence, we achieve a converse to the Lieb–Robinson bounds: any ALPU of index zero can be exactly generated by some time-dependent, quasi-local Hamiltonian in constant time. For the special case of finite chains with open boundaries, any unitary satisfying the Lieb–Robinson bound may be generated by such a Hamiltonian. We also discuss some results on the stability of operator algebras which may be of independent interest.

Physics↗

Region-adaptive, Error-controlled Scientific Data Compression using Multilevel Decomposition

The increase of computer processing speed is significantly outpacing improvements in network and storage bandwidth, leading to the big data challenge in modern science, where scientific applications can quickly generate much more data than that can be transferred and stored. As a result, big scientific data must be reduced by a few orders of magnitude while the accuracy of the reduced data needs to be guaranteed for further scientific explorations. Moreover, scientists are often interested in some specific spatial/temporal regions in their data, where higher accuracy is required. The locations of the regions requiring high accuracy can sometimes be prescribed based on application knowledge, while other times they must be estimated based on general spatial/temporal variation. In this paper, we develop a novel multilevel approach which allows users to impose region-wise compression error bounds. Our method utilizes the byproduct of a multilevel compressor to detect regions where details are rich and we provide the theoretical underpinning for region-wise error control. With spatially varying precision preservation, our approach can achieve significantly higher compression ratios than single-error bounded compression approaches and control errors in the regions of interest.We conduct the evaluations on two climate use cases – one targeting small-scale, node features and the other focusing on long, areal features. For both use cases, the locations of the features were unknown ahead of the compression. By selecting approximately 16% of the data based on multi-scale spatial variations and compressing those regions with smaller error tolerances than the rest, our approach improves the accuracy of post-analysis by approximately 2 × compared to single-error-bounded compression at the same compression ratio. Using the same error bound for the region of interest, our approach can achieve an increase of more than 50% in overall compression ratio.

Gong, Qian↗

Architecture-Preserving Provable Repair of Deep Neural Networks

Deep neural networks (DNNs) are becoming increasingly important components of software, and are considered the state-of-the-art solution for a number of problems, such as image recognition. However, DNNs are far from infallible, and incorrect behavior of DNNs can have disastrous real-world consequences. This paper addresses the problem of architecture-preserving V-polytope provable repair of DNNs. A V-polytope defines a convex bounded polytope using its vertex representation. V-polytope provable repair guarantees that the repaired DNN satisfies the given specification on the infinite set of points in the given V-polytope. An architecture-preserving repair only modifies the parameters of the DNN, without modifying its architecture. The repair has the flexibility to modify multiple layers of the DNN, and runs in polynomial time. It supports DNNs with activation functions that have some linear pieces, as well as fully-connected, convolutional, pooling and residual layers. To the best our knowledge, this is the first provable repair approach that has all of these features. We implement our approach in a tool called APRNN. Using MNIST, ImageNet, and ACAS Xu DNNs, we show that it has better efficiency, scalability, and generalization compared to PRDNN and REASSURE, prior provable repair methods that are not architecture preserving.

97 MATHEMATICS AND COMPUTING↗

Towards Resilient Design of Leader-following Consensus with Attack Identification and Privacy Preservation Capabilities

This paper considers a leader-following consensus in the presence of unknown but bounded cyber-attacks. Specifically, we consider the following cyber-attack scenarios: (i) an attacker aims to destabilize the consensus dynamics by injecting exogenous signals to both the actuators of the followers and/or the communication network, (ii) an eavesdropper adversary aims to obtain information on the physical state of the agents. To this end, a novel resilient leader-following consensus algorithm based on a competitive interaction method is proposed. In addition, it is demonstrated that by appropriately choosing the information exchanged between the agents, the proposed control framework also enables the cooperative system to either distributively identify the compromised communication links in real-time or to protect the privacy of the physical state of the agents from the eavesdropper. Here, a numerical example is provided to illustrate the proposed resilient control algorithms.

Gusrialdi, Azwirman↗

The Gross-Neveu-Yukawa archipelago

We perform a bootstrap analysis of a mixed system of four-point functions of bosonic and fermionic operators in parity-preserving 3d CFTs with O(N) global symmetry. Our results provide rigorous bounds on the scaling dimensions of the O(N)-symmetric Gross-Neveu-Yukawa (GNY) fixed points, constraining these theories to live in isolated islands in the space of CFT data. We focus on the cases N = 1, 2, 4, 8, which have applications to phase transitions in condensed matter systems, and compare our bounds to previous analytical and numerical results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Feature learning and generalization in deep networks with orthogonal weights

Fully-connected deep neural networks with weights initialized from independent Gaussian distributions can be tuned to criticality, which prevents the exponential growth or decay of signals propagating through the network. However, such networks still exhibit fluctuations that grow linearly with the depth of the network, which may impair the training of networks with width comparable to depth. We show analytically that rectangular networks with tanh activations and weights initialized from the ensemble of orthogonal matrices have corresponding preactivation fluctuations which are independent of depth, to leading order in inverse width. Moreover, we demonstrate numerically that, at initialization, all correlators involving the neural tangent kernel (NTK) and its descendants at leading order in inverse width—which govern the evolution of observables during training—saturate at a depth of ~20, rather than growing without bound as in the case of Gaussian initializations. We speculate that this structure preserves finite-width feature learning while reducing overall noise, thus improving both generalization and training speed in deep networks with depth comparable to width. We provide some experimental justification by relating empirical measurements of the NTK to the superior performance of deep non-linear orthogonal networks trained under full-batch gradient descent on the MNIST and CIFAR-10 classification tasks.

97 MATHEMATICS AND COMPUTING↗

Sign changing pairing in single layer FeSe/SrTiO3 revealed by nonmagnetic impurity bound states

Abstract The discovery of high-temperature superconductivity in single layer FeSe epitaxially grown on SrTiO 3 (001) substrates has instigated extensive debate over whether its pairing symmetry is conventional sign-preserving s -wave or unconventional sign-changing. Here, we probe the pairing state for single layer FeSe/SrTiO 3 grown by molecular beam epitaxy using scanning tunneling microscopy/spectroscopy. We observe robust in-gap bound states induced by non-magnetic Fe-vacancy defects within the Fe-plane, which exhibit strong spatial electron-hole asymmetry with two-fold symmetry in hole states and four-fold in electron states. The bound states exhibit no energy shift or splitting under an applied magnetic field, consistent with a sign-changing order parameter. This is further confirmed by defect bound state quasiparticle interference that shows a sign-changing behavior with a pair of corresponding peaks at the positive and negative energies near the impurity bound states. Our findings provide unambiguous evidence for a sign-changing pairing symmetry for single layer FeSe/SrTiO 3 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Signatures of a spin-active interface and a locally enhanced Zeeman field in a superconductor-chiral material heterostructure

A localized Zeeman field, intensified at heterostructure interfaces, could play a crucial role in a broad area including spintronics and unconventional superconductors. Conventionally, the generation of a local Zeeman field is achieved through magnetic exchange coupling with a magnetic material. However, magnetic elements often introduce defects, which could weaken or destroy superconductivity. Alternatively, the coupling between a superconductor with strong spin-orbit coupling and a nonmagnetic chiral material could serve as a promising approach to generate a spin-active interface. Here, we leverage an interface superconductor, namely, induced superconductivity in noble metal surface states, to probe the spin-active interface. Our results unveil an enhanced interface Zeeman field, which selectively closes the surface superconducting gap while preserving the bulk superconducting pairing. The chiral material, i.e., trigonal tellurium, also induces Andreev bound states (ABS) exhibiting spin polarization. The field dependence of ABS manifests a substantially enhanced interface Landég-factor (g eff ~ 12), thereby corroborating the enhanced interface Zeeman energy.

Science & Technology - Other Topics↗

Scalable Hybrid Learning Techniques for Scientific Data Compression

Data compression is becoming critical for storing scientific data because many scientific applications need to store large amounts of data and post process this data for scientific discovery. Unlike image and video compression algorithms that limit errors to primary data (PD), scientists require compression techniques that accurately preserve derived quantities of interest (QoIs). Here, this article presents a physics-informed compression technique implemented as an end-to-end, scalable, GPU-based pipeline for data compression that addresses this requirement. Our hybrid compression technique combines machine learning techniques and standard compression methods. Specifically, we combine an autoencoder, an error-bounded lossy compressor to provide guarantees on raw data error, and a constraint satisfaction post-processing step to preserve the QoIs within a minimal error (generally less than floating point error). The effectiveness of the data compression pipeline is demonstrated by compressing nuclear fusion simulation data generated by a large-scale fusion code, XGC, which produces hundreds of terabytes of data in a single day. Our approach works within the ADIOS framework and results in compression by a factor of more than 150 while requiring only a few percent of the computational resources necessary for generating the data, making the overall approach highly effective for practical scenarios.

ITER↗

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗