Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Reconstruction algorithms”

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 991 records · Page 55

Stochastic microstructural analysis of ceramic matrix composites using a high-fidelity multiscale framework

This paper presents a high-fidelity multiscale framework to simulate the mechanical behavior of ceramic matrix composites (CMCs), accounting for the complex micromorphology captured using detailed material characterization. First, high-resolution micrographs are obtained for the specific carbon fiber silicon-carbide-nitride matrix (C/SiNC) CMC to characterize the variability of the architectural features and manufacturing-induced defects at the microscale. An image processing algorithm is then used to precisely estimate the size and distribution of all subscale features and defects from the micrographs. The information is then used to generate a three-dimensional stochastic representative volume element (SRVE) to reconstruct microscale constituents accounting for the variability. As a result, the generated SRVEs are simulated using the high-fidelity generalized method of cells (HFGMC) micromechanics theory to investigate the effects of defects on the elastic properties of C/SiNC CMCs.

Ceramic Matrix Composites↗

Geometric and radiometric preprocessing of airborne visible/infrared imaging spectrometer (AVIRIS) data in rugged terrain for quantitative data analysis

A geocoding procedure for remotely sensed data of airborne systems in rugged terrain is affected by several factors: buffeting of the aircraft by turbulence, variations in ground speed, changes in altitude, attitude variations, and surface topography. The current investigation was carried out with an Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) scene of central Switzerland (Rigi) from NASA's Multi Aircraft Campaign (MAC) in Europe (1991). The parametric approach reconstructs for every pixel the observation geometry based on the flight line, aircraft attitude, and surface topography. To utilize the data for analysis of materials on the surface, the AVIRIS data are corrected to apparent reflectance using algorithms based on MODTRAN (moderate resolution transfer code).

Meyer, Peter↗

Modeling of Non-Spherical Droplet Dynamics

A two-dimensional time-dependent computer code based on the modified Arbitrary Lagrangian Eulerian (ALE) technique, has been developed to simulate non-spherical droplet dynamics and evaporation under convective flows at real rocket combustion chamber conditions. The equations of mass, momentum, energy and species are simultaneously solved for both liquid and gas phases with an accurate dynamic interface tracking. The jump boundary conditions across the deforming droplet surface are obtained by applying the integral forms of conservation of mass, momentum, and energy. At each time step, the interface geometry and flow properties at the droplet surface are implicitly solved by satisfying the interface boundary conditions. A Lagrangian technique was developed to track the arbitrarily moving interface between the liquid droplet and the external gas. An elliptic grid generator is adopted to dynamically reconstruct grids both inside and outside the droplet surface. This code has been used to study droplet oscillation, droplet deformation/breakup, nonspherical droplet evaporation in both low and high pressure convective flows. This presentation briefly describes the numerical algorithm for modeling of the nonspherical droplet dynamics and demonstrates the representative simulation results of nonspherical droplet evaporation at low and high pressure convective flows. Potential applications of this code to rocket combustor design and performance predictions are discussed.

Deng, Zheng-Tao↗

Locating the Discontinuities of a Bounded Function by the Partial Sums of its Fourier Series I: Periodical Case

A key step for some methods dealing with the reconstruction of a function with jump discontinuities is the accurate approximation of the jumps and their locations. Various methods have been suggested in the literature to obtain this valuable information. In the present paper, we develop an algorithm based on identities which determine the jumps of a 2(pi)-periodic bounded not-too-highly oscillating function by the partial sums of its differentiated Fourier series. The algorithm enables one to approximate the locations of discontinuities and the magnitudes of jumps of a bounded function. We study the accuracy of approximation and establish asymptotic expansions for the approximations of a 27(pi)-periodic piecewise smooth function with one discontinuity. By an appropriate linear combination, obtained via derivatives of different order, we significantly improve the accuracy. Next, we use Richardson's extrapolation method to enhance the accuracy even more. For a function with multiple discontinuities we establish simple formulae which "eliminate" all discontinuities of the function but one. Then we treat the function as if it had one singularity following the method described above.

