Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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 919 records · Page 51

FEASTPACK v. 1.0

The software implements the generative graph algorithm described in the following reference: T. G. Kolda, A. Pinar, T. Plantenga and C. Seshadhri. A Scalable Generative Graph Model with Community Structure, arXiv:1302.6636, March 2013, http:l/arxiv.org/abs/1302.6636. The software also implements the clustering coefficient algorithms described in C. Seshadhri, A. Pinar and T. G. Kolda. Triadic Measures on Graphs: The Power of Wedge Sampling, in Proc. 2013 SIAM International Conference on Data Mining {SDM), May 2013.

Source record↗

Calibration of the Modulation Transfer Function of Surface Profilometers with Binary Pseudorandom Test Standards: Expanding the Application Range to Fizeau Interferometers and Electron Microscopes

A modulation transfer function (MTF) calibration method based on binary pseudorandom (BPR) gratings and arrays has been proven to be an effective MTF calibration method for interferometric microscopes and a scatterometer. Here we report on a further expansion of the application range of the method. We describe the MTF calibration of a 6 in. phase shifting Fizeau interferometer. Beyond providing a direct measurement of the interferometer's MTF, tests with a BPR array surface have revealed an asymmetry in the instrument's data processing algorithm that fundamentally limits its bandwidth. Moreover, the tests have illustrated the effects of the instrument's detrending and filtering procedures on power spectral density measurements. The details of the development of a BPR test sample suitable for calibration of scanning and transmission electron microscopes are also presented. Such a test sample is realized as a multilayer structure with the layer thicknesses of two materials corresponding to the BPR sequence. The investigations confirm the universal character of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SHMTools: Structural Health Monitoring Software for Aerospace, Civil, and Mechanical Infrastructure

Structural Health Monitoring (SHM) involves a multitude of processes designed to detect damage in situ on various types of structures, from aircraft and buildings to bridges and mechanical infrastructure. In an early example of SHM, railroad wheeltappers used a hammer to strike train wheels to determine if there was damage present. At Los Alamos, scientists have developed SHMTools, a software suite that provides more than 100 advanced algorithms that quickly prototype and evaluate damage-detection processes. The software consists of modular MATLAB routines covering the three main stages of SHM: data acquisition, feature extraction, and feature classification. Multiple sensing modalities are supported, including acceleration, strain, and guided-wave data, all of which have been widely used in SHM practice.

42 ENGINEERING↗

Online data-enabled predictive control

We develop an online data-enabled predictive (ODeePC) control method for optimal control of unknown systems, building on the recently proposed DeePC (Coulson et al., 2019). Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. The proposed ODeePC conceptual-wise resembles standard adaptive system identification and model predictive control (MPC), but it provides a new alternative for the standard methods. ODeePC is enabled by computationally efficient methods that exploit the special structure of the Hankel matrices in the context of DeePC with Fast Fourier Transform (FFT) and primal-dual algorithm We provide theoretical guarantees regarding the asymptotic behavior of ODeePC, and we demonstrate its performance through numerical examples.

97 MATHEMATICS AND COMPUTING↗

Elastic and resonance structures of the nucleon from the hadronic tensor in lattice QCD: Implications for neutrino-nucleon scattering and hadron physics

We compute the Euclidean hadronic tensor from charge density operators and extract elastic and resonance structures by employing exponential fits to the four-point function correlator, as well as a Bayesian reconstruction inverse algorithm to obtain the corresponding spectral density for qualitative comparison. We present the determination of the nucleon’s Sachs electric form factor using the hadronic tensor formalism and verify that it is consistent with that from the conventional three-point function calculation. Beyond the elastic peak, we observe a structure located approximately 0.5–0.7 GeV above the nucleon mass in the Bayesian reconstruction. This structure is interpreted as a mixture of the Roper resonance [𝑁⁡(1440)], and states with both positive and negative parities in this mass region, as well as multihadron states. Assuming the observed structure is dominated by 𝐽 𝑃 = 1/2 ± states, we extract the transition electric form factor 𝐺$^*_𝐸$⁡(𝑄 2 ) and the corresponding longitudinal helicity amplitude 𝑆 1/2 ⁡(𝑄 2 ), and compare them with those determined from the CLAS experimental data of nucleon-to-Roper transition. Although fitting to the four-point correlation function or using the inverse algorithm does not resolve individual resonances, it nevertheless enables the determination of total inclusive lepton–nucleon scattering cross sections in appropriate energy bins. This lattice QCD calculation presents the first major step toward studying the inclusive 𝑁 → 𝑋 contributions within the hadronic tensor formalism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The gravitational lensing imprints of DES Y3 superstructures on the CMB: a matched filtering approach

