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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗

DOE OSTI2022

Optimizing Error-Bounded Lossy Compression for Scientific Data With Diverse Constraints

Vast volumes of data are produced by today's scientific simulations and advanced instruments. These data cannot be stored and transferred efficiently because of limited I/O bandwidth, network speed, and storage capacity. Error-bounded lossy compression can be an effective method for addressing these issues: not only can it significantly reduce data size, but it can also control the data distortion based on user-defined error bounds. In practice, many scientific applications have specific requirements or constraints for lossy compression, in order to guarantee that the reconstructed data are valid for post hoc analysis. For example, some datasets contain irrelevant data that should be isolated in particular and users often have intuition regarding value ranges, geospatial regions, and other data subsets that are crucial for subsequent analysis. Existing state-of-the-art error-bounded lossy compressors, however, do not consider these constraints during compression, resulting in inferior compression ratios with respect to user's post hoc analysis, due to the fact that the data itself provides little or no value for post hoc analysis. In this work we address this issue by proposing an optimized framework that can preserve diverse constraints during the error-bounded lossy compression, e.g., cleaning the irrelevant data, efficiently preserving different precision for multiple value intervals, and allowing users to set diverse precision over both regular and irregular regions. We perform our evaluation on a supercomputer with up to 2,100 cores. Experiments with six real-world applications show that our proposed diverse constraints based error-bounded lossy compressor can obtain a higher visual quality or data fidelity on reconstructed data with the same or even higher compression ratios compared with the traditional state-of-the-art compressor SZ. Furthermore, our experiments also demonstrate very good scalability in compression performance compared with the I/O throughput of the parallel file system.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗

DOE OSTI2025

A Survey on Error-Bounded Lossy Compression for Scientific Datasets

Error-bounded lossy compression has been effective in significantly reducing the data storage/transfer burden while preserving the reconstructed data fidelity very well. Many error-bounded lossy compressors have been developed for a wide range of parallel and distributed use cases for years. They are designed with distinct compression models and principles, such that each of them features particular pros and cons. In this article, we provide a comprehensive survey of emerging error-bounded lossy compression techniques. The key contribution is fourfold. (1) We summarize a novel taxonomy of lossy compression into six classic models. (2) We provide a comprehensive survey of 10 commonly used compression components/modules. (3) We summarized pros and cons of 47 state-of-the-art lossy compressors and present how state-of-the-art compressors are designed based on different compression techniques. (4) We discuss how customized compressors are designed for specific scientific applications and use-cases. We believe this survey is useful to multiple communities including scientific applications, high-performance computing, lossy compression, and big data.

Error-Bounded Lossy Compression↗

DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Uranium and Nickel Partitioning in a Contaminated Riparian Wetland

Uranium (U) and nickel (Ni) released 50 years ago have been immobilized in the Tims Branch wetlands located on the Savannah River Site in the United States. Sediments were collected from seven locations to identify the factors responsible for this attenuation. Ni and U contents in the solids were significantly correlated, suggesting that depositional as opposed to chemical processes contributed to their spatial distribution. Based on sequential extractions, 63 ± 16% of the U was partitioned into the organic fraction, whereas Ni was distributed between several sediment fractions. An inverse pH-organic matter (OM) correlation and positive correlations of OM with total U and organic-bound U/Ni suggest that increased OM preservation and binding to the mineral surfaces were likely responsible for Ni- and especially U-sediment retention (Tims Branch pH = 4.84 ± 0.68). EXAFS analysis indicated the predominance of U(VI) coordinated with clay minerals (~65%), together with ~35% coordinated to either OM (in areas with elevated OM levels) or iron oxides. The desorption-Kd coefficients of U (3972 ± 1370 L/kg) and Ni (30 ± 8 L/kg) indicate that dissolved Ni poses a greater long-term risk than dissolved U for migrating downstream. This study suggests that a delicate balance of geochemical properties controls whether wetlands behave as sinks or sources of contaminants.

63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗

DOE OSTI2026

Bound states of Ω baryons in light nuclei

Here, we investigate bound states of light Ω 3⁢𝑥 clusters (𝑥=𝑠,𝑐), motivated by the Ω 3⁢𝑠 ⁢𝑁 potential recently developed by the HAL QCD collaboration. To regularize this potential, we remove the deeply attractive core at 𝑟 < 0.4 fm and parametrize the long-range component (𝑟 > 0.4 fm) using a two-range Gaussian form. This procedure preserves the relevant two-body bound-state energy while having a negligible effect on the Ω 3⁢𝑠⁢ 𝑁⁢𝑁 and Ω 3⁢𝑠⁢ Ω 3⁢𝑠 ⁢𝑁 systems. An effective Ω 3⁢𝑠 ⁢𝛼 potential is then constructed by fitting a two-range Gaussian function to the long-range component of the folding potential, enabling calculations of the bound-state energies of the Ω 3⁢𝑠⁢ 𝛼, Ω 3⁢𝑠⁢ 𝛼⁢𝛼, and Ω 3⁢𝑠 ⁢Ω 3⁢𝑠 ⁢𝛼 systems. The regularization procedure leads to a substantial reduction in bound-state energies compared to those obtained with the original potential. We further extend the analysis to Ω 3⁢𝑐 -cluster systems by introducing an Ω 3⁢𝑐 ⁢𝑁 interaction, derived by comparing the existing Ω 3⁢𝑠⁢ Ω 3⁢𝑠 and Ω 3⁢𝑐 ⁢Ω 3⁢𝑐 potentials. Our results suggest that several parametrizations predict bound states in Ω 3⁢𝑐 -containing clusters. Finally, the Ω 3⁢𝑠 ⁢Ω 3⁢𝑠 interaction is described using a contactlike potential approach, motivated by the effective field theory.

