Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “vectorization”

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 703 records · Page 39

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗

Radiative Corrections to Neutron Beta Decay and (Anti)Neutrino-Nucleon Scattering from Low-Energy Effective Field Theory

Herein we study radiative corrections to neutron beta decay and low-energy (anti)neutrino-nucleon scattering within a top-down effective field theory approach. As it was recently shown, a few electromagnetic and electroweak low-energy coupling constants in heavy-baryon chiral perturbation theory are yet to be determined. Performing matching to the four-fermion effective field theory, we relate these low-energy constants to correlation functions of vector and axial-vector currents. Such relations allow us to explicitly clarify scheme dependence for radiative corrections to neutron decay and low-energy charged-current (anti)neutrino scattering, provide a robust prediction of leading in the electromagnetic coupling constant contributions, and achieve a clear separation between short-distance and long-distance contributions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

< c+a > dislocations in {101 - 2} twins in Mg: A kinematic and energetic requirement

Consideration of published TEM and molecular dynamics studies of interactions between matrix dislocations and {101¯2} twin boundaries (TB) in hexagonal close packed metals inspires a hypothesis regarding the formation of dislocations with < c+a > Burgers vectors inside the twins. It was previously reported that when basal < a > dislocations from the matrix are swept by an advancing TB, they are converted into partial dislocations bounding basal I 1 stacking faults (SFs) within the twin. In the present work, we show that this dislocation configuration near TB renders it energetically favorable for a pair of partial dislocations to constrict into a dislocation within the twin. New in situ TEM observations confirm this hypothesis by revealing long < c+a > dislocation dipoles terminated by the TB at one end and by I1 SFs within the twin at the other end. Finally, the resulting near-screw < c+a > dislocation dipoles are observed to be glissile, enabling self-annihilation in some circumstances. Thus, rather than requiring a high energy dislocation pile-up to press two < a > dislocations through a TB into a single < c+a > dislocation, it is demonstrated that < c+a > dislocations naturally form, within {101¯2} twins in Mg, as TB migrates into a matrix, which inevitably contains dislocations with < a > Burgers vectors. Furthermore, these observations help to explain how the twins themselves may subsequently deform and why they may be particularly vulnerable to plastic, shear localization.

36 MATERIALS SCIENCE↗

Automated extraction of interfacial dislocations and disconnections from atomistic data

Here we introduce Interfacial Line Defect Analysis (ILDA), a method for identifying and extracting interfacial dislocations and disconnections with little-to-no input from the user on the nature of the interface. By simply providing the orientations and coherency strains for the crystals in a coherent reference state of the interface, ILDA provides exact Burgers vectors. Alternatively, these orientations and strains can be estimated using local atomic deformation gradients, making ILDA fully automated and providing estimated Burgers vectors. ILDA also determines the step height associated with each defect line segment, in case the associated defect is a disconnection. The heart of the method is the identification of atoms residing at co-incidence sites between the two crystals and the construction of a surface mesh connecting these sites that is used to compose Burgers circuits and insert defect line segments. We demonstrate the performance of ILDA in two test cases: a twist grain boundary and a phase boundary.

36 MATERIALS SCIENCE↗

Fast Automatic Knot Placement Method for Accurate B-spline Curve Fitting

The choice of knot vector has immense influence on the resulting accuracy of a B-spline approximation of a curve. However, despite the significance of this problem and the various solutions that were proposed in the literature, optimizing the number and placement of knots remains a difficult task. This paper presents a novel method for the approximation of a curve by a B-spline of arbitrary order, which automatically determines a knot vector that achieves high approximation quality. Additionally, at the core of our approach is a feature function that characterizes the amount and spatial distribution of geometric details in the input curve by estimating its derivatives. Knots are then selected in such a way as to evenly distribute the feature contents across their intervals. A comparison to the state of the art for a wide variety of curves shows that our method is faster and achieves more accurate reconstruction results, while typically reducing the number of necessary knots.

97 MATHEMATICS AND COMPUTING↗

STSR-INR: Spatiotemporal super-resolution for multivariate time-varying volumetric data via implicit neural representation

