Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse data”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Applying Waveform Correlation to Reduce Seismic Analyst Workload Due to Repeating Mining Blasts

Agencies that monitor for underground nuclear tests are interested in techniques that automatically characterize mining blasts to reduce the human analyst effort required to produce high–quality event bulletins. Waveform correlation is effective in finding similar waveforms from repeating seismic events, including mining blasts. We report the results of an experiment to detect and identify mining blasts for two regions, Wyoming (U.S.A.) and Scandinavia, using waveform templates recorded by multiple International Monitoring System stations of the Preparatory Commission for the Comprehensive Nuclear–Test–Ban Treaty Organization (CTBTO PrepCom) for up to 10 yr prior to the time of interest. We discuss approaches for template selection, threshold setting, and event detection that are specialized for characterizing mining blasts using a sparse, global network. We apply the approaches to one week of data for each of the two regions to evaluate the potential for establishing a set of standards for waveform correlation processing of mining blasts that can be generally applied to operational monitoring systems with a sparse network. Here, we compare candidate events detected with our processing methods to the Reviewed Event Bulletin of the International Data Centre to assess potential reduction in analyst workload.

58 GEOSCIENCES↗
DOE OSTI2025

FY24 Task 4: Studies of Phosphate and Fluoride Solubility for Dissolution of High Phosphate Tank Waste

Knowledge gaps have been identified in phosphate solubility in almost every single- and multi-component system, and particularly for aluminate in phosphate/hydroxide, where uncertainties in predicted values of aluminum solubility are greater than 50%. Solubility data of multicomponent, aqueous electrolytes containing sodium hydroxide, sodium fluoride, sodium phosphate, sodium nitrite, sodium nitrate, and dissolved gibbsite are also sparse. For example, for solutions of (i) sodium nitrate and sodium phosphate, data are only available at 30 and 50 °C, and for (ii) dissolved gibbsite in sodium hydroxide and sodium phosphate, only two data points are available at 20 and 40 °C. There is no data available on mixtures of sodium hydroxide, sodium phosphate, sodium fluoride, and dissolved gibbsite. These knowledge gaps were identified in a technical review of waste solubility data and the impact of dilution on solution stabilities and will be addressed in this work to predict aluminum hydroxide and sodium phosphate solubility in multicomponent electrolytes upon dilution, and upon variation of temperature. Results will provide the technical basis to develop accurate models for (i) gibbsite solubility and mass transfer of aluminum between solid and liquid forms following the sluicing of sludge and saltcake with water; and (ii) further blending of these suspensions with bismuth from bismuth phosphate waste, and zirconium and uranium left from the fuel decladding. This work will be essential to developing a disposition path for retrieval solutions from bismuth phosphate wastes. This effort would also support sludge washing to further reduce phosphate concentration if that process were to be added back to the flowsheet in the future.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2018

Two-level structural sparsity regularization for identifying lattices and defects in noisy images

Here, this paper presents a regularized regression model with a two-level structural sparsity penalty applied to locate individual atoms in a noisy scanning transmission electron microscopy image (STEM). In crystals, the locations of atoms is symmetric, condensed into a few lattice groups. Therefore, by identifying the underlying lattice in a given image, individual atoms can be accurately located. We propose to formulate the identification of the lattice groups as a sparse group selection problem. Furthermore, real atomic scale images contain defects and vacancies, so atomic identification based solely on a lattice group may result in false positives and false negatives. To minimize error, model includes an individual sparsity regularization in addition to the group sparsity for a within-group selection, which results in a regression model with a two-level sparsity regularization. We propose a modification of the group orthogonal matching pursuit (gOMP) algorithm with a thresholding step to solve the atom finding problem. The convergence and statistical analyses of the proposed algorithm are presented. The proposed algorithm is also evaluated through numerical experiments with simulated images. The applicability of the algorithm on determination of atom structures and identification of imaging distortions and atomic defects was demonstrated using three real STEM images. In conclusion, we believe this is an important step toward automatic phase identification and assignment with the advent of genomic databases for materials.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Acceleration of GPU-based Krylov solvers via data transfer reduction

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this study, we target the acceleration of Krylov subspace iterative methods for graphics processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA’s cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit’s computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Finally, considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

BI-sparsity pursuit for robust subspace recovery

Here, the success of sparse models in computer vision and machine learning in many real-world applications, may be attributed in large part, to the fact that many high dimensional data are distributed in a union of low dimensional subspaces. The underlying structure may, however, be adversely affected by sparse errors, thus inducing additional complexity in recovering it. In this paper, we propose a bi-sparse model as a framework to investigate and analyze this problem, and provide as a result , a novel algorithm to recover the union of subspaces in presence of sparse corruptions. We additionally demonstrate the effectiveness of our method by experiments on real-world vision data.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

The Geography of Employment Outcomes for Radiation Oncology Graduates in 2019

