Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Modeling the smoky troposphere of the southeast Atlantic: a comparison to ORACLES airborne observations from September of 2016

The southeast Atlantic is home to well-defined smoke outflow from Africa coinciding vertically with extensive marine boundary-layer cloud decks, both reaching their climatological maxima in spatial extent around September. A framework is put forth for evaluating the performance of a range of global and regional aerosol models against observations made during the NASA ORACLES (ObseRvations of Aerosols above CLouds and their intEractionS) airborne mission in September 2016. The sparse airborne observations are first aggregated into 2o grid boxes and into three vertical layers: the cloud-topped marine boundary layer (MBL), the layer from cloud top to 3 km, and the 3-6 km layer. Aerosol extensive properties simulated for the entire study region for all September suggest that the 2016 ORACLES observations are reasonably representative of the regional monthly average, with systematic deviations of 30% or less. All six models typically place the bottom of the smoke layer at lower altitudes than do the airborne lidar observations by 300-1400 m, whereas model aerosol top heights are within 0-500 m of the observations. All but one of the models that report carbonaceous aerosol masses underestimate the ratio of particulate extinction to the masses, a proxy for mass extinction efficiency, in 3-6 km. Notable findings on individual models include that WRF-CAM5 predicts the mass of black carbon and organic aerosols with minor (~10% or less) biases. GEOS-5 overestimates the carbonaceous particle masses in the MBL by a factor of 3-6. Extinction coefficients in the free troposphere (FT) and above-cloud aerosol optical depth (ACAOD) are 10-30% lower in WRF-CAM5, 30-50% lower in GEOS-5, 10-40% higher in GEOS-Chem, 10-20% higher in EAM-E3SM except for the practically unbiased 3-6 km extinction, and 20-70% lower in the Unified Model, than the airborne in situ, lidar and sunphotometer measurements. ALADIN-Climate also underestimates the ACAOD, by 30%. GEOS-5 and GEOS-Chem predict carbon monoxide in the MBL with small (10% or less) negative biases, despite their overestimates of carbonaceous aerosol masses. Overall, this study highlights a new approach to utilizing airborne aerosol measurements for model diagnosis.

Shinozuka, Yohei↗
DOE OSTI2024

Underestimation of multi-decadal global O 2 loss due to an optimal interpolation method

Abstract. The global ocean's oxygen content has declined significantly over the past several decades and is expected to continue decreasing under global warming, with far-reaching impacts on marine ecosystems and biogeochemical cycling. Determining the oxygen trend, its spatial pattern, and uncertainties from observations is fundamental to our understanding of the changing ocean environment. This study uses a suite of CMIP6 Earth system models to evaluate the biases and uncertainties in oxygen distribution and trends due to sampling sparseness. Model outputs are sub-sampled according to the spatial and temporal distribution of the historical shipboard measurements, and the data gaps are filled by a simple optimal interpolation method using Gaussian covariance with a constant e-folding length scale. Sub-sampled results are compared to full model output, revealing the biases in global and basin-wise oxygen content trends. The simple optimal interpolation underestimates the modeled global deoxygenation trends, capturing approximately two-thirds of the full model trends. The North Atlantic and subpolar North Pacific are relatively well sampled, and the simple optimal interpolation is capable of reconstructing more than 80 % of the oxygen trend in the non-eddying CMIP models. In contrast, pronounced biases are found in the equatorial oceans and the Southern Ocean, where the sampling density is relatively low. The application of the simple optimal interpolation method to the historical dataset estimated the global oxygen loss to be 1.5 % over the past 50 years. However, the ratio of the global oxygen trend between the sub-sampled and full model output has increased the estimated loss rate in the range of 1.7 % to 3.1 % over the past 50 years, which partially overlaps with previous studies. The approach taken in this study can provide a framework for the intercomparison of different statistical gap-filling methods to estimate oxygen content trends and their uncertainties due to sampling sparseness.

Ito, Takamitsu (ORCID:000000019873099X)↗
DOE OSTI2023

Reassessing long-standing meteorological records: an example using the national hottest day in Ireland

