Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Correctness proofs”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Multifidelity Approach to Sensitivity Estimation in Large-Eddy Simulation

A novel approach to compute affordable approximate sensitivities in a large-eddy simulation (LES) is proposed and assessed. The approach is based on solving a Reynolds-averaged Navier–Stokes (RANS) problem that has been linearized around the mean LES solution, with closure modeling required for the linearized changes in turbulent Reynolds stresses. In the present study, the closure modeling is based on a linearized algebraic turbulence model. The method is assessed for the flow over a NACA0012 airfoil at a fixed angle of attack, with the Reynolds number as the variable parameter. The results show that, provided an accurate linearized closure model, the method predicts the correct sensitivity of the skin friction coefficient and the mean velocity field at the cost of a linearized RANS, which provides an important proof-of-concept for this approach. Here, the linearized algebraic turbulence model with standard model coefficients produces a reasonably accurate sensitivity, but the results also suggest that accuracy could be gained from recalibrating the model coefficients for this new use of the model.

42 ENGINEERING↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

LoTToR: An Algorithm for Missing-Wedge Correction of the Low-Tilt Tomographic 3D Reconstruction of a Single-Molecule Structure (LoTToR) v1.0

The low-tilt tomographic reconstruction (LoTToR) method is a post-processing method to correct the missing-wedge artifact, which contains a model-free iteration process under a set of constraints in real and reciprocal spaces. A proof of concept is conducted by using the LoTToR on a phantom, i.e., a simulated 3D reconstruction from a low-tilt series of images, including that within a tilt range of ±15°. The method is validated by using both negative-staining (NS) and cryo-electron tomography (cryo-ET) experimental data. A significantly reduced missing-wedge artifact verifies the capability of LoTToR, suggesting a new tool to support the future study of macromolecular dynamics, fluctuation and chemical activity from the viewpoint of single-molecule 3D structure determination. Moreover, the software can be used for hospital computer tomography (CT) to reduce the radiation damage to patients without reducing the CT image quality.

Ren, Gang↗
DOE OSTI2022

Factorization for azimuthal asymmetries in SIDIS at next-to-leading power

Differential measurements of the semi-inclusive deep inelastic scattering (SIDIS) process with polarized beams provide important information on the three-dimensional structure of hadrons. Among the various observables are azimuthal asymmetries that start at subleading power, and which give access to novel transverse momentum dependent distributions (TMDs). Theoretical predictions for these distributions are currently based on the parton model rather than a rigorous factorization based analysis. Working under the assumption that leading power Glauber interactions do not spoil factorization at this order, we use the Soft Collinear Effective Theory to derive a complete factorization formula for power suppressed hard scattering effects in SIDIS. This yields generalized definitions of the TMDs that depend on two longitudinal momentum fractions (one of them only relevant beyond tree level), and a complete proof that only the same leading power soft function appears and can be absorbed into the TMD distributions at this order. We also show that perturbative corrections can be accounted for with only one new hard coefficient. Factorization formulae are given for all spin dependent structure functions which start at next-to-leading power. Prospects for improved subleading power predictions that include resummation are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

A positivity-preserving and conservative intersection-distribution-based remapping algorithm for staggered ALE hydrodynamics on arbitrary meshes

In this study, we introduce new intersection-distribution-based remapping tools for indirect staggered arbitrary Lagrangian-Eulerian (ALE) simulations of multi-material shock hydrodynamics on arbitrary meshes. In addition to conserving momentum and total energy, the three-stage remapper proposed in this work preserves non-negativity of the internal energy. At the first stage, we construct slope-limited piecewise-linear reconstructions of all conserved quantities on zones of the source mesh and perform intersection-based remap to obtain bound-preserving zonal quantities on the target mesh. At the second stage, we define bound-preserving nodal quantities of the staggered ALE discretization as convex combinations of corner quantities. The nodal internal energy is corrected in a way which keeps it non-negative, while providing exact conservation of total energy. At the final stage, we distribute the non-negative nodal internal energy to corners, zones and materials using non-negative weights. Proofs of positivity preservation are provided for each stage. This work is a natural extension of our paper [14] in which a similar intersection-distribution-based remapping procedure was employed. The original version used a nodal kinetic energy fix which did not provably ensure positivity preservation for the zonal internal energy after the final distribution stage. The new algorithm cures this potential drawback by using ‘coordinated’ limiters for piecewise-linear reconstructions, remapping the internal energy to nodes and correcting it before redistribution. The effectiveness of the new nodal fix is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scintillation and cherenkov photon counting detectors with analog silicon photomultipliers for TOF-PET