The geographic distribution of practicing radiation oncologists is of concern for multiple stakeholders within the field. Employment outcomes of graduating residents can affect that distribution, and they are of major concern to current residents. Data investigating employment outcomes of recent graduates are sparse. We aimed to analyze the employment outcomes of the radiation oncology residency class of 2019.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Convergent Concordant Mode Approach for Molecular Vibrations: CMA-2

The concordant mode approach (CMA) is a promising new scheme for dramatically increasing the system size and level of theory achievable in quantum chemical computations of molecular vibrational frequencies. Here, we achieve advances in the CMA hierarchy by computations targeting CCSD(T)/cc-pVTZ (coupled cluster singles and doubles with perturbative triples using a correlation-consistent polarized-valence triple-ζ basis set) benchmarks within the G2 molecular test set, executing a statistical analysis for 1501 frequencies from 111 compounds and then separately solving the refractory case of pyridine. First, MP2/cc-pVTZ (second-order Møller–Plesset perturbation theory with the same basis set) proves to be an excellent and preferred choice for generating the underlying (Level B) normal modes of the CMA scheme. Utilizing this Level B within the CMA-0A method reproduces the 1501 benchmark frequencies with a mean absolute error (MAE) of only 0.11 cm –1 and an attendant standard deviation of 0.49 cm –1 . Second, a convergent CMA-2 method is constituted that allows efficient computation of higher level (Level A) frequencies to any reasonable accuracy threshold by using only Hartree–Fock (HF) and MP2 or density functional theory (DFT) data to generate ξ parameters, which select the sparse off-diagonal force field elements for explicit evaluation at Level A. When Level B = MP2/cc-pVTZ, a cutoff of ξ = 0.02 provides an average maximum absolute error per molecule of only 0.17 cm –1 by incurring merely a 33% increase in average cost over CMA-0A. This CMA-2 method also eradicates the 4 problematic CMA-0A outliers of pyridine with even less effort (ξ = 0.04, 22% increase). Finally, the newly developed CMA procedures are shown to be highly successful when applied to 1-(1H-pyrrol-3-yl)ethanol, a new test molecule with diverse types of vibration.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

The erosion of biodiversity and biomass in the Atlantic Forest biodiversity hotspot

Tropical forests are being deforested worldwide, and the remaining fragments are suffering from biomass and biodiversity erosion. Quantifying this erosion is challenging because ground data on tropical biodiversity and biomass are often sparse. Here, we use an unprecedented dataset of 1819 field surveys covering the entire Atlantic Forest biodiversity hotspot. We show that 83-85% of the surveys presented losses in forest biomass and tree species richness, functional traits, and conservation value. On average, forest fragments have 25-32% less biomass, 23-31% fewer species, and 33, 36, and 42% fewer individuals of late-successional, large-seeded, and endemic species, respectively. Biodiversity and biomass erosion are lower inside strictly protected conservation units, particularly in large ones. We estimate that biomass erosion across the Atlantic Forest remnants is equivalent to the loss of 55-70 thousand km 2 of forests or US$2.3-2.6 billion in carbon credits. These figures have direct implications on mechanisms of climate change mitigation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2014

Identification of interactions in fractional-order systems with high dimensions

This article proposes an approach to identify fractional-order systems with sparse interaction structures and high dimensions when observation data are supposed to be experimentally available. This approach includes two steps: first, it is to estimate the value of the fractional order by taking into account the solution properties of fractional-order systems; second, it is to identify the interaction coefficients among the system variables by employing the compressed sensing technique. An error analysis is provided analytically for this approach and a further improved approach is also proposed. Moreover, the applicability of the proposed approach is fully illustrated by two examples: one is to estimate the mutual interactions in a complex dynamical network described by fractional-order systems, and the other is to identify a high fractional-order and homogeneous sequential differential equation, which is frequently used to describe viscoelastic phenomena. All the results demonstrate the feasibility of figuring out the system mechanisms behind the data experimentally observed in physical or biological systems with viscoelastic evolution characters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Discovering the Unknowns: A First Step

This article aims at discovering the unknown variables in the system through data analysis. The main idea is to use the time of data collection as a surrogate variable and try to identify the unknown variables by modeling gradual and sudden changes in the data. We use Gaussian process modeling and a sparse representation of the sudden changes to efficiently estimate the large number of parameters in the proposed statistical model. The method is tested on a realistic dataset generated using a one-dimensional implementation of a Magnetized Liner Inertial Fusion (MagLIF) simulation model, and encouraging results are obtained.

42 ENGINEERING↗
DOE OSTI2023

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗
DOE OSTI2022

Simurgh: A Framework for Cad-Driven Deep Learning Based X-Ray CT Reconstruction