This analysis highlights the potential value in reanalysing early national meteorological records from around the world. These were oftentimes measured via techniques that preceded standardisation of instrumentation and methods of observation and thus could be subject to considerable biases and uncertainties. This analysis uses the techniques pioneered by WMO record assessment teams. The highest currently recognised air temperature (33.3 °C) ever recorded in the Republic of Ireland was logged at Kilkenny Castle in 1887. The original observational record however no longer exists. Given that Ireland is now the only country in Europe to have a national heat record that was set in the 19th century, a reassessment of the verity of this record is both timely and valuable. The present analysis undertakes a fundamental reassessment of the plausibility of the 1887 temperature record using methods similar to those used to assess various weather extremes under WMO auspices over recent years. Specifically, we undertake an inter-station reassessment using sparse available records and make recourse to the new and improved 20CRv3 sparse-input reanalysis product. Neither surrounding available stations nor the reanalysis offer substantive support for the Kilkenny record of 33.3 °C being correct. Moreover, recent data rescue efforts have uncovered several earlier extreme values, one of which exceeds the Kilkenny value (33.5 °C on 16 July 1876 recorded at the Phoenix Park). However, the sparsity of early observational networks, a distinct lack of synoptic support from 20CRv3 for many of the extreme heat values, and the fact that these measurements were obtained using non-standard exposures lead us to conclude that there is grossly insufficient evidence to support any of these 19th century extremes as robust national heat record candidates. Data from the early 20th century onwards benefit from a denser network of stations undertaking measurements in a more standardised manner, many under the direct auspices of Met Éireann and its predecessors, adhering to WMO guidance and protocols. This enables more robust cross-checking of records. We argue that the Met Éireann-recognised 20th century heat record from Boora in 1976 is verified as the most plausible robust national temperature record based upon the synoptic situation and comparisons with nearby neighbouring stations. This measurement of 32.5°C thus likely constitutes the highest reliably recorded temperature measurement in the Republic of Ireland. Ultimately, the formal decision on any reassessment and reassignment of the national record rests with the national meteorological service, Met Éireann.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

A deep learning hybrid predictive modeling (HPM) approach for estimating evapotranspiration and ecosystem respiration

Climate change is reshaping vulnerable ecosystems, leading to uncertain effects on ecosystem dynamics, including evapotranspiration (ET) and ecosystem respiration (R eco ). However, accurate estimation of ET and R eco still remains challenging at sparsely monitored watersheds, where data and field instrumentation are limited. In this study, we developed a hybrid predictive modeling approach (HPM) that integrates eddy covariance measurements, physically based model simulation results, meteorological forcings, and remote-sensing datasets to estimate ET and R eco in high space–time resolution. HPM relies on a deep learning algorithm and long short-term memory (LSTM) and requires only air temperature, precipitation, radiation, normalized difference vegetation index (NDVI), and soil temperature (when available) as input variables. We tested and validated HPM estimation results in different climate regions and developed four use cases to demonstrate the applicability and variability of HPM at various FLUXNET sites and Rocky Mountain SNOTEL sites in Western North America. To test the limitations and performance of the HPM approach in mountainous watersheds, an expanded use case focused on the East River Watershed, Colorado, USA. The results indicate HPM is capable of identifying complicated interactions among meteorological forcings, ET, and R eco variables, as well as providing reliable estimation of ET and R eco across relevant spatiotemporal scales, even in challenging mountainous systems. The study documents that HPM increases our capability to estimate ET and R eco and enhances process understanding at sparsely monitored watersheds.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Reinforcement-based Program Induction in a Neural Virtual Machine

We present a neural virtual machine that can be trained to perform algorithmic tasks. Rather than combining a neural controller with non-neural memory storage as has been done in the past, this architecture is purely neural and emulates tape-based memory via fast associative weights (onestep learning). Here we formally define the architecture, and then extend the system to learn programs using recurrent policy gradient reinforcement learning based on examples of program inputs labeled with corresponding output targets, which are compared against actual output to generate a sparse reward signal. We describe the policy gradient training procedure used, and report its empirical performance on a number of smallscale list processing tasks, such as finding the maximum list element, filtering out certain elements, and reversing the order of the elements. These results show that program induction via reinforcement learning is possible using sparse rewards and solely neural computations.

Katz, Garrett E.↗
DOE OSTI2020

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗
DOE OSTI2021

Improving scalability of electronic structure code for molecular simulations in the presence of environment

A scalable density functional electronic code with Gaussian basis set, called UTEP-NRLMOL, is developed to perform simulations of molecular systems in the presence of the environment with particular attention to the memory requirements. In the electronic structure calculations, the memory and computation time are proportional to the number of atoms. Memory requirements for density functional calculations scale as N*N, where N is the number of atoms. While the recent advances in HPC offer platforms with large numbers of cores, the limited amount of memory available on a given node and poor scalability of the electronic structure codes hinder their efficient usage of these platforms. We have introduced new scaling and parallelization paradigms using MPI-3 shared-memory functionality combined with usage of sparse algebra and storage of matrices in sparse format. This extends the range of applicability of the UTEP-NRLMOL code to large systems over 10,000 atoms, or using up to 67,000 basis functions, and making use of HPC architectures using over 6,000 processors utilizing all available cores. We have also interfaced code with effective fragment potential and polarizable continuum model libraries. The code was used in simulations of several applications which are published in reputed scientific journals.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Cosmic ray muon clustering for the MicroBooNE liquid argon time projection chamber using sMask-RCNN