Objective. Standard signal processing approaches for scintillation detectors in positron emission tomography (PET) derive accurate estimates for 511 keV photon time of interaction and energy imparted to the detection media from aggregate characteristics of electronic pulse shapes. The ultimate realization of a scintillation detector for PET is one that provides a unique timestamp and position for each detected scintillation photon. Detectors with these capabilities enable advanced concepts for three-dimensional (3D) position and time of interaction estimation with methods that exploit the spatiotemporal arrival time kinetics of individual scintillation photons. Approach. In this work, we show that taking into consideration the temporal photon emission density of a scintillator, the channel density of an analog silicon photomultiplier (SiPM) array, and employing fast electronic readout with digital signal processing, a detector that counts and timestamps scintillation photons can be realized. To demonstrate this approach, a prototype detector was constructed, comprising multichannel electronic readout for a bismuth germanate (BGO) scintillator coupled to an SiPM array. Main Results. In proof-of-concept measurements with this detector, we were able to count and provide unique timestamps for 66% of all optical photons, where the remaining 34% (two-or-more-photon pulses) are also independently counted, but each photon bunch shares a common timestamp. We show this detector concept can implement 3D positioning of 511 keV photon interactions and thereby enable corrections for time of interaction estimators. The detector achieved 17.6% energy resolution at 511 keV and 237 ± 10 ps full-width-at-half-maximum coincidence time resolution (CTR) (fast spectral component) versus a reference detector. We outline the methodology, readout, and approach for achieving this detector capability in first-ever, proof-of-concept measurements for scintillation photon counting detector with analog silicon photomultipliers. Significance. The presented detector concept is a promising design for large area, high sensitivity TOF-PET detector modules that can implement advanced event positioning and time of interaction estimators, which could push state-of-the-art performance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2023

Nonlinear optics from hybrid dispersive orbits

Here in this paper we expand the technique of characterizing nonlinear optics from off-energy closed orbits (NOECO) to cover harmonic sextupoles in storage rings. The existing NOECO technique has been successfully used to correct the chromatic sextupole errors on the MAX-IV machine (Olsson et al., 2020), however, it does not account for harmonic sextupoles, which are still widely used on many other machines. By generating vertical dispersion with chromatic skew quadrupoles, a measurable chromatic function dependence on harmonic sextupoles can be observed on hybrid dispersive orbits. Proof of concept of this technique was accomplished by simulations and beam measurements on the National Synchrotron Light Source II (NSLS-II) storage ring.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Nonlinear optics from hybrid dispersive orbits

In this paper we expand the technique of characterizing nonlinear optics from off-energy closed orbits (NOECO) to cover harmonic sextupoles in storage rings. The existing NOECO technique has been successfully used to correct the chromatic sextupole errors on the MAX-IV machine [Olsson et al., Phys. Rev. Accel. Beams 23, 102803], however, it does not account for harmonic sextupoles, which are still widely used on many other machines. By generating vertical dispersion with chromatic skew quadrupoles, a measurable chromatic function dependence on harmonic sextupoles can be observed on hybrid dispersive orbits. Proof of concept of this technique was accomplished by simulations and beam measurements on the National Synchrotron Light Source II (NSLS-II) storage ring.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

LoTToR: An Algorithm for Missing-Wedge Correction of the Low-Tilt Tomographic 3D Reconstruction of a Single-Molecule Structure

A single-molecule three-dimensional (3D) structure is essential for understanding the thermal vibrations and dynamics as well as the conformational changes during the chemical reaction of macromolecules. Individual-particle electron tomography (IPET) is an approach for obtaining a snap-shot 3D structure of an individual macromolecule particle by aligning the tilt series of electron tomographic (ET) images of a targeted particle through a focused iterative 3D reconstruction method. The method can reduce the influence on the 3D reconstruction from large-scale image distortion and deformation. Due to the mechanical tilt limitation, 3D reconstruction often contains missing-wedge artifacts, presented as elongation and an anisotropic resolution. Here, we report a post-processing method to correct the missing-wedge artifact. This low-tilt tomographic reconstruction (LoTToR) method contains a model-free iteration process under a set of constraints in real and reciprocal spaces. A proof of concept is conducted by using the LoTToR on a phantom, i.e., a simulated 3D reconstruction from a low-tilt series of images, including that within a tilt range of ±15°. The method is validated by using both negative-staining (NS) and cryo-electron tomography (cryo-ET) experimental data. A significantly reduced missing-wedge artifact verifies the capability of LoTToR, suggesting a new tool to support the future study of macromolecular dynamics, fluctuation and chemical activity from the viewpoint of single-molecule 3D structure determination.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Super-localisation of a point-like emitter in a resonant environment: Correction of the mirage effect