Kvernadze, George↗

Factorization of Binary Matrices: Rank Relations, Uniqueness and Model Selection of Boolean Decomposition

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we examine the factorizations of binary matrices using standard arithmetic (real and nonnegative) and logical operations (Boolean and $\mathbb{Z}$ 2 ). We examine the relationships between the different ranks, and discuss when factorization is unique. In particular, we characterize when a Boolean factorization X = W$\land$H has a unique W, a unique H (for a fixed W), and when both W and H are unique, given a rank constraint. We introduce a method for robust Boolean model selection, called BMFk, and show on numerical examples that BMFk not only accurately determines the correct number of Boolean latent features but reconstruct the pre-determined factors accurately.

97 MATHEMATICS AND COMPUTING↗

High-performance data format for scientific data storage and analysis

Here, in this article, we present the High-Performance Output (HiPO) data format developed at Jefferson Laboratory for storing and analyzing data from Nuclear Physics experiments. The format was designed to efficiently store large amounts of experimental data, utilizing modern fast compression algorithms. The purpose of this development was to provide organized data in the output, facilitating access to relevant information within the large data files. The HiPO data format has features that are suited for storing raw detector data, reconstruction data, and the final physics analysis data efficiently, eliminating the need to do data conversions through the lifecycle of experimental data. The HiPO data format is implemented in C++ and JAVA, and provides bindings to FORTRAN, Python, and Julia, providing users with the choice of data analysis frameworks to use. In this paper, we will present the general design and functionalities of the HiPO library and compare the performance of the library with more established data formats used in data analysis in High Energy and Nuclear Physics (such as ROOT and Parquete). In columnar data analysis, HiPO surpasses established data formats in performance and can be effectively applied to data analysis in other scientific fields.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Pileup mitigation at CMS in 13 TeV data

With increasing instantaneous luminosity at the LHC come additional reconstruction challenges. At high luminosity, many collisions occur simultaneously within one proton-proton bunch crossing. The isolation of an interesting collision from the additional “pileup” collisions is needed for effective physics performance. In the CMS Collaboration, several techniques capable of mitigating the impact of these pileup collisions have been developed. Such methods include charged-hadron subtraction, pileup jet identification, isospin-based neutral particle “δβ” correction, and, most recently, pileup per particle identification. This paper surveys the performance of these techniques for jet and missing transverse momentum reconstruction, as well as muon isolation. The analysis makes use of data corresponding to 35.9 fb−1 collected with the CMS experiment in 2016 at a center-of-mass energy of 13 TeV. The performance of each algorithm is discussed for up to 70 simultaneous collisions per bunch crossing. Significant improvements are found in the identification of pileup jets, the jet energy, mass, and angular resolution, missing transverse momentum resolution, and muon isolation when using pileup per particle identification.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Can Machine Learning Reveal Precursors of Reversals of the Geomagnetic Axial Dipole Field?

It is well known that the axial dipole part of Earth’s magnetic field reverses polarity, so that the magnetic North Pole becomes the South Pole and vice versa. The timing of reversals is well documented for the past 160 Myr, but the conditions that lead to a reversal are still not well understood. It is not known if there are reliable ‘precursors’ of reversals (events that indicate that a reversal is upcoming) or what they might be. We investigate if machine learning (ML) techniques can reliably identify precursors of reversals based on time-series of the axial magnetic dipole field. The basic idea is to train a classifier using segments of time-series of the axial magnetic dipole. This training step requires modification of standard ML techniques to account for the fact that we are interested in rare events—a reversal is unusual, while a non-reversing field is the norm. Without our tweak, the ML classifiers lead to useless predictions. Perhaps even more importantly, the usable observational record is limited to 0–2 Ma and contains only five reversals, necessitating that we determine if the data are even sufficient to reliably train and validate an ML algorithm. To answer these questions we use several ML classifiers (linear/non-linear support vector machines and long short-term memory networks), invoke a hierarchy of numerical models (from simplified models to 3-D geodynamo simulations), and two palaeomagnetic reconstructions (PADM2M and Sint-2000). The performance of the ML classifiers varies across the models and the observational record and we provide evidence that this is not an artefact of the numerics, but rather reflects how ‘predictable’ a model or observational record is. Studying models of Earth’s magnetic field via ML classifiers thus can help with identifying shortcomings or advantages of the various models. For Earth’s magnetic field, we conclude that the ability of ML to identify precursors of reversals is limited, largely due to the small amount and low frequency resolution of data, which makes training and subsequent validation nearly impossible. Put simply: the ML techniques we tried are not currently capable of reliably identifying an axial dipole moment (ADM) precursor for geomagnetic reversals. This does not necessarily imply that such a precursor does not exist, and improvements in temporal resolution and length of ADM records may well offer better prospects in the future.