Implicit neural representation (INR) has surfaced as a promising direction for solving different scientific visualization tasks due to its continuous representation and flexible input and output settings. We present STSR-INR, an INR solution for generating simultaneous spatiotemporal super-resolution for multivariate time-varying volumetric data. Inheriting the benefits of the INR-based approach, STSR-INR supports unsupervised learning and permits data upscaling with arbitrary spatial and temporal scale factors. Unlike existing GAN- or INR-based super-resolution methods, STSR-INR focuses on tackling variables or ensembles and enabling joint training across datasets of various spatiotemporal resolutions. Here we achieve this capability via a variable embedding scheme that learns latent vectors for different variables. In conjunction with a modulated structure in the network design, we employ a variational auto-decoder to optimize the learnable latent vectors to enable latent-space interpolation. To combat the slow training of INR, we leverage a multi-head strategy to improve training and inference speed with significant speedup. We demonstrate the effectiveness of STSR-INR with multiple scalar field datasets and compare it with conventional tricubic+linear interpolation and state-of-the-art deep-learning-based solutions (STNet and CoordNet).

97 MATHEMATICS AND COMPUTING↗

CIEL ∗ Ch color map for visualization and analysis of sea ice motion

The International Commission on Illumination (CIE) designed its color space to be perceptually uniform so that a given numerical change in the color code corresponds to perceived change in color. This color encoding is demon- strated to be advantageous in scientific visualization and analysis of vector fields. The specific application is analysis of ice motion in the Arctic where patterns in smooth monthly-averaged ice motion are seen. Furthermore, fractures occurring in the ice cover result in discontinuities in the ice motion. This vector jump in displacement can also be visualized. We then analyze modeled and observed fractures through the use of a metric on the color space, and image amplitude and phase metrics. Amplitude and phase met- rics arise from image registration that is accomplished by sampling images using space filling curves, thus reducing the image registration problem to the more reliable functional alignment problem. We demonstrate this through an exploration of the metrics to compare model runs to an observed ice crack.

97 MATHEMATICS AND COMPUTING↗

Hutchinson Trace Estimation for high-dimensional and high-order Physics-Informed Neural Networks

Physics-Informed Neural Networks (PINNs) have proven effective in solving partial differential equations (PDEs), especially when some data are available by seamlessly blending data and physics. However, extending PINNs to high-dimensional and even high-order PDEs encounters significant challenges due to the computational cost associated with automatic differentiation in the residual loss function calculation. Herein, we address the limitations of PINNs in handling high-dimensional and high-order PDEs by introducing the Hutchinson Trace Estimation (HTE) method. Starting with the second-order high-dimensional PDEs, which are ubiquitous in scientific computing, HTE is applied to transform the calculation of the entire Hessian matrix into a Hessian vector product (HVP). This approach not only alleviates the computational bottleneck via Taylor-mode automatic differentiation but also significantly reduces memory consumption from the Hessian matrix to an HVP’s scalar output. We further showcase HTE’s convergence to the original PINN loss and its unbiased behavior under specific conditions. Comparisons with the Stochastic Dimension Gradient Descent (SDGD) highlight the distinct advantages of HTE, particularly in scenarios with significant variability and variance among dimensions. We further extend the application of HTE to higher-order and higher-dimensional PDEs, specifically addressing the biharmonic equation. By employing tensor-vector products (TVP), HTE efficiently computes the colossal tensor associated with the fourth-order high-dimensional biharmonic equation, saving memory and enabling rapid computation. The effectiveness of HTE is illustrated through experimental setups, demonstrating comparable convergence rates with SDGD under memory and speed constraints. Additionally, HTE proves valuable in accelerating the Gradient-Enhanced PINN (gPINN) version as well as the Biharmonic equation. Overall, HTE opens up a new capability in scientific machine learning for tackling high-order and high-dimensional PDEs.

Curse of dimensionality↗

A projection-based analytical Jacobian framework for chemical kinetics applications

A major challenge in simulating complex combustion systems with detailed chemical kinetic models is the cost of integrating the chemical source terms, often done using stiff ODE solvers that require frequent Jacobian evaluations. Using analytically derived Jacobian matrices instead of divided-difference-based numerical Jacobian approximations can significantly reduce the associated computational cost. However, ambiguities arise in the formulation of analytical Jacobians because the chemical state of the system, or state vector, can be expressed in multiple ways, involving variables that are typically not independent from one another. Here, in this work, the consequences of those ambiguities on practical calculations are characterized in detail, and a generalized, projection-based framework is proposed as a mitigation strategy. Performances are assessed in a series of test cases involving a variety of configurations and numerical solution approaches. Results show that with proper treatment, commonly used analytical Jacobian formulations can be considered as equivalent for practical purposes, thereby alleviating concerns that the state vector chosen to express the governing equations and corresponding analytical Jacobian may significantly impact the accuracy of the simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Code modernization strategies for short-range non-bonded molecular dynamics simulations