High-resolution X-ray computed tomography (XCT) is an important technique for the inspection of additively manufactured (AM) parts. While XCT is typically used off-line to inspect a subset of manufactured parts, significantly accelerating measurement speed while retaining accuracy would enable use of XCT for in-line inspection to rapidly identify defects in each part as it is manufactured. Here, we propose a deep learning (DL) based approach that uses computer aided design (CAD) models of the AM parts and physics-based information to rapidly produce high-quality reconstructions from sparse XCT measurements without high quality ground truth data. Our approach uses a generative adversarial neural network (GAN) to produced realistic training data from the CAD-based simulations and a deep neural network that is trained using data from the first stage to produce accurate 3D reconstructions. Using experimental XCT data of metal parts, we demonstrate enhanced defect detection capabilities while dramatically reducing the scan time.

Ziabari, Amir↗
DOE OSTI2014

The unseen iceberg: plant roots in arctic tundra

Arctic tundra is characterized by short-statured plant communities underlain by carbon (C)-rich soils and permafrost. Ecosystem C and nutrient cycles in tundra are driven by complex interactions between plants and their environment. However, root dynamics are one of the least understood aspects of plant growth in the Arctic. We synthesized available literature on tundra roots and discussed their representation in terrestrial biosphere models. Belowground biomass in tundra ecosystems can be an order of magnitude larger than aboveground biomass. Data on root production and turnover in tundra is sparse, limiting our understanding of the controls over root dynamics in these systems. Roots are shallowly distributed in the thin layer of soil that thaws each year, and are often found in the organic horizon at the soil surface. Species-specific differences in root distribution, mycorrhizal colonization, and resource partitioning may affect plant species competition under changing climatic conditions. Model representation of belowground processes has increased in complexity over recent years, but data are desperately needed to fill the gaps in model treatment of tundra roots. Future research should focus on estimates of root production and lifespan, and interactions between roots and the surrounding soil across the diversity of tundra ecosystems in the Arctic.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2017

Estimating the state of a geophysical system with sparse observations: time delay methods to achieve accurate initial states for prediction

The problem of forecasting the behavior of a complex dynamical system through analysis of observational time-series data becomes difficult when the system expresses chaotic behavior and the measurements are sparse, in both space and/or time. Despite the fact that this situation is quite typical across many fields, including numerical weather prediction, the issue of whether the available observations are "sufficient" for generating successful forecasts is still not well understood. An analysis by Whartenby et al. (2013) found that in the context of the nonlinear shallow water equations on a β plane, standard nudging techniques require observing approximately 70 % of the full set of state variables. Here we examine the same system using a method introduced by Rey et al. (2014a), which generalizes standard nudging methods to utilize time delayed measurements. Here, we show that in certain circumstances, it provides a sizable reduction in the number of observations required to construct accurate estimates and high-quality predictions. In particular, we find that this estimate of 70 % can be reduced to about 33 % using time delays, and even further if Lagrangian drifter locations are also used as measurements.

58 GEOSCIENCES↗
DOE OSTI2015

Dynamic graph system for a semantic database

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Dynamic graph system for a semantic database

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Signal-Preserving Erratic Noise Attenuation via Iterative Robust Sparsity-Promoting Filter

Sparse domain thresholding filters operating in a sparse domain are highly effective in removing Gaussian random noise under Gaussian distribution assumption. Erratic noise, which designates non-Gaussian noise that consists of large isolated events with known or unknown distribution, also needs to be explicitly taken into account. However, conventional sparse domain thresholding filters based on the least-squares (LS) criterion are severely sensitive to data with high-amplitude and non-Gaussian noise, i.e., the erratic noise, which makes the suppression of this type of noise extremely challenging. Here, in this paper, we present a robust sparsity-promoting denoising model, in which the LS criterion is replaced by the Huber criterion to weaken the effects of erratic noise. The random and erratic noise is distinguished by using a data-adaptive parameter in the presented method, where random noise is described by mean square, while the erratic noise is downweighted through a damped weight. Different from conventional sparse domain thresholding filters, definition of the misfit between noisy data and recovered signal via the Huber criterion results in a nonlinear optimization problem. With the help of theoretical pseudoseismic data, an iterative robust sparsity-promoting filter is proposed to transform the nonlinear optimization problem into a linear LS problem through an iterative procedure. The main advantage of this transformation is that the nonlinear denoising filter can be solved by conventional LS solvers. Lastly, tests with several data sets demonstrate that the proposed denoising filter can successfully attenuate the erratic noise without damaging useful signal when compared with conventional denoising approaches based on the LS criterion.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Online Voltage Event Detection Using Synchrophasor Data with Structured Sparsity-Inducing Norms

This paper develops an accurate and computationally efficient data-driven framework to detect voltage events from PMU data streams. It develops an innovative Proximal Bilateral Random Projection (PBRP) algorithm to quickly decompose the PMU data matrix into a low-rank matrix, a row-sparse event-pattern matrix and a noise matrix. Here, the row-sparse pattern matrix significantly distinguishes events from normal behavior. These matrices are then fed into a clustering algorithm to separate voltage events from normal operating conditions. Large-scale numerical study results on real-world PMU data show that the proposed algorithm is computationally more efficient and achieves higher F scores than state-of-the-art benchmarks.

24 POWER TRANSMISSION AND DISTRIBUTION↗