Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SCIENTIFIC ENGINEERING”

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 415 records · Page 23

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

Demonstration of CRISPR/Cas9/sgRNA-mediated targeted gene modification in Arabidopsis, tobacco, sorghum and rice

The type II CRISPR/Cas system from Streptococcus pyogenes and its simplified derivative, the Cas9/single guide RNA (sgRNA) system, have emerged as potent new tools for targeted gene knockout in bacteria, yeast, fruit fly, zebrafish and human cells. Here, we describe adaptations of these systems leading to successful expression of the Cas9/sgRNA system in two dicot plant species, Arabidopsis and tobacco, and two monocot crop species, rice and sorghum. Agrobacterium tumefaciens was used for delivery of genes encoding Cas9, sgRNA and a non-functional, mutant green fluorescence protein (GFP) to Arabidopsis and tobacco. The mutant GFP gene contained target sites in its 5' coding regions that were successfully cleaved by a CAS9/sgRNA complex that, along with error-prone DNA repair, resulted in creation of functional GFP genes. DNA sequencing confirmed Cas9/sgRNA-mediated mutagenesis at the target site. Rice protoplast cells transformed with Cas9/sgRNA constructs targeting the promoter region of the bacterial blight susceptibility genes, OsSWEET14 and OsSWEET11, were confirmed by DNA sequencing to contain mutated DNA sequences at the target sites. Successful demonstration of the Cas9/sgRNA system in model plant and crop species bodes well for its near-term use as a facile and powerful means of plant genetic engineering for scientific and agricultural applications.

59 BASIC BIOLOGICAL SCIENCES↗

Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems

Double-precision floating-point arithmetic (FP64) has been the de facto standard for engineering and scientific simulations for several decades. Problem complexity and the sheer volume of data coming from various instruments and sensors motivate researchers to mix and match various approaches to optimize compute resources, including different levels of floating-point precision. In recent years, machine learning has motivated hardware support for half-precision floating-point arithmetic. A primary challenge in high-performance computing is to leverage reduced-precision and mixed-precision hardware. We show how the FP16/FP32 Tensor Cores on NVIDIA GPUs can be exploited to accelerate the solution of linear systems of equations Ax = b without sacrificing numerical stability. The techniques we employ include multiprecision LU factorization, the preconditioned generalized minimal residual algorithm (GMRES), and scaling and auto-adaptive rounding to avoid overflow. We also show how to efficiently handle systems with multiple right-hand sides. On the NVIDIA Quadro GV100 (Volta) GPU, we achieve a 4×-5× performance increase and 5× better energy efficiency versus the standard FP64 implementation while maintaining an FP64 level of numerical stability.

GMRES↗

The Spherical Tokamak for Energy Production: theme issue introduction

This theme issue collects together papers summarising the conceptual design of the Spherical Tokamak for Energy Production (STEP). In 2019, the UK government funded the first design stages of a prototype fusion powerplant based on a compact toroidal geometry, called STEP. The primary technical aims of STEP are to produce net energy, to be self-sufficient in tritium fuel and to demonstrate a maintenance regime that would extrapolate to appropriate availability for commercial powerplants. After 5 years and over 1000 person-years of detailed scientific and engineering conceptual design, this theme issue acts as a compendium of the current design basis for STEP, noting that this is a snapshot in time and that the design will continue to evolve. This article is part of the theme issue ‘Delivering Fusion Energy – The Spherical Tokamak for Energy Production (STEP)’.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Boiling and cavitation caused by transient heat transfer in superfluid helium-4

Superfluid helium-4 (He II) has been widely utilized as a coolant in various scientific and engineering applications due to its superior heat transfer capability. An important parameter required in the design of many He II based cooling systems is the peak heat flux $q^*$, which refers to the threshold heat flux above which boiling spontaneously occurs in He II. Past experimental and numerical studies showed that $q^*$ increases when the heating time $t_h$ is reduced, which leads to an intuitive expectation that very high $q^*$ may be achievable at sufficiently small $t_h$. Knowledge on how $q^*$ actually behaves at small $t_h$ is important for applications such as laser ablation in He II. Furthermore we present a numerical study on the evolution of the thermodynamic state of the He II in front of a planar heater by solving the He II two-fluid equations of motion. For an applied heat flux, we determine the heating time beyond which the He II near the heater transits to the vapor phase. As such, a curve correlating $q^*$ and $t_h$ can be obtained, which nicely reproduces some relevant experimental data. Surprisingly, we find that there exists a critical peak heat flux $q^*_c$, above which boiling occurs nearly instantaneously regardless of $t_h$. We reveal that the boiling in this regime is essentially cavitation caused by the combined effects of the first-sound and the second-sound waves in He II. Based on this physical picture, an analytical model for $q^*_c$ is developed, which reproduces the simulated $q^*_c$ values at various He II bath temperatures and hydrostatic head pressures. This work represents a major progress in our understanding of transient heat transfer in He II.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Boiling peak heat flux for steady inhomogeneous heat transfer in superfluid He 4