Low-density cosmic voids gravitationally lens the cosmic microwave background (CMB), leaving a negative imprint on the CMB convergence |$\kappa$|⁠. This effect provides insight into the distribution of matter within voids, and can also be used to study the growth of structure. We measure this lensing imprint by cross-correlating the Planck CMB lensing convergence map with voids identified in the Dark Energy Survey Year 3 (DES Y3) data set, covering approximately 4200 deg|$^2$| of the sky. We use two distinct void-finding algorithms: a 2D void-finder that operates on the projected galaxy density field in thin redshift shells, and a new code, Voxel, which operates on the full 3D map of galaxy positions. We employ an optimal matched filtering method for cross-correlation, using the Marenostrum Institut de Ciències de l’Espai N-body simulation both to establish the template for the matched filter and to calibrate detection significances. Using the DES Y3 photometric luminous red galaxy sample, we measure |$A_\kappa$|⁠, the amplitude of the observed lensing signal relative to the simulation template, obtaining |$A_\kappa = 1.03 \pm 0.22$| (⁠|$4.6\sigma$| significance) for Voxel and |$A_\kappa = 1.02 \pm 0.17$| (⁠|$5.9\sigma$| significance) for 2D voids, both consistent with Lambda cold dark matter expectations. We additionally invert the 2D void-finding process to identify superclusters in the projected density field, for which we measure |$A_\kappa = 0.87 \pm 0.15$| (⁠|$5.9\sigma$| significance). The leading source of noise in our measurements is Planck noise, implying that data from the Atacama Cosmology Telescope, South Pole Telescope and CMB-S4 will increase sensitivity and allow for more precise measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

Neutral Current Elastic Scattering and the Strange Spin Structure of the Proton

Neutrinos can be used as a unique and informative probe of the structure within nucleons. This thesis presents the tools and methodology for studying the strange quark spin in the nucleon through neutral current elastic neutrino-proton scattering in the MicroBooNE experiment located at the Fermi National Accelerator Lab. An automated boosted decision tree based proton identification algorithm is used to select proton in liquid argon TPC data with a 70\% efficiency. After a set of protons are selected, a logistic regression model is used to select neutral current elastic proton interactions in MicroBooNE. Neutral current elastic proton interactions are selected with an 11\% efficiency and 30\% purity. The number of selected events measured in MicroBooNE data as a function of $Q^2$ is compared directly to the number of selected events in MicroBooNE simulation. An event reweighting scheme is used to vary the expected number of eventsin MicroBooNE simulation based on the values o f the physics parameters of interest. The likelihood for any given value of the physical parameters can then be easily calculated and the probability distributions of the physics parameters can be sampled using Markov Chain Monte Carlo. Future improvements to the detector physics models in MicroBooNE are required for a precise determination of the strange quark spin structure in the proton. With the current level of uncertainty on the detector physics models, we are only able to constrain the net strange quark spin, $\Delta s$ to the range $-1.8 < \Delta s < 3.8$ with 95\% confidence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

IMAGING THE EPOCH OF REIONIZATION: LIMITATIONS FROM FOREGROUND CONFUSION AND IMAGING ALGORITHMS

Tomography of redshifted 21 cm transition from neutral hydrogen using Fourier synthesis telescopes is a promising tool to study the Epoch of Reionization (EoR). Limiting the confusion from Galactic and extragalactic foregrounds is critical to the success of these telescopes. The instrumental response or the point-spread function (PSF) of such telescopes is inherently three dimensional with frequency mapping to the line-of-sight (LOS) distance. EoR signals will necessarily have to be detected in data where continuum confusion persists; therefore, it is important that the PSF has acceptable frequency structure so that the residual foreground does not confuse the EoR signature. This paper aims to understand the three-dimensional PSF and foreground contamination in the same framework. We develop a formalism to estimate the foreground contamination along frequency, or equivalently LOS dimension, and establish a relationship between foreground contamination in the image plane and visibility weights on the Fourier plane. We identify two dominant sources of LOS foreground contamination-'PSF contamination' and 'gridding contamination'. We show that PSF contamination is localized in LOS wavenumber space, beyond which there potentially exists an 'EoR window' with negligible foreground contamination where we may focus our efforts to detect EoR. PSF contamination in this window may be substantially reduced by judicious choice of a frequency window function. Gridding and imaging algorithms create additional gridding contamination and we propose a new imaging algorithm using the Chirp Z Transform that significantly reduces this contamination. Finally, we demonstrate the analytical relationships and the merit of the new imaging algorithm for the case of imaging with the Murchison Widefield Array.

79 ASTRONOMY AND ASTROPHYSICS↗

Issues in Equation of State data generation for Hot Dense MatterA Note on Generalized Radial Mesh Generation for Plasma Electronic Structure