Modern HPC systems are increasingly relying on greater core counts and wider vector registers. Thus, applications need to be adapted to fully utilize these hardware capabilities. One class of applications that can benefit from this increase in parallelism are molecular dynamics simulations. In this paper, we describe our efforts at modernizing the ESPResSo++ simulation package for molecular dynamics by restructuring its particle data layout for efficient memory accesses and applying vectorization techniques to benefit the calculation of short-range non-bonded forces, which results in an overall three times speedup and serves as a baseline for further optimizations. We also implement fine-grained parallelism for multi-core CPUs through HPX, a C++ runtime system which uses lightweight threads and an asynchronous many-task approach to maximize concurrency. Our goal is to evaluate the performance of an HPX-based approach compared to the bulk-synchronous MPI-based implementation. This requires the introduction of an additional layer to the domain decomposition scheme that defines the task granularity. On spatially inhomogeneous systems, which impose a corresponding load-imbalance in traditional MPI-based approaches, we demonstrate that by choosing an optimal task size, the efficient work-stealing mechanisms of HPX can overcome the overhead of communication resulting in an overall 1.4 times speedup compared to the baseline MPI version.

97 MATHEMATICS AND COMPUTING↗

The magnetic order in multiferroic DyMnO 3

We report that with flexibility in tuning their electric and magnetic properties, multiferroics can be used in information exchange and storage in ways that are very different from the present electronic materials. Here we use resonant soft X-ray scattering spectroscopy to study the F-type (0,τ,0) and C-type (0, 1–2τ, 0) diffraction peaks from sinusoidal antiferromagnetic spin order in multiferroic DyMnO 3 . By comparing the temperature dependence of ordering wave vectors τ, peak intensities I, and correlation lengths λ measured at Mn L 2 - , O K-, and Dy M 5 -edges, we show that the nearly perfect locking between the ordering wave vectors from Dy 4f states and Mn 3d orbitals manifesting the second harmonic diffraction peak implies the notable orbital involvement in the coupling between Mn and Dy spins. Our DFT calculations further suggest that the lattice response to different antiferromagnetic ground states (A-type versus E-type) is much weaker in TbMnO 3 , in agreement with previous claim that the symmetric exchange interaction can be an important factor for understanding the ferroelectricity in DyMnO 3 than in TbMnO 3 .

36 MATERIALS SCIENCE↗

Post-hazard condition assessment of nuclear piping-equipment systems: Novel approach to feature extraction and deep learning

Over the past decade, the use of artificial intelligence techniques in the field of health-monitoring has gained significant interest, especially for structures such as building and bridges. However, applications to industrial systems such as equipment-piping systems in nuclear plants have not been explored. Here, in this paper, it is shown that the existing techniques developed for buildings and bridges cannot be extended directly to equipment-piping systems as the response of such systems is governed by multiple localized modes unlike that in buildings and bridges. This paper proposes a new approach that consists of three key aspects: (i) a novel vector of degradation-sensitive features extracted from measured data, (ii) using a deep Artificial Neural Network (ANN) for diagnosis of degradation location and degradation severity, and (iii) consideration of uncertainty in degradation severity when training the ANN. Degradation in piping-equipment systems can occur due to flow-accelerated erosion and corrosion. These locations can potentially exhibit damage such as localized yielding or initiation of cracking due to an external event such as an earthquake. Moreover, such locations can at times go undetected by current inspection techniques. Therefore, a robust framework is needed for detection of degradation after a seismic event. This manuscript proposes a proof-of-concept framework, which utilizes data collected from sensors to generate a deep ANN database for predicting degraded locations and severity in a piping-equipment system. Degradation severity is classified as minor, moderate, and severe. In the suggested methodology, a novel vector of degradation-sensitive features is extracted from the sensor data to train the ANN. A simple piping-equipment system is selected to demonstrate feature extraction as a means to simplify pattern recognition, explore the design and parameters of an ANN, and develop a sensor placement strategy. The effectiveness of the proposed framework is demonstrated on a realistic primary safety system of a two-loop nuclear reactor. It is shown that the proposed post-hazard condition assessment framework is able to detect degraded locations along with the severity levels, including minor degradation, with considerably higher accuracy.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Transition from an incommensurate spin density wave to a commensurate magnetic order in a triangular lattice compound Ho 2 PdAl 6 Ge 4