Superfluid helium-4 (He II) is a widely adopted coolant in scientific and engineering applications owing to its exceptional heat transfer capabilities. However, boiling can spontaneously occur on a heating surface in He II when the heat flux exceeds a threshold value $q^*$, referred to as the peak heat flux. While the parameter $q^*$ holds paramount importance in the design of He II based cooling systems, extensive research has primarily focused on its behavior in steady homogeneous heat transfer from a flat heating surface. For inhomogeneous heat transfer from curved surfaces, $q^*$ exhibits intricate dependance on parameters such as the He II bath temperature $T_b$, the immersion depth $h$, and the curvature radius $R_0$ of the heating surface. A comprehensive understanding on how $q^*$ depends on these parameters remains elusive. In this paper, we report our systematic study on $q^*$ for steady heat transfer from cylindrical and spherical heaters in He II. We compute $q^*$ for a wide range of parameter combinations $(T_b, h, R_0)$ by solving the He II two-fluid equations of motion. The generated data have allowed us to develop a robust correlation that accurately reproduces $q^*$ for all the parameter combinations we explored. Furthermore, our findings, particularly the establishment of the correlation, carry valuable implications for emergent applications that involve steady inhomogeneous heat transfer in He II systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Nanoparticle localization within chiral liquid crystal defect lines and nanoparticle interactions

Self-assembly of colloidal particles into predefined structures is a promising way to design inexpensive manmade materials with advanced macroscopic properties. Doping of nematic liquid crystals (LCs) with nanoparticles has a series of advantages in addressing these grand scientific and engineering challenges. It also provides a very rich soft matter platform for the discovery of unique condensed matter phases. The LC host naturally allows the realization of diverse anisotropic interparticle interactions, enriched by the spontaneous alignment of anisotropic particles due to the boundary conditions of the LC director. Here we demonstrate theoretically and experimentally that the ability of LC media to host topological defect lines can be used as a tool to probe the behavior of individual nanoparticles as well as effective interactions between them. LC defect lines irreversibly trap nanoparticles enabling controlled particle movement along the defect line with the use of a laser tweezer. Minimization of Landau–de Gennes free energy reveals a sensitivity of the ensuing effective nanoparticle interaction to the shape of the particle, surface anchoring strength, and temperature, which determine not only the strength of the interaction but also its repulsive or attractive character. Theoretical results are supported qualitatively by experimental observations. Furthermore, this work may pave the way toward designing controlled linear assemblies as well as one-dimensional crystals of nanoparticles such as gold nanorods or quantum dots with tunable interparticle spacing.

36 MATERIALS SCIENCE↗

Memristive linear algebra

The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. In particular, we demonstrate that the electrical properties of memristive crossbars uniquely suit them for the evolution of a family of matrix exponentials, which can be exploited for the efficient computation of matrix inverses and online solutions for linear problems. Our results demonstrate that memristive arrays can reduce computational complexity. We also study power consumption and show a tradeoff between precision and energy. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient GPU Implementation of Automatic Differentiation for Computational Fluid Dynamics

Many scientific and engineering applications require repeated calculations of derivatives of output functions with respect to input parameters. Automatic Differentiation (AD) is a method that automates derivative calculations and can significantly speed up code development. In Computational Fluid Dynamics (CFD), derivatives of flux functions with respect to state variables (Jacobian) are needed for efficient solutions of the nonlinear governing equations. AD of flux functions on graphics processing units (GPUs) is challenging as flux computations involve many intermediate variables that create high register pressure and require significant memory traffic because of the need to store the derivatives. This paper presents a forward-mode AD method based on multivariate dual numbers that addresses these challenges and simultaneously reduces the floating-point operation count. The dimension of the multivariate dual numbers is optimized for performance. The flux computations are restructured to minimize the number of temporary variables and reduce register pressure. For effective utilization of memory bandwidth, shared memory is used to store the local flux Jacobian. This AD implementation is compared with several other Jacobian implementations on an NVIDIA V100 GPU (V100). For three-dimensional perfect-gas compressible-flow equations implemented in a practical CFD code, the AD implementation of a flux Jacobian based on multivariate dual numbers of dimension 5 outperforms all other GPU AD implementations on V100. Its performance is comparable with the optimized hand-differentiated version. Finally, the implementation achieves 75% of the peak floating-point throughput and 61 % of the peak global device memory bandwidth usage.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Arithmetic Primitives for Efficient Neuromorphic Computing