In this paper, we show that it is possible to overcome one of the fundamental limitations of super-resolution microscopy: the necessity to be in an optically homogeneous environment. Using recent modal approximation results from [ 10 , 7 ], we show, as a proof of concept, that it is possible to recover the position of a single point-like emitter in a known resonant environment from far-field measurements, with a precision two orders of magnitude below the classical Rayleigh limit. The procedure does not involve solving any partial differential equation, is computationally light (optimisation in \begin{document}$ \mathbb{R}^d $\end{document} with \begin{document}$ d $\end{document} of the order of \begin{document}$ 10 $\end{document} ) and is therefore suited for the recovery of a very large number of single emitters.

Mathematics↗
DOE OSTI2021

Characterization and Simulation of Optical Delay System for the Proof-of-Principle Experiment of Optical Stochastic Cooling at IOTA

The Optical Stochastic Cooling (OSC) experiment at Fermilab’s IOTA storage ring uses two undulators to cool the beam over many turns. The radiation emitted by electrons in the first undulator is delayed and imaged in the second undulator where it applies a corrective energy kick on the electrons. Imperfections in the manufacturing of the delay plates can lead to a source of error. This paper presents the experimental characterization of the absolute thickness of these delay plates using an interferometric technique. The measured "thickness maps" are implemented in the Synchrotron Radiation Workshop (SRW) program to assess their impact on the delayed radiation pulse.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Empirically Optimized One-Electron Pseudopotential for the Hydrated Electron: A Proof-of-Concept Study

Mixed quantum-classical molecular dynamics simulations have been important tools for studying the hydrated electron. They generally use a one-electron pseudopotential to describe the interactions of an electron with the water molecules. Furthermore, this approximation shows both the strength and weakness of the approach. On the one hand, it enables extensive statistical sampling and large system sizes that are not possible with more accurate ab initio molecular dynamics methods. On the other hand, there has (justifiably) been much debate about the ability of pseudopotentials to accurately and quantitatively describe the hydrated electron properties. These pseudopotentials have largely been derived by fitting them to ab initio calculations of an electron interacting with a single water molecule. In this paper, we present a proof-of-concept demonstration of an alternative approach in which the pseudopotential parameters are determined by optimizing them to reproduce key experimental properties. Specifically, we develop a new pseudopotential, using the existing TBOpt model as a starting point, which correctly describes the hydrated electron vertical detachment energy and radius of gyration. In addition to these properties, this empirically optimized model displays a significantly modified solvation structure, which improves, for example, the prediction of the partial molar volume.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2020

Model-dependence of minimal-twist OPEs in d > 2 holographic CFTs

Following recent work on heavy-light correlators in higher-dimensional conformal field theories (CFTs) with a large central charge C T , we clarify the properties of stress tensor composite primary operators of minimal twist, [ T m ], using arguments in both CFT and gravity. We provide an efficient proof that the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^m\right]\right\rangle$, where ${\mathcal{O}}_L$ is any light primary operator, is independent of the purely gravitational action. Next, we consider corrections to this coupling due to additional interactions in AdS effective field theory and the corresponding dual CFT. When the CFT contains a non-zero three-point coupling $\left\langle TT{\mathcal{O}}_L\right\rangle$, the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^2\right]\right\rangle$ is modified at large C T if $\left\langle TT{\mathcal{O}}_L\right\rangle \sim \sqrt{C_T}$. This scaling is obeyed by the dilaton, by Kaluza-Klein modes of prototypical supergravity compactifications, and by scalars in stress tensor multiplets of supersymmetric CFTs. Quartic derivative interactions involving the graviton and the light probe field dual to ${\mathcal{O}}_L $ can also modify the minimal-twist couplings; these local interactions may be generated by integrating out a spin- ℓ ≥ 2 bulk field at tree level, or any spin ℓ at loop level. These results show how the minimal-twist OPE coefficients can depend on the higher-spin gap scale, even perturbatively.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Verified Optimizer for Quantum Circuits

We present VOQC, the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called SQIR, a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of SQIR programs. SQIR programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. SQIR’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in VOQC, including full-circuit transformations from cutting-edge optimizers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗
DOE OSTI2023

Correct Compilation of Concurrent C Code

The CompCert compiler represents a landmark effort in program verification as both a piece of verified software and as a compiler for verified C programs. A key shortcoming of CompCert however is that it does not support multithreaded programs. Prior work to add threads to CompCert has either required major rewrites of parts of the proof or only works for well synchronized programs. The problem is that CompCert’s backward simulation derives from a forward simulation via the determinism of the semantics of intermediate representation languages. This makes the proofs in CompCert easier but also makes them incompatible with standard models of multithreading which are non-deterministic. Here we propose an alternate formulation of CompCert’s proof structure that parameterizes the existing single threaded semantics with nondeterministic behavior generated at the multithreading level. While this is an old trick where program equivalence is concerned, performing it in the context of CompCert is quite subtle. Our approach allows for expressive concurrent semantics and does not require major proof rewrites but still results in a global backward simulation for multithreaded programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