Precise electronic structure calculations of ions in plasmas benefit from optimized numerical radial meshes. A new closed form expression for obtaining non-linear parameters for the efficient generation of analytic log-linear radial meshes is presented. In conjunction with the (very simple) algorithm for the rapid high precision evaluation of Lambert's W-function, the above identity allows the precise construction of generalized log-linear radial meshes adapted to various constraints.

74 ATOMIC AND MOLECULAR PHYSICS↗

Extraction of mechanical properties of materials through deep learning from instrumented indentation

Instrumented indentation has been developed and widely utilized as one of the most versatile and practical means of extracting mechanical properties of materials. This method is particularly desirable for those applications where it is difficult to experimentally determine the mechanical properties using stress–strain data obtained from coupon specimens. Such applications include material processing and manufacturing of small and large engineering components and structures involving the following: three dimensional (3D) printing, thin-film and multilayered structures, and integrated manufacturing of materials for coupled mechanical and functional properties. Here, we utilize the latest developments in neural networks, including a multifidelity approach whereby deep-learning algorithms are trained to extract elastoplastic properties of metals an d alloys from instrumented indentation results using multiple datasets for desired levels of improved accuracy. We have established algorithms for solving inverse problems by recourse to single, dual, and multiple indentation and demonstrate that these algorithms significantly outperform traditional brute force computations and function-fitting methods. Moreover, we present several multifidelity approaches specifically for solving the inverse indentation problem which 1) significantly reduce the number of high-fidelity datasets required to achieve a given level of accuracy, 2) utilize known physical and scaling laws to improve training efficiency and accuracy, and 3) integrate simulation and experimental data for training disparate datasets to learn and minimize systematic errors. The predictive capabilities and advantages of these multifidelity methods have been assessed by direct comparisons with experimental results for indentation for different commercial alloys, including two wrought aluminum alloys and several 3D printed titanium alloys.

3D printed materials, stress-strain behavior, mult↗

GlyQ-IQ: Glycomics Quintavariate-Informed Quantification with High-Performance Computing and GlycoGrid 4D Visualization

Dense LC-MS datasets have convoluted extracted ion chromatograms with multiple chromatographic peaks that cloud the differentiation between intact compounds with their overlapping isotopic distributions, peaks due to insource ion fragmentation, and noise. Making this differentiation is critical in glycomics datasets because chromatographic peaks correspond to different intact glycan structural isomers. The GlyQ-IQ software is targeted chromatography centric software designed for chromatogram and mass spectra data processing and subsequent glycan composition annotation. The targeted analysis approach offers several key advantages to LC-MS data processing and annotation over traditional algorithms. A priori information about the individual target’s elemental composition allows for exact isotope profile modeling for improved feature detection and increased sensitivity by focusing chromatogram generation and peak fitting on the isotopic species in the distribution having the highest intensity and data quality. Glycan target annotation is corroborated by glycan family relationships and in source fragmentation detection. The GlyQ-IQ software is developed in this work (Part 1) and was used to profile N-glycan compositions from human serum LC-MS Datasets. The companion manuscript GlyQ-IQ Part 2 discusses developments in human serum N-glycan sample preparation, glycan isomer separation, and glycan electrospray ionization. A case study is presented to demonstrate how GlyQ-IQ identifies and removes confounding chromatographic peaks from high mannose glycan isomers from human blood serum. In addition, GlyQ-IQ was used to generate a broad N-glycan profile from a high resolution (100K/60K) nESI-LS-MS/MS dataset including CID and HCD fragmentation acquired on a Velos Pro Mass spectrometer. 101 glycan compositions and 353 isomer peaks were detected from a single sample. 99% of the GlyQ-IQ glycan-feature assignments passed manual validation and are backed with high resolution mass spectra and mass accuracies less than 7 ppm.

Environmental Molecular Sciences Laboratory↗

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗

A source-synchronous filter for uncorrelated receiver traces from a swept-frequency seismic source

We have developed a novel algorithm to reduce noise in signals obtained from swept-frequency sources by removing out-of-band external noise sources and distortion caused from unwanted harmonics. The algorithm is designed to condition nonstationary signals for which traditional frequency-domain methods for removing noise have been less effective. The source synchronous filter (SSF) is a time-varying narrow band filter, which is synchronized with the frequency of the source signal at all times. Because the bandwidth of the filter needs to account for the source-to-receiver propagation delay and the sweep rate, SSF works best with slow sweep rates and moveout-adjusted waveforms to compensate for source-receiver delays. The SSF algorithm was applied to data collected during a field test at the University of California Santa Barbara’s Garner Valley downhole array site in Southern California. At the site, a 45 kN shaker was mounted on top of a one-story structure and swept from 0 to 10 Hz and back over 60 s (producing useful seismic waves greater than 1.6 Hz). The seismic data were captured with small accelerometer and geophone arrays and with a distributed acoustic sensing array, which is a fiber-optic-based technique for the monitoring of elastic waves. The result of the application of SSF on the field data is a set of undistorted and uncorrelated traces that can be used in different applications, such as measuring phase velocities of surface waves or applying convolution operations with the encoder source function to obtain traveltimes. Lastly, the results from the SSF were used with a visual phase alignment tool to facilitate developing dispersion curves and as a prefilter to improve the interpretation of the data.