Kyle Gwirtz↗

Semantic segmentation with a sparse convolutional neural network for event reconstruction in MicroBooNE

We present the performance of a semantic segmentation network, SparseSSNet, that provides pixel-level classification of MicroBooNE data. The MicroBooNE experiment employs a liquid argon time projection chamber for the study of neutrino properties and interactions. SparseSSNet is a submanifold sparse convolutional neural network, which provides the initial machine learning based algorithm utilized in one of MicroBooNE's ν e -appearance oscillation analyses. The network is trained to categorize pixels into five classes, which are re-classified into two classes more relevant to the current analysis. The output of SparseSSNet is a key input in further analysis steps. This technique, used for the first time in liquid argon time projection chambers data and is an improvement compared to a previously used convolutional neural network, both in accuracy and computing resource utilization. Here, the accuracy achieved on the test sample is ≥ 99%. For full neutrino interaction simulations, the time for processing one image is ≈ 0.5 sec, the memory usage is at 1 GB level, which allows utilization of most typical CPU worker machine.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improving the MODIS LAI Compositing Using Prior Time-Series Information

The Moderate Resolution Imaging Spectroradiometer (MODIS) long-term leaf area index (LAI) products have significantly contributed to global energy fluxes, climate change, and biogeochemistry research. However, the maximum fraction of photosynthetically active radiation absorbed by vegetation (Max-FPAR) compositing strategy of the Collection 6 (C6) products dictates that the main or backup algorithm is always triggered by observations of different quality, which indirectly causes the observed instability in the LAI time-series. Based on MODIS daily LAI retrievals, this study develops a prior knowledge time-series compositing algorithm (PKA) using a linear kernel driven (LKD) model. Our results show that the newly proposed PKA can significantly improve the LAI composites compared to the Max-FPAR strategy using ground-based observations for validation. We found that the PKA performs better than Max-FPAR in various aspects (different sites, seasons, and retrieval index (RI) ranges), with R2 increasing from 0.69 to 0.76 and root means square error (RMSE) decreasing from 1.01 to 0.84 compared to GBOV ground truth. The same improvement was shown for the ground truth LAIs measured at the Honghe and Hailun sites in northeastern China, with R2 increasing from 0.23 to 0.41 and RMSE decreasing from 1.27 to 1.25. In addition, three newly proposed temporal uncertainty metrics (time-series stability, TSS and time-series anomaly, TSA and reconstruction error metric, RE (the proximity to the main RT-based retrievals)) were applied to compare the stability of LAI time-series before and after PKA implementation. We found that the time series stability of PKA LAI was improved, the time series anomalies were reduced, and the retrieval rates of the main algorithm were also greatly enhanced compared to Max-FPAR LAI. A case intercomparison for Max-FPAR-MODIS, Max-FPAR-VIIRS (Visible Infrared Imager Radiometer Suite), and PKA-MODIS LAIs in the Amazon Forest region showed that the PKA is also effective in improving the LAI retrieval over large regions with few qualified observations due to poor atmospheric conditions (RE decreased from 2.37/2.35 (Max-FPAR-MODIS/Max-FPAR-VIIRS) to 2.25 (PKA-MODIS) and RI increased from 61.94%/59.62% to 66.88%). The same improvement was seen in the BELMANIP 2.1 sites for almost all biomes except deciduous broadleaf forest, where the RE decreased from 1.85/2.13 to 1.15 overall. We note that the PKA has the potential to be easily implemented in the operational algorithms of subsequent MODIS and MODIS-like LAI Collections.

