SEARCH · Engineering Papers
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.
This is the AmeriFlux Management Project (AMP) created FLUXNET-1F version of the carbon flux data for the site CA-HPC Havikpak Creek. This is the FLUXNET version of the carbon flux data for the site CA-HPC Havikpak Creek produced by applying the standard ONEFlux (1F) software. Site Description - Southern Arctic boreal woodland (Picea mariana) site with sparse needleleaf vegetation > 2m, continuous permafrost
Unmanned aerial vehicles (UAVs) are quickly emerging as a popular platform for 3D reconstruction/modeling in various applications such as precision agriculture, coastal monitoring, and emergency management. For such applications, LiDAR and frame cameras are the two most commonly used sensors for 3D mapping of the object space. For example, point clouds for the area of interest can be directly derived from LiDAR sensors onboard UAVs equipped with integrated global navigation satellite systems and inertial navigation systems (GNSS/INS). Imagery-based mapping, on the other hand, is considered to be a cost-effective and practical option and is often conducted by generating point clouds and orthophotos using structure from motion (SfM) techniques. Mapping with photogrammetric approaches requires accurate camera interior orientation parameters (IOPs), especially when direct georeferencing is utilized. Most state-of-the-art approaches for determining/refining camera IOPs depend on ground control points (GCPs). However, establishing GCPs is expensive and labor-intensive, and more importantly, the distribution and number of GCPs are usually less than optimal to provide adequate control for determining and/or refining camera IOPs. Moreover, consumer-grade cameras with unstable IOPs have been widely used for mapping applications. Therefore, in such scenarios, where frequent camera calibration or IOP refinement is required, GCP-based approaches are impractical. To eliminate the need for GCPs, this study uses LiDAR data as a reference surface to perform in situ refinement of camera IOPs. The proposed refinement strategy is conducted in three main steps. An image-based sparse point cloud is first generated via a GNSS/INS-assisted SfM strategy. Then, LiDAR points corresponding to the resultant image-based sparse point cloud are identified through an iterative plane fitting approach and are referred to as LiDAR control points (LCPs). Finally, IOPs of the utilized camera are refined through a GNSS/INS-assisted bundle adjustment procedure using LCPs. Seven datasets over two study sites with a variety of geomorphic features are used to evaluate the performance of the developed strategy. The results illustrate the ability of the proposed approach to achieve an object space absolute accuracy of 3–5 cm (i.e., 5–10 times the ground sampling distance) at a 41 m flying height.
Over the last decade or so, reconstruction methods using ℓ 1 regularization, often categorized as compressed sensing (CS) algorithms, have significantly improved the capabilities of high fidelity imaging in electron tomography. The most popular ℓ 1 regularization approach within electron tomography has been total variation (TV) regularization. In addition to reducing unwanted noise, TV regularization encourages a piecewise constant solution with sparse boundary regions. In this paper we propose an alternative ℓ 1 regularization approach for electron tomography based on higher order total variation (HOTV). Like TV, the HOTV approach promotes solutions with sparse boundary regions. In smooth regions however, the solution is not limited to piecewise constant behavior. We demonstrate that this allows for more accurate reconstruction of a broader class of images – even those for which TV was designed for – particularly when dealing with pragmatic tomographic sampling patterns and very fine image features. In conclusion, we develop results for an electron tomography data set as well as a phantom example, and we also make comparisons with discrete tomography approaches.
As the distributed solar market evolves toward more dynamic forms of deployment, interest in paired solar-plus-storage applications continues to gain steam, but details on the current state of the market are relatively sparse. To fill that void, Berkeley Lab has released an in-depth analysis of this budding market segment. This report draws on the Lab’s Tracking the Sun dataset to characterize trends in deployment, system sizing and equipment selection, installer-market development, and system pricing. The report also provides indicative analyses of the financial and resilience value that host customers in several key markets presently receive by pairing storage with solar.
We introduce a task-parallel algorithm for sparse incomplete Cholesky factorization that utilizes a 2D sparse partitioned-block layout of a matrix. Our factorization algorithm follows the idea of algorithms-by-blocks by using the block layout. The algorithm-byblocks approach induces a task graph for the factorization. These tasks are inter-related to each other through their data dependences in the factorization algorithm. To process the tasks on various manycore architectures in a portable manner, we also present a portable tasking API that incorporates different tasking backends and device-specific features using an open-source framework for manycore platforms i.e., Kokkos. A performance evaluation is presented on both Intel Sandybridge and Xeon Phi platforms for matrices from the University of Florida sparse matrix collection to illustrate merits of the proposed task-based factorization. Experimental results demonstrate that our task-parallel implementation delivers about 26.6x speedup (geometric mean) over single-threaded incomplete Choleskyby- blocks and 19.2x speedup over serial Cholesky performance which does not carry tasking overhead using 56 threads on the Intel Xeon Phi processor for sparse matrices arising from various application problems.
Transpiration is a globally important component of evapotranspiration. Careful upscaling of transpiration from point measurements is thus crucial for quantifying water and energy fluxes. In spatially heterogeneous landscapes common across the boreal biome, upscaled transpiration estimates are difficult to determine due to variation in local environmental conditions (e.g., basal area, soil moisture, permafrost). Here, we sought to determine stand-level attributes that influence transpiration scalars for a forested boreal peatland complex consisting of sparsely treed wetlands and densely treed permafrost plateaus as land cover types. The objectives were to quantify spatial and temporal variability in stand-level transpiration, and to identify sources of uncertainty when scaling point measurements to the stand-level. Using heat ratio method sap flow sensors, we determined sap velocity for black spruce and tamarack for 2-week periods during peak growing season in 2013, 2017 and 2018. We found greater basal area, drier soils, and the presence of permafrost increased daily sap velocity in individual trees, suggesting that local environmental conditions are important in dictating sap velocity. When sap velocity was scaled to stand-level transpiration using gridded 20 × 20 m resolution data across the ~10 ha Scotty Creek ForestGEO plot, we observed significant differences in daily plot transpiration among years (0.17–0.30 mm), and across land cover types. Daily transpiration was lowest in grid-cells with sparsely treed wetlands compared to grid-cells with well-drained and densely treed permafrost plateaus, where daily transpiration reached 0.80 mm, or 30% of the daily evapotranspiration. When transpiration scalars (i.e., sap velocity) were not specific to the different land cover types (i.e., permafrost plateaus and wetlands), scaled stand-level transpiration was overestimated by 42%. To quantify the relative contribution of tree transpiration to ecosystem evapotranspiration, we recommend that sampling designs stratify across local environmental conditions to accurately represent variation associated with land cover types, especially with different hydrological functioning as encountered in rapidly thawing boreal peatland complexes.
We report that machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational models which typically take days to run, thus hindering the potential of machine learning tools. In this work, we present a novel classifier that takes advantage of lower fidelity models and inexpensive approximations to predict the binary output of expensive computer simulations. We postulate an autoregressive model between the different levels of fidelity with Gaussian process priors. We adopt a fully Bayesian treatment for the hyper-parameters and use Markov Chain Monte Carlo samplers. We take advantage of the probabilistic nature of the classifier to implement active learning strategies. We also introduce a sparse approximation to enhance the ability of the multi-fidelity classifier to handle a large amount of low fidelity samples. We test these multi-fidelity classifiers against their single-fidelity counterpart with synthetic data, showing a median computational cost reduction of 23% for a target accuracy of 90%. In an application to cardiac electrophysiology, the multi-fidelity classifier achieves an F1 score, the harmonic mean of precision and recall, of 99.6% compared to 74.1% of a single-fidelity classifier when both are trained with 50 samples. In general, our results show that the multi-fidelity classifiers outperform their single-fidelity counterpart in terms of accuracy in all cases. Finally, we envision that this new tool will enable researchers to study classification problems that would otherwise be prohibitively expensive. Source code is available at https://github.com/fsahli/MFclass.
The sparse triangular solve kernels, SpTRSV and SpTRSM, are important building blocks for a number of numerical linear algebra routines. Parallelizing SpTRSV and SpTRSM on today's many-core platforms, such as GPUs, is not an easy task since computing a component of the solution may depend on previously computed components, enforcing a degree of sequential processing. As a consequence, most existing work introduces a preprocessing stage to partition the components into a group of level-sets or colour-sets so that components within a set are independent and can be processed simultaneously during the subsequent solution stage. However, this class of methods requires a long preprocessing time as well as significant runtime synchronization over-heads between the sets. To address this, we
We report on several efforts to search for physics beyond the standard model of particle physics at broad energy scales. The Mu2e experiment at Fermilab will search for charged lepton flavor violation via the muon to electron conversion process, which is suppressed in the Standard Model. Mu2e will be operated at a low energy, yet can probe New Physics at very high mass scales (O(1e3 - 1e4 ) TeV). At high energies, the CMS experiment at the CERN LHC continues to deliver an impressive suite of Standard Model measurements and limits on a variety of New Physics signatures. Mu2e is under construction and slated to collect its first physics data in the coming years. This thesis describes work done during the construction phase of Mu2e and focuses on two critical areas: magnetic field modeling and statistical analysis. We describe a novel method for field modeling which we validate using a simulated dataset representing the expected magnetic field in the Detector Solenoid. This method blends a standard least-squares fitting technique that utilizes physically motivated analytical model functions with a novel physics informed network that is constructed to obey Maxwell’s equations. We show the technique can model the field with an accuracy of 10−7 despite the presence of injected noise in the pseudo-measurements at the 10−5 level. We then present preliminary results of the calibration of 3D Hall probes at the sub-10−4 level. These probes will be used to directly measure the Mu2e Detector Solenoid magnetic field on a sparse grid; these measurements serve as the input to the field model fitting. Finally, we describe the first implementation of both an unbinned shape analysis and a Bayesian interpretation applied to Mu2e pseudo-data. Up to 20% tighter limits can be set by the shape analysis compared to a standard cut & count analysis. The AlCap experiment collected data at PSI in 2015 to measure several important quantities related to nuclear muon capture on an aluminum target, which is a significant background process for Mu2e. The neutron emission from muon capture can introduce background hits in the Mu2e detectors and can increase radiation damage in various elements of the apparatus. We present measurements of the neutron group fluence and mean neutron multiplicity for muon capture on aluminum nuclei. Finally, we discuss an analysis of triboson production at CMS using an Effective Field Theory framework. Standard Model triboson production, which was first observed at CMS in 2020, has a relatively small cross section and provides direct access to both anomalous triple gauge couplings and quartic gauge couplings. These couplings, interpreted in the Standard Model Effective Field Theory, are studied in the present work. We target the boosted regime where the background rate is low and yields are enhanced when dimension-6 and dimension-8 Wilson coefficients are non-zero. We do not observe an excess in the data and therefore set bounds on the Wilson coefficients. For dimension-6 coefficients the tightest observed (expected) bounds are set on cW /Λ2 where Λ is the mass scale of new physics; the bounds are [−0.13, 0.12] TeV−2 ([−0.12, 0.12] TeV−2 ) at 95% CL. The tightest bounds in dimension-8 are set on fT,0 / Λ4 ; the observed (expected) bounds at 95% CL are [−0.63, 0.69] TeV−4 ([−0.54, 0.62] TeV−4 ). Additional results are presented which include scenarios where multiple Wilson coefficients are non-zero, the application of signal model clipping to address unitarity violation in Effective Field Theories, and a novel template fit developed for easier reinterpretation of our results.
Our research was focused on forecasting the position and shape of the winter stratospheric polar vortex at a subseasonal timescale of 15 days in advance. To achieve this, we employed both statistical and neural network machine learning techniques. The analysis was performed on 42 winter seasons of reanalysis data provided by NASA giving us a total of 6,342 days of data. The state of the polar vortex for determined by using geometric moments to calculate the centroid latitude and the aspect ratio of an ellipse fit onto the vortex. Timeseries for thirty additional precursors were calculated to help improve the predictive capabilities of the algorithm. Feature importance of these precursors was performed using random forest to measure the predictive importance and the ideal number of precursors. Then, using the precursors identified as important, various statistical methods were tested for predictive accuracy with random forest and nearest neighbor performing the best. An echo state network, a type of recurrent neural network that features sparsely connected hidden layer and a reduced number of trainable parameters that allows for rapid training and testing, was also implemented for the forecasting problem. Hyperparameter tuning was performed for each methods using a subset of the training data. The algorithms were trained and tuned on the first 41 years of data, then tested for accuracy on the final year. In general, the centroid latitude of the polar vortex proved easier to predict than the aspect ratio across all algorithms. Random forest outperformed other statistical forecasting algorithms overall but struggled to predict extreme values. Forecasting from echo state network suggested a strong predictive capability past 15 days, but further work is required to fully realize the potential of recurrent neural network approaches.
Performing rigorous predictive simulation necessitates that all available data be incorporated into the modeling process in order to accurately quantify uncertainties in predictions of the model. Statistical Bayesian inference is the most commonly used approach for incorporating data into uncertainty estimates. Statistical Bayesian inference uses data and an assumed error model to inform posterior distributions of model input variables and model discrepancies. An explicit characterization of the posterior distribution is not formed, but rather methods such as Markov chain Monte-Carlo (MCMC) are used to draw samples from the posterior. These samples are then used to evaluate statistics, such as integrals, of predicted quantities of interest (QoI). Recently the authors have developed an alternative reformulation of Bayesian inference based upon a measure-theoretic inversion technique. Unlike traditional statistical Bayesian inference, this reformulation allows us to directly interrogate the posterior distribution and, consequently, to generate samples from the posterior without MCMC. In this work we use forward propagation uncertainty quantification techniques to reduce the cost of approximating the posterior distribution. Specifically we investigate goal-oriented adaptive sparse grid approximation methods. These adaptive methods concentrate high-fidelity model evaluations in regions of the parameter space that both significantly contribute to the uncertainty in specified QoI and are informed by the available data. Numerical results are presented to compare our approach with the standard statistical Bayesian approach and to demonstrate the effectiveness of the goal-oriented adaptivity.
2D ultrasonic arrays have considerable application potential in Lamb wave based SHM systems, since they enable equivocal damage imaging and even in some cases wave-mode selection. Recently, it has been shown that the 2D arrays can be used in SHM applications in a synthetic focusing (SF) mode, which is much more effective than the classical phase array mode commonly used in NDT. The SF mode assumes a single element excitation of subsequent transmitters and off-line processing the acquired data. In the simplest implementation of the technique, only single multiplexed input and output channels are required, which results in significant hardware simplification. Application of the SF mode for 2D arrays creates additional degrees of freedom during the design of the array topology, which complicates the array design process, however, it enables sparse array designs with performance similar to that of the fully populated dense arrays. In this paper we present the coarray concept to facilitate synthesis process of an array’s aperture used in the multistatic synthetic focusing approach in Lamb waves-based imaging systems. In the coherent imaging, performed in the transmit/receive mode, the sum coarray is a morphological convolution of the transmit/receive sub-arrays. It can be calculated as the set of sums of the individual sub-arrays’ elements locations. The coarray framework will be presented here using a an example of a star-shaped array. The approach will be discussed in terms of beampatterns of the resulting imaging systems. Both simulated and experimental results will be included.
The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.
Abstract Understanding structure-property relationships of Li-ion battery cathodes is crucial for optimizing rate-performance and cycle-life resilience. However, correlating the morphology of cathode particles, such as in LiNi0.8Mn0.1Co0.1O2 (NMC811), and their inner grain architecture with electrode performance is challenging, particularly, due to the significant length-scale difference between grain and particle sizes. Experimentally, it is not feasible to image such a high number of particles with full granular detail. A second challenge is that sufficiently high-resolution 3D imaging techniques remain expensive and are sparsely available at research institutions. Here, we present a stereological generative adversarial network-based model fitting approach to tackle this, that generates representative 3D information from 2D data, enabling characterization of materials in 3D using cost-effective 2D data. Once calibrated, this multi-scale model can rapidly generate virtual cathode particles that are statistically similar to experimental data, and thus is suitable for virtual characterization and materials testing through numerical simulations. A large dataset of simulated particles with inner grain architecture has been made publicly available.
The state of Utah, USA, experiences around 3800 catalogued earthquakes per year, highlighting that the region is seismically active and susceptible to earthquakes. Following the 2002 Denali Fault (M7.9) earthquake in Alaska, the region showed an elevated seismicity rate for 3 weeks following the passage of high amplitude surface waves, suggesting that the region may be particularly susceptible to dynamic triggering. With over 23,396 faults and each fault presenting a potential fault for triggering, we systematically search for dynamic triggering throughout the state of Utah caused by large, global earthquakes with M ≥ 7. Specifically, we analyse earthquake catalogues and all available waveform data to determine statistical increases of seismicity rate following the passage of seismic arrivals. While we find instances of dynamic triggering, our results show that these events occur sparsely in the region. In total, less than 20 per cent of the 273 main shocks that occur from 2000 to the end of 2017 show a statistical indication of dynamic triggering throughout the Utah region, highlighting that dynamic triggering is limited for stresses created by transient signals from global M ≥ 7 earthquakes, with the exception being the Denali Fault (M7.9), Alaska earthquake (i.e. an instance of significant triggering).
Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art graph learning model. However, it remains notoriously challenging to inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because real-world graphs can be extremely large and sparse. Furthermore, the node degree of GCNs tends to follow the power-law distribution and therefore have highly irregular adjacency matrices, resulting in prohibitive inefficiencies in both data processing and movement and thus substantially limiting the achievable GCN acceleration efficiency. To this end, this paper proposes the first GCN algorithm and accelerator Co-Design framework dubbed GCoD which can largely alleviate the aforementioned GCN irregularity and boost GCNs' inference efficiency. Specifically, on the algorithm level, GCoD integrates a divide and conquer GCN training strategy that polarizes the graphs to be either denser or sparser in local neighborhoods without compromising the model accuracy, resulting in graph adjacency matrices that (mostly) have merely two levels of workload and enjoys largely enhanced regularity and thus ease of acceleration. On the hardware level, we further develop a dedicated two-pronged accelerator with a separated engine to process each of the aforementioned workloads, further boosting the overall utilization and acceleration efficiency. Extensive experiments and ablation studies validate that our GCoD consistently outperforms state-of-the-art designs in terms of accelerator efficiency while maintaining or even improving the task accuracy. Additionally, we visualize GCoD trained graph adjacency matrices to better understand its advantages. All codes and pre-trained models will be released upon acceptance.
Subsurface environmental systems are open and complex, in which intricate hydrologic, microbiologic, and geochemical processes occur and interact at multiple scales. Understanding and predicting system responses to natural forces (e.g., climate changes) and human activities (e.g., contaminant remediation and CO 2 sequestration) is indispensable for managing water resources, cleaning subsurface contamination at many sites of the Department of Energy (DOE), and providing expert analysis to inform policy-making on long-term stewardship of nuclear waste disposal and CO 2 storage sites. Groundwater reactive transport modeling is necessary for understanding and predicting the complex subsurface environmental system. However, as complex systems are never completely predictable, model predictions of the subsurface system are inherently uncertain, and uncertainty is one of the greatest obstacles in simulating the subsurface environment. Quantifying predictive uncertainty of the complex system is critical to test model predictive power, support decision-making, and guide experimental design and data collection for uncertainty reduction. This project tackled two major obstacles to efficient and effective quantification and reduction of predictive uncertainty in simulating the complex subsurface environment. One obstacle is that existing methods of uncertainty quantification are too fragmented and incomplete for understanding and predicting the complex subsurface environment as a whole. The other obstacle is that existing methods of uncertainty quantification are computationally demanding and may not be applicable to groundwater reactive transport modeling that is always computationally expensive. The above two obstacles to uncertainty quantification directly affect the design of data collection schemes for uncertainty reduction. In this project, we developed a comprehensive Bayesian framework to remove the first obstacle. The second obstacle was tackled by using the sparse grid methods, which were originally developed and analyzed for numerical integration in the field of applied mathematics. We integrated the sparse grid methods into the Bayesian framework seamlessly, which led to a sparse-grid-based method of Bayesian uncertainty analysis. The developed computational Bayesian framework has been applied to a number of subsurface environmental problems through collaborating with scientists at the Pacific Northwest National Laboratory and Oak Ridge National Laboratory. The applications demonstrated that the computational Bayesian framework is general and compatible with any models and numerical codes of subsurface modeling. It is thus can be applied to gain insights for subsurface environmental modeling. This project helped the PI achieve his career goal to advance the state-of-the-art computational methods in uncertainty quantification for subsurface environmental modeling. This project supported two doctoral students, two master students, and one post-doc. The two doctoral students, after their graduation, worked as post-docs at the Pacific Northwest National Laboratory and the Oak Ridge National Laboratory. The project produced a total of 29 journal articles (four under review), one book chapter, and a number of conference proceedings and abstracts.
SF-23-006 FAST (FAST AUTONOMOUS SCANNING TOOLKIT)The software is deployed on an edge computing device at the beamline computer attached to a scanning microscope. It iteratively analyzes the data collected, then identifies new scan positions to scan next and directs the positioners that move the sample (or probe beam) to these positions. Overall, it identifies a sparse set of scan positions that are sufficient to image the full sample. This can reduce the scan time by >60%.