In this article, we describe a modified implementation of Mask Region-based Convolutional Neural Networks (Mask-RCNN) for cosmic ray muon clustering in a liquid argon TPC and applied to MicroBooNE neutrino data. Our implementation of this network, called sMask-RCNN, uses sparse submanifold convolutions to increase processing speed on sparse datasets, and is compared to the original dense version in several metrics. The networks are trained to use wire readout images from the MicroBooNE liquid argon time projection chamber as input and produce individually labeled particle interactions within the image. These outputs are identified as either cosmic ray muon or electron neutrino interactions. We find that sMask-RCNN has an average pixel clustering efficiency of 85.9% compared to the dense network's average pixel clustering efficiency of 89.1%. We demonstrate the ability of sMask-RCNN used in conjunction with MicroBooNE's state-of-the-art Wire-Cell cosmic tagger to veto events containing only cosmic ray muons. The addition of sMask-RCNN to the Wire-Cell cosmic tagger removes 70% of the remaining cosmic ray muon background events at the same electron neutrino event signal efficiency. This event veto can provide 99.7% rejection of cosmic ray-only background events while maintaining an electron neutrino event-level signal efficiency of 80.1%. In addition to cosmic ray muon identification, sMask-RCNN could be used to extract features and identify different particle interaction types in other 3D-tracking detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Pan-sharpening for microscopy

Techniques for generating full-spatial resolution, full spectral resolution image(s) from a 3D spectral-data cube for any spectral value within a given spectral range are provided without requiring the acquisition of all full-spatial resolution, full spectral resolution data by an instrument. The 3D spectral-data cube is generated from a limited number of full-spatial resolution, sparse spectral resolution data and a sparse-spatial resolution, full-spectral resolution data of the same area of the sample. The use of the 3D spectral-data cube reduces the data acquisition time.

Ovchinnikova, Olga S.↗
DOE OSTI2020

Bayesian Approach to Estimation of Water Table Elevations Using Historical Rasters as Prior Information 2019 - 20430

In cases of complex but only partially known geology and a lack of spatial control in observation well locations, water table elevation estimation is very challenging. In some cases, auxiliary information, such as observations of the movement of tracers, operation of injection and extraction wells, and calibration of groundwater models against the historical elevation data, can be combined with expert judgement to estimate flow directions in areas of sparse data and to aid in the production of more reliable contour maps (and associated rasters) than could be produced by relying on sparse well elevation data alone. Given a historical sequence of these raster maps, the question arises how to automate, to the extent possible, the process of producing new raster maps to reflect data from previous times, the current data and the operation of expert judgement. One solution is to adopt a Bayesian point of view and to regard the historical well elevation data, auxiliary information and historical raster maps as prior information. The well elevations for water table wells, as well as those for injection/extraction wells and the data associated with other relevant variables, can be viewed as predictors for the raster surface. From this prior information, we can, conditional on the values of these predictors for a new time period, compute an expected value map and a standard deviation map for the new raster. These then can be taken to specify a prior predictive distribution for the pixels in the new raster map. Then we condition the pixels, corresponding to water level observation wells within the raster, on the observed values in those wells (which in general will differ from the regression estimate) for the new time period. Given the smoothness of the water table surface, we then smooth the surface of deviations from the mean surface, based on the variograms of the historical rasters, and add this smoothed surface to the regression mean surface. The error structure of the produced raster map is defined by the regression error structure and the error due to smoothing based on the estimated variograms. This methodology has been developed and is being further refined for groundwater monitoring and remediation at LANL. It is a very flexible method that can also be applied with a variety of other predictors applied to model the water level wells in the area of interest over the historical record. The smoothness of the spatial process and its possible evolution over time can then be estimated from the residuals from this regression. This can be augmented by expert hydrogeological opinion based on site topography and hydrogeology. (authors)

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Machine Learning for DUNE Supernova Trigger