Rare-earth (RE) intermetallics on a triangular lattice are promising candidates for generating interesting magnetic phases due to the complex interplay between Ruderman-Kittel-Kasuya-Yoshida (RKKY) interaction and geometrical frustration. Here, in this work, we report the exotic magnetic structure of a layered compound Ho 2 PdAl 6 Ge 4 with triangular lanthanide nets. Magnetization and heat capacity measurements in zero magnetic field reveal two magnetic phase transitions at T N1 = 10.8 K and T N2 = 6.0 K. Neutron powder diffraction demonstrates a commensurate antiferromagnetic phase with k 1 = (0, 0, 1.5) below T N2 . With increasing temperature, another incommensurate vector appears and therefore, the magnetic structure of the intermediate state is identified as an unusual incommensurate spin density wave with two propagation vectors k 1 = (0, 0, 1.5) and k 2 = (0.0492, 0.0492, 1.5). The magnetic moments in the intermediate state rotate continuously and form an unusual S-shaped wave arrangement in the ab plane, sharing similarities with typical cycloid and helix magnetic orders. These results identify Ho 2 PdAl 6 Ge 4 as a candidate for exploring field-induced topological magnetic phases such as skyrmions, opening the way for further investigations on the family of RE 2 PdAl 6 Ge 4 materials.

36 MATERIALS SCIENCE↗

Meshfree methods on manifolds for hydrodynamic flows on curved surfaces: A Generalized Moving Least-Squares (GMLS) approach

We utilize generalized moving least squares (GMLS) to develop meshfree techniques for discretizing hydrodynamic flow problems on manifolds. We use exterior calculus to formulate incompressible hydrodynamic equations in the Stokesian regime and handle the divergence-free constraints via a generalized vector potential. This provides less coordinate-centric descriptions and enables the development of efficient numerical methods and splitting schemes for the fourth-order governing equations in terms of a system of second-order elliptic operators. Using a Hodge decomposition, we develop methods for manifolds having spherical topology. We show the methods exhibit high-order convergence rates for solving hydrodynamic flows on curved surfaces. The methods also provide general high-order approximations for the metric, curvature, and other geometric quantities of the manifold and associated exterior calculus operators. The approaches also can be utilized to develop high-order solvers for other scalar-valued and vector-valued problems on manifolds.

97 MATHEMATICS AND COMPUTING↗

Boundary-consistent B-spline filtering schemes and application to high-fidelity simulations of turbulence

A filtering operation, based on B-spline discretizations, is introduced to target weakly growing mesh-scale oscillations that can arise in high-fidelity turbulence simulations. This is a spectral regularization that can be described using the singular values of a banded matrix operator, with the filtering strength set by a scalar- or vector-valued penalty parameter. The penalty parameter can be specified though it can also be advantageously selected to minimize the generalized cross validation (GCV) measure of distance between the pre- and post-filtered solutions. Efficient algorithms are developed to compute both the scalar and vector penalty parameters. The B-spline filter has a sharper localization to high-wavenumber than compact or explicit filters of the same stencil width and is demonstrated for solutions of the Burgers' equation, decaying Burgers' turbulence, and compressible Navier–Stokes turbulent channel flow. Furthermore, these simulations confirm the scheme's numerical stability and ability to narrowly target the high wavenumber components of numerical solutions. An advantage over finite-difference filters is that these B-spline filters are stable on bounded domains and even preserve formal order of accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields

Here Tthis work describes a newly developed, arbitrarily high-order Cartesian-grid method for reconstructing material interfaces from a volume fraction field. The method begins by identifying all of the grid cells in the volume fraction field that are intersected by the interface and need to be approximated by the reconstruction scheme. Finite-differences are used to calculate the gradient of the volume fraction field and provide an estimate of the surface normal in all of the interfacial grid cells. Groups of connected grid cells are then identified which all have the same dominant component of the normal vector. This grouping by orientation determines the proper dependent variable to use in the surface reconstruction (e.g. for a 2D curve, this step determines if the surface will be approximated by a function of x or y). A cumulative integral over the surface is constructed and fit using b-splines for two-dimensional problems or tensor-product b-splines for three-dimensional problems. This construction allows for the interface to be recovered through application of the second fundamental theorem of calculus. Fitting the cumulative integral with $\mathscr{N}$ th-order b-splines (or tensor-product b-splines) yields an ($\mathscr{N}$-1) th-order convergence rate of the interface shape. Differentiation of the b-spline interface function(s) allows for the high-order approximation of the normal vector and curvature to be obtained directly anywhere along b-spline. Together, the proposed reconstruction technique can achieve arbitrarily high mesh convergence rates. Validation tests are presented with mesh convergence rates ranging from fourth- to tenth-order.

97 MATHEMATICS AND COMPUTING↗