58 GEOSCIENCES↗

Deep learning of parameterized equations with applications to uncertainty quantification

We propose a learning algorithm for discovering unknown parameterized dynamical systems by using observational data of the state variables. Our method is built upon and extends the recent work of discovering unknown dynamical systems, in particular those using deep neural network (DNN). We propose a DNN structure, largely based upon the residual network (ResNet), to not only learn the unknown form of the governing equation but also take into account the random effect embedded in the system, which is generated by the random parameters. Once the DNN model is successfully constructed, it is able to produce system prediction over longer term and for arbitrary parameter values. For uncertainty quantification, it allows us to conduct uncertainty analysis by evaluating solution statistics over the parameter space.

97 MATHEMATICS AND COMPUTING↗

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

MOLECULAR SIMULATION OF PHASE EQUILIBRIA FOR COMPLEX FLUIDS

The general area of this project was the development and application of novel molecular simulation methods for prediction of thermodynamic and structural properties of complex polymeric, surfactant and ionic fluids. Over this project period, we have made considerable progress in developing novel algorithms to meet the computational challenges presented by the strong or long-range interactions in these systems and have generated data for well-defined mod-els that can be used to test theories and compare to experimental data. Overall, 42 archival papers and many invited and contributed presentations and lectures have been based on work supported by this project. 6 PhD, 1 M.S. and 2 postdoctoral students have been associated with this work, as listed in the body of the report.

74 ATOMIC AND MOLECULAR PHYSICS↗

THE DATA REDUCTION PIPELINE FOR THE SDSS-IV MaNGA IFU GALAXY SURVEY

Mapping Nearby Galaxies at Apache Point Observatory (MaNGA) is an optical fiber-bundle integral-field unit (IFU) spectroscopic survey that is one of three core programs in the fourth-generation Sloan Digital Sky Survey (SDSS-IV). With a spectral coverage of 3622–10354 Å and an average footprint of ∼500 arcsec{sup 2} per IFU the scientific data products derived from MaNGA will permit exploration of the internal structure of a statistically large sample of 10,000 low-redshift galaxies in unprecedented detail. Comprising 174 individually pluggable science and calibration IFUs with a near-constant data stream, MaNGA is expected to obtain ∼100 million raw-frame spectra and ∼10 million reduced galaxy spectra over the six-year lifetime of the survey. In this contribution, we describe the MaNGA Data Reduction Pipeline algorithms and centralized metadata framework that produce sky-subtracted spectrophotometrically calibrated spectra and rectified three-dimensional data cubes that combine individual dithered observations. For the 1390 galaxy data cubes released in Summer 2016 as part of SDSS-IV Data Release 13, we demonstrate that the MaNGA data have nearly Poisson-limited sky subtraction shortward of ∼8500 Å and reach a typical 10 σ limiting continuum surface brightness μ = 23.5 AB arcsec{sup −2} in a five-arcsecond-diameter aperture in the g -band. The wavelength calibration of the MaNGA data is accurate to 5 km s{sup −1} rms, with a median spatial resolution of 2.54 arcsec FWHM (1.8 kpc at the median redshift of 0.037) and a median spectral resolution of σ = 72 km s{sup −1}.

79 ASTRONOMY AND ASTROPHYSICS↗

ED-cPSD: Fast Phase-Size Distribution via Sequential Erosion-Dilation

The Erosion-Dilation continuous Phase-Size Distribution, ED-cPSD, is an application for calculating continuous pore and particle-size distribution from digital reconstructions and/or image-based structural data. It is based on the erosion-dilation continuous phase-size distribution method. A continuous size distribution is a measure of the probability density of finding a particle or pore of a certain size. These distributions are of interest in any field of study involving porous media, including but not limited to electrochemistry, petroleum engineering, geology, and food science. The algorithm behind the software provides a computationally efficient way to calculate phase-size distributions for large domains. For a 3D battery electrode reconstruction with 1.3 x 10 8 voxels, the particle size distribution is derived in under 2 min on a desktop, while also retaining flexibility and computational efficiency for HPC-scale multi-threading. The software can handle structures with over 10 9 voxels. The algorithm is roughly 280 times faster than a previous version on the same task.

Characterization↗