binding energy & masses↗

DOE OSTI2025

MetaHeuristic Feature Selection for Energy Group Optimization and Analysis

Energy discretization is a crucial component of deterministic neutron transport simulations. Metaheuristic (MH) optimizers are effective algorithms to determine group structures that maximize both solution accuracy and computational efficiency. This project establishes a framework for optimizing group structures for PARTISN simulations using the Python library MEALPY. Group structure optimization is formulated as a binary feature selection problem, and results are investigated with permutation and material importance techniques to determine physically relevant energy bounds. We conclude that MH optimizers find group structures that drastically improve flux calculations while preserving k-effective accuracy. Further, we find that individual energy bounds are not necessarily physically relevant, but rather specific energy ranges are.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

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↗

DOE OSTI2025

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↗

NASA NTRS2001

Driving Parameters for Distributed and Centralized Air Transportation Architectures

This report considers the problem of intersecting aircraft flows under decentralized conflict avoidance rules. Using an Eulerian standpoint (aircraft flow through a fixed control volume), new air traffic control models and scenarios are defined that enable the study of long-term airspace stability problems. Considering a class of two intersecting aircraft flows, it is shown that airspace stability, defined both in terms of safety and performance, is preserved under decentralized conflict resolution algorithms. Performance bounds are derived for the aircraft flow problem under different maneuver models. Besides analytical approaches, numerical examples are presented to test the theoretical results, as well as to generate some insight about the structure of the traffic flow after resolution. Considering more than two intersecting aircraft flows, simulations indicate that flow stability may not be guaranteed under simple conflict avoidance rules. Finally, a comparison is made with centralized strategies to conflict resolution.

Feron, Eric↗

DOE OSTI2024

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↗

NASA NTRS1992

Lazy checkpoint coordination for bounding rollback propagation

Independent checkpointing allows maximum process autonomy but suffers from potential domino effects. Coordinated checkpointing eliminates the domino effect by sacrificing a certain degree of process autonomy. In this paper, we propose the technique of lazy checkpoint coordination which preserves process autonomy while employing communication-induced checkpoint coordination for bounding rollback propagation. The introduction of the notion of laziness allows a flexible trade-off between the cost for checkpoint coordination and the average rollback distance. Worst-case overhead analysis provides a means for estimating the extra checkpoint overhead. Communication trace-driven simulation for several parallel programs is used to evaluate the benefits of the proposed scheme for real applications.

Wang, Yi-Min↗

NASA NTRS1993

Lazy checkpoint coordination for bounding rollback propagation

Wang, Yi-Min↗

NASA NTRS1991

New bounds on parameter uncertainties for robust stability

The problem of robust stability in linear systems with parametric uncertainties is considered. A method is developed to determine bounds on uncertain parameters in the state-space model of the system, so that stability is preserved. Both continuous- and discrete-time systems are considered. Unlike previous results, the stability bounds are derived in terms of actual parameters instead of their absolute values, and consequently the stable region in the parameter space is not necessarily symmetric with respect to the origin. Furthermore, the uncertain parameters do not have to be linearly independent to each other.

Gao, Zhiqiang↗

DOE OSTI2025

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↗

DOE OSTI2022

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↗

NASA NTRS1999

The Reconstruction Problem Revisited

The role of reconstruction in avoiding oscillations in upwind schemes is reexamined, with the aim of providing simple, concise proofs. In one dimension, it is shown that if the reconstruction is any arbitrary function bounded by neighboring cell averages and increasing within a cell for increasing data, the resulting scheme is monotonicity preserving, even though the reconstructed function may have overshoots and undershoots at the cell edges and is in general not a monotone function. In the special case of linear reconstruction, it is shown that merely bounding the reconstruction between neighboring cell averages is sufficient to obtain a monotonicity preservinc,y scheme. In two dimensions, it is shown that some ID TVD limiters applied in each direction result in schemes that are not positivity preserving, i.e. do not give positive updates when the data are positive. A simple proof is given to show that if the reconstruction inside the cell is bounded by the neighboring cell averages (including corner neighbors), then the scheme is positivity preserving. A new limiter that enforces this condition but is not as dissipative as the Minmod limiter is also presented.

Suresh, Ambaby↗