MODIS↗

Challenges in solving structures from radiation-damaged tomograms of protein nanocrystals assessed by simulation

Structure-determination methods are needed to resolve the atomic details that underlie protein function. X-ray crystallography has provided most of our knowledge of protein structure, but is constrained by the need for large, well ordered crystals and the loss of phase information. The rapidly developing methods of serial femtosecond crystallography, micro-electron diffraction and single-particle reconstruction circumvent the first of these limitations by enabling data collection from nanocrystals or purified proteins. However, the first two methods also suffer from the phase problem, while many proteins fall below the molecular-weight threshold required for single-particle reconstruction. Cryo-electron tomography of protein nanocrystals has the potential to overcome these obstacles of mainstream structure-determination methods. Here, a data-processing scheme is presented that combines routines from X-ray crystallography and new algorithms that have been developed to solve structures from tomograms of nanocrystals. This pipeline handles image-processing challenges specific to tomographic sampling of periodic specimens and is validated using simulated crystals. The tolerance of this workflow to the effects of radiation damage is also assessed. The simulations indicate a trade-off between a wider tilt range to facilitate merging data from multiple tomograms and a smaller tilt increment to improve phase accuracy. Since phase errors, but not merging errors, can be overcome with additional data sets, these results recommend distributing the dose over a wide angular range rather than using a finer sampling interval to solve the protein structure.

59 BASIC BIOLOGICAL SCIENCES↗

Real Time Data Analysis With the ATLAS Trigger at the LHC in Run-2

The trigger selection capabilities of the ATLAS detector have been significantly enhanced for the LHC Run- 2 in order to cope with the higher event rates and with the large number of simultaneous interactions (pile-up) per protonproton bunch crossing. A new hardware system, designed to analyse real time event-topologies at Level-1 came to full use in 2017. A hardware-based track reconstruction system, expected to be used real-time in 2018, is designed to provide track information to the high-level software trigger at its full input rate. The high-level trigger selections are largely relying on offline-like reconstruction techniques, and in some cases multivariate analysis methods. Despite the sudden change in LHC operations during the second half of 2017, which caused an increase in pile-up and therefore also in CPU usage of the trigger algorithms, the set of triggers (so called trigger menu) running online has undergone only minor modifications thanks to the robustness and redundancy of the trigger system, and the use of a levelling luminosity scheme in agreement with LHC and other experiments. Here, this presentation gives a brief yet comprehensive review of the real-time performance of the ATLAS trigger system in 2017. Considerations will be presented on the most relevant parameters of the trigger (efficiency to collect signal and output data rate) as well as details on some aspects of the algorithms which are run real-time on the High Level Trigger CPU farm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Combined approach to the Hubble Space Telescope wave-front distortion analysis

Stellar images taken by the HST at various focus positions have been analyzed to estimate wave-front distortion. Rather than using a single algorithm, we found that better results were obtained by combining the advantages of various algorithms. For the planetary camera, the most accurate algorithms consistently gave a spherical aberration of -0.290-micron rms with a maximum deviation of 0.005 micron. Evidence was found that the spherical aberration is essentially produced by the primary mirror. The illumination in the telescope pupil plane was reconstructed and evidence was found for a slight camera misalignment.

Roddier, Claude↗

A Detection Pipeline for Galactic Binaries in LISA Data