One of the major scientific goals of the Deep Underground Neutrino Experiment (DUNE) is to detect and measure the neutrino flux originating from galactic core-collapse supernovae. These neutrinos provide an opportunity to study the end of life evolution of massive stars, and reveal information about the structure of core-collapse that is not visible in observations of the electromagnetic spectrum. Because of the rarity of these events, it is crucial that DUNE is able to detect supernova neutrino interactions when they occur. However, this will require sifting through a large quantity of data, motivating the development of a trigger algorithm to identify significant events and discard irrelevant data. Machine learning provides a potential approach to building this trigger. This project generates ADC and ground truth images of simulated neutrino interactions in a LArTPC detector to be used for machine learning, and uses them to train a sparse Convolutional Neural Network (C NN). The performance of this model when applied to the task of pixel classification based on interaction type is examined. This project found that the sparse CNN approach has the potential to have high accuracy in pixel classification, meaning it may be highly relevant to the development of a supernova neutrino trigger for the DUNE far detector.

Damish, S.↗
DOE OSTI2025

Heterogeneous Point Set Transformers for Segmentation of Multiple View Particle Detectors

NOvA is a long-baseline neutrino oscillation experiment that detects neutrino particles from the NuMI beam at Fermilab. Before data from this experiment can be used in analyses, raw hits in the detector must be matched to their source particles, and the type of each particle must be identified. This task has commonly been done using a mix of traditional clustering approaches and convolutional neural networks (CNNs). Due to the construction of the detector, the data is presented as two sparse 2D images: an XZ and a YZ view of the detector, rather than a 3D representation. We propose a point set neural network that operates on the sparse matrices with an operation that mixes information from both views. Our model uses less than 10% of the memory required using previous methods while achieving a 96.8% AUC score, a higher score than obtained when both views are processed independently (85.4%).

Robles, Edgar E. [UC, Irvine (main)]↗
DOE OSTI2026

Quantum block encoding for one-pair semiseparable matrices

Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices. In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diagonal factors. To encode the matrix, the algorithm needs $2\log(N)+7$ ancillary qubits. Assuming that the data input oracles can be implemented with polylogarithmic depth, or that a QRAM input model is available, our proposed method requires $\mathcal{O}({\rm polylog} (N))$ time and has an error of $\mathcal{O}(N^2)$, where $N$ is the matrix size.

Antonioli, Giacomo [Pisa U.; CERN] (ORCID:00090000↗
DOE OSTI2025

A Parametric, Data-Driven, Non-Intrusive Reduced-Order Model Framework for Crystal Plasticity Simulations of Voids

The influence of the internal structure at micrometer length scales on the deformation of polycrystalline materials can be effectively captured using crystal plasticity finite element methods (CPFEM). However, the complexity and nonlinearity of the deformation equations CPFEM solves demand significant computational power and resources to achieve accurate predictions, limiting its broader application. To address this challenge, we have identified a reduced-order representation of the complex data in order to establish a computationally efficient reduced-order models (ROM) and drastically reduce the computational expense of CPFEM. Specifically, in this work, we developed a parametric, data-driven, and non-intrusive ROM framework for CPFEM using proper orthogonal decomposition (POD) and sparse variational Gaussian process (SVGP) regression for single-crystal microstructures under tensile loading conditions. The developed protocol enables one to compress field into a latent/low-dimensional space described by principal component analysis (PCA) via the singular value decomposition (SVD) algorithm. As a result, the high-dimensional data are reduced to a significantly smaller amount of dimensions with POD bases and POD coefficients. Furthermore, we deployed an ensemble of SVGPs—extended from the classical Gaussian process (GP) regression for scalability and handling big data—in a massively parallel manner to train and predict latent POD coefficients using known POD bases from a set of previously obtained simulations results. Lastly, using the predicted POD coefficients, we reconstructed the full-field results and showed reasonable agreement compared with the true values obtained from running CPFEM. The developed framework is validated with a set of CPFEM simulations of a single embedded void in single-crystal aluminum alloy. While the framework is broadly applicable, this work specifically focuses on single-crystal microstructures, a single load case (e.g., tensile), and a specific void geometry (spherical).

Anisotropy↗
DOE OSTI2021

Seasonal Disorder in Urban Traffic Patterns: A Low Rank Analysis

This article proposes several advances to sparse nonnegative matrix factorization (SNMF) as a way to identify large-scale patterns in urban traffic data. The input to our model is traffic counts organized by time and location. Nonnegative matrix factorization additively decomposes this information, organized as a matrix, into a linear sum of temporal signatures. Penalty terms encourage this factorization to concentrate on only a few temporal signatures, with weights which are not too large. Our interest here is to quantify and compare the regularity of traffic behavior, particularly across different broad temporal windows. In addition to the rank and error, we adapt a measure introduced by Hoyer to quantify sparsity in the representation. Combining these, we construct several curves which quantify error as a function of rank (the number of possible signatures) and sparsity; as rank goes up and sparsity goes down, the approximation can be better and the error should decreases. Plots of several such curves corresponding to different time windows leads to a way to compare disorder/order at different time scalewindows. In this paper, we apply our algorithms and procedures to study a taxi traffic dataset from New York City. In this dataset, we find weekly periodicity in the signatures, which allows us an extra framework for identifying outliers as significant deviations from weekly medians. We then apply our seasonal disorder analysis to the New York City traffic data and seasonal (spring, summer, winter, fall) time windows. We do find seasonal differences in traffic order.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Forward sensitivity analysis and mode dependent control for closure modeling of Galerkin systems

Model reduction by projection-based approaches is often associated with losing some of the important features that contribute towards the dynamics of the retained scales. As a result, a mismatch occurs between the predicted trajectories of the original system and the truncated one. We put forth a framework to apply a continuous time control signal in the latent space of the reduced order model (ROM) to account for the effect of truncation. We set the control input using parameterized models by following energy transfer principles. Our methodology relies on observing the system behavior in the physical space and using the projection operator to restrict the feedback signal into the latent space. Then, we leverage the forward sensitivity method (FSM) to derive relationships between the feedback and the desired mode-dependent control. We test the performance of the proposed approach using two test cases, corresponding to viscous Burgers and vortex merger problems at high Reynolds number. Results show that the ROM trajectory with the applied FSM control closely matches its target values in both the data-dense and data-sparse regimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Non-intrusive reduced-order modeling for dynamical systems with spatially localized features

This work presents a non-intrusive reduced-order modeling framework for dynamical systems with spatially localized features characterized by slow singular value decay. The proposed approach builds upon two existing methodologies for reduced and full-order non-intrusive modeling, namely Operator Inference (OpInf) and sparse Full-Order Model (sFOM) inference. We decompose the domain into two complementary subdomains that exhibit fast and slow singular value decay. The dynamics of the subdomain exhibiting slow singular value decay are learned with sFOM while the dynamics with intrinsically low dimensionality on the complementary subdomain are learned with OpInf. The resulting, coupled OpInf-sFOM formulation leverages the computational efficiency of OpInf and the high resolution of sFOM, and thus enables fast non-intrusive predictions for conditions beyond those sampled in the training data set. A novel regularization technique with a closed-form solution based on the Gershgorin disk theorem is introduced to promote stable sFOM and OpInf models. We also provide a data-driven indicator for subdomain selection and ensure solution smoothness over the interface via a post-processing interpolation step. We evaluate the efficiency of the approach in terms of offline and online speedup through a quantitative, parametric computational cost analysis. We demonstrate the coupled OpInf-sFOM formulation for two test cases: a one-dimensional Burgers’ model for which accurate predictions beyond the span of the training snapshots are presented, and a two-dimensional parametric model for the Pine Island Glacier ice thickness dynamics, for which the OpInf-sFOM model achieves an average prediction error on the order of 1% with an online speedup factor of approximately 8$\times$ compared to the numerical simulation.

42 ENGINEERING↗
DOE OSTI2021

A nudged hybrid analysis and modeling approach for realtime wake-vortex transport and decay prediction

Here, we put forth a long short-term memory (LSTM) nudging framework for the enhancement of reduced order models (ROMs) of fluid flows utilizing noisy measurements for air traffic improvements. Toward emerging applications of digital twins in aviation, the proposed approach allows for constructing a realtime predictive tool for wake-vortex transport and decay systems. We build on the fact that in realistic application, there are uncertainties in initial and boundary conditions, model parameters, as well as measurements. Moreover, conventional nonlinear ROMs based on Galerkin projection (GROMs) suffer from imperfection and solution instabilities, especially for advection-dominated flows with slow decay in the Kolmogorov n-width. In the presented LSTM nudging (LSTM-N) approach, we fuse forecasts from a combination of imperfect GROM and uncertain state estimates, with sparse Eulerian sensor measurements to provide more reliable predictions in a dynamical data assimilation framework. We illustrate our concept by solving the two-dimensional vorticity transport equation. We investigate the effects of measurements noise and state estimate uncertainty on the performance of the LSTM-N behavior. We also demonstrate that it can sufficiently handle different levels of temporal and spatial measurement sparsity, and offer a huge potential in developing next-generation digital twin technologies for aerospace applications.

42 ENGINEERING↗