Neuromorphic computing is steadily gaining popularity in many scientific and engineering disciplines. However, one of the biggest problems that has prevented widespread usage of neuromorphic computing is the lack of efficient encoding methods. Traditional encoding methods such as binning, rate encoding, and temporal encoding are based on unary encoding and generate a large number of spikes for certain applications, making them less energy efficient. Lack of better encoding methods has also prevented preprocessing operations from being carried out on neuromorphic computers. As a result, over 99% of the time can be spent on data preprocessing and data transfer operations in some cases, leading to an inefficient workflow. In this paper, we present preliminary results that would enable us to efficiently encode data and perform basic arithmetic operations on neuromorphic computers. First, we present a neuromorphic approach for the two’s complement encoding of numbers and leverage it to devise addition and multiplication circuits, which could be used in preprocessing operations on neuromorphic computers. We test our approach on the SuperNeuroMAT simulator. Our results indicate that two’s complement is a highly efficient encoding method in terms of time, space, and energy complexity and that the addition and multiplication circuits produce accurate results on two numbers having arbitrary precision.

Wurm, Ahna↗

GPU Accelerated Sparse Cholesky Factorization

The solution of sparse symmetric positive definite linear systems is an important computational kernel in large-scale scientific and engineering modeling and simulation. We will solve the linear systems using a direct method, in which a Cholesky factorization of the coefficient matrix is performed using a right-looking approach and the resulting triangular factors are used to compute the solution. Sparse Cholesky factorization is compute intensive. In this work we investigate techniques for reducing the factorization time in sparse Cholesky factorization by offloading some of the dense matrix operations on a GPU. We will describe the techniques we have considered. We achieved up to 4x speedup compared to the CPU-only version.

Karsavuran, M Ozan↗

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable parallel distance field construction for large-scale applications

Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. Anew distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking overtime, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. In conclusion, our work greatly extends the usability of distance fields for demanding applications.

97 MATHEMATICS AND COMPUTING↗

New Method for the Generation of Secondary Particle Beams at Accelerators

The generation of beams of secondary particles (π and K mesons) at proton accelerators is a difficult scientific and engineering problem. To obtain narrow directional particle beams for experiments, intense extracted proton beams are used, secondary particles (π and K mesons) are generated at an external target, and they are focused and transferred through long magneto-optical channels. In this work, a surprisingly simple method based on a crystal focusing device has been proposed to obtain secondary beams. An experiment on the production of a secondary beam using a crystal has been performed at the U-70 accelerator. Schemes for the formation of beams with energies E ~ 1 TeV have been proposed for large colliders such as the Large Hadron Collider.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Computer Model Calibration with Time Series Data Using Deep Learning and Quantile Regression

Computer models play a key role in many scientific and engineering problems. One major source of uncertainty in computer model experiments is input parameter uncertainty. Computer model calibration is a formal statistical procedure to infer input parameters by combining information from model runs and observational data. The existing standard calibration framework suffers from inferential issues when the model output and observational data are high-dimensional dependent data, such as large time series, due to the difficulty in building an emulator and the nonidentifiability between effects from input parameters and data-model discrepancy. To overcome these challenges, we, in this work, propose a new calibration framework based on a deep neural network (DNN) with long short-term memory layers that directly emulates the inverse relationship between the model output and input parameters. Adopting the “learning with noise” idea, we train our DNN model to filter out the effects from data-model discrepancy on input parameter inference. We also formulate a new way to construct interval predictions for DNN using quantile regression to quantify the uncertainty in input parameter estimates. Through a simulation study and real data application with the Weather Research and Forecasting Model Hydrological modeling system (WRF-Hydro), we show our approach can yield accurate point estimates and well-calibrated interval estimates for input parameters.

97 MATHEMATICS AND COMPUTING↗

Autodifferentiable Ensemble Kalman Filters

Data assimilation is concerned with sequentially estimating a temporally evolving state. This task, which arises in a wide range of scientific and engineering applications, is particularly challenging when the state is high-dimensional and the state-space dynamics are unknown. This paper introduces a machine learning framework for learning dynamical systems in data assimilation. Here, our auto-differentiable ensemble Kalman filters (AD-EnKFs) blend ensemble Kalman filters for state recovery with machine learning tools for learning the dynamics. In doing so, AD-EnKFs leverage the ability of ensemble Kalman filters to scale to high-dimensional states and the power of automatic differentiation to train high-dimensional surrogate models for the dynamics. Numerical results using the Lorenz-96 model show that AD-EnKFs outperform existing methods that use expectation-maximization or particle filters to merge data assimilation and machine learning. In addition, AD-EnKFs are easy to implement and require minimal tuning.

autodifferentiation↗

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗

Educating and Training Accelerator Scientists and Technologists for Tomorrow

Accelerator science and technology is inherently an integrative discipline that combines aspects of physics, computational science, electrical and mechanical engineering. As few universities offer full academic programs, the education of accelerator physicists and engineers for the future has primarily relied on a combination of on-the-job training supplemented with intense courses at regional accelerator schools. This paper describes the approaches being used to satisfy the educational interests of a growing number of interested physicists and engineers.

43 PARTICLE ACCELERATORS↗