The Galaxy is suspected to contain hundreds of millions of binary white dwarf systems, a large fraction of which will have sufficiently small orbital period to emit gravitational radiation in band for space-based gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA). LISA's main science goal is the detection of cosmological events (supermassive black hole mergers) etc.) however the gravitational signal from the galaxy will be the dominant contribution to the data - including instrumental noise - over approximately two decades in frequency. The catalogue of detectable binary systems will serve as an unparalleled means of studying the Galaxy. Furthermore, to maximize the scientific return from the mission, the data must be "cleansed" of the galactic foreground. We will present an algorithm that can accurately resolve and subtract greater than or equal to 10000 of these sources from simulated data supplied by the Mock LISA Data Challenge Task Force. Using the time evolution of the gravitational wave frequency, we will reconstruct the position of the recovered binaries and show how LISA will sample the entire compact binary population in the Galaxy.

Littenberg, Tyson B.↗

Applications of an adaptive unstructured solution algorithm to the analysis of high speed flows

An upwind cell-centered scheme for the solution of steady laminar viscous high-speed flows is implemented on unstructured two-dimensional meshes. The first-order implementation employs Roe's (1981) approximate Riemann solver, and a higher-order extension is produced by using linear reconstruction with limiting. The procedure is applied to the solution of inviscid subsonic flow over an airfoil, inviscid supersonic flow past a cylinder, and viscous hypersonic flow past a double ellipse. A detailed study is then made of a hypersonic laminar viscous flow on a 24-deg compression corner. It is shown that good agreement is achieved with previous predictions using finite-difference and finite-volume schemes. However, these predictions do not agree with experimental observations. With refinement of the structured grid at the leading edge, good agreement with experimental observations for the distributions of wall pressure, heating rate and skin friction is obtained.

Thareja, R. R.↗

Experimental tests of range-profiling algorithms

The natural tendency in the design of a spaceborne weather radar is to select frequencies at 10 GHz or higher. A major disadvantage of this approach is that increased attenuation limits the maximum rain rate that can be accurately estimated. Here, a way to lessen this problem is suggested which uses estimates of path attenuation to reconstruct a profile of the rain rate.

Meneghini, R.↗

Measurement of the jet mass in hadronic decays of boosted W bosons at 13 TeV and extraction of the W boson mass

The jet mass of W bosons decaying to a quark-antiquark pair is measured in W+jets events from proton-proton collisions at a center-of-mass energy of 13 TeV. The data used were collected by the CMS experiment at the CERN LHC and correspond to an integrated luminosity of 138 fb −1 . Hadronic decays of W bosons with high momenta produce strongly collimated decay products due to the large Lorentz boost, and are reconstructed as single large-radius jets. These jets have a characteristic substructure that is exploited to distinguish them from the large background of quark- and gluon-initiated jets. The jet mass is computed using the soft-drop algorithm, which suppresses soft wide-angle radiation that leads to a broadening of the jet mass distribution. For the first time, unfolded measurements are presented of the double-differential W+jets cross section as a function of the jet transverse momentum and soft-drop mass. From these distributions, the W boson mass is obtained, with a value of 80.83 ± 0.55 GeV in a scheme with mass-dependent width, achieving the smallest uncertainty available today from an all-jets final state at a hadron collider.

hadron-hadron scattering↗

An ODE-Enabled Distributed Transient Stability Analysis for Networked Microgrids

Networked microgrid (NMG) exhibits noteworthy resiliency and flexibility benefits for the mutual support from neighboring microgrids. With high penetration of distributed energy resources (DERs) and the associated controls, the transient stability analysis of NMGs is of critical significance. To address the issues of computation burdens and privacy in the centralized transient analysis, this paper devises an ordinary differential equation (ODE)-enabled distributed transient stability (DTS) methodology for NMGs. First, an ODE-based microgrid model is established to capture the dynamics in the droop control of DERs as well as network and load. Further, a distributed DTS is devised for the ODE representation of an NMG, allowing a privacy-preserving transient analysis of each microgrid while accurately reconstructing the frequency dynamics under droop controls in all DERs. In conclusion, extensive tests are performed to verify the validity of the ODE-based microgrid model through both dynamic response and eigenvalue analysis, and the efficacy of the DTS algorithm in simulating the large signal responses and the frequent fluctuations in NMG.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