Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Sparse estimation”

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 145 records · Page 8

Empirical Estimates of 0Day Vulnerabilities in Control Systems

We define a 0Day vulnerability to be any vulnerability, in deployed software, which has been discovered by at least one person but has not yet been publicly announced or patched. These 0Day vulnerabilities are of particular interest when assessing the risk to well managed control systems which have already effectively mitigated the publicly known vulnerabilities. In these well managed systems the risk contribution from 0Days will have proportionally increased. To aid understanding of how great a risk 0Days may pose to control systems, an estimate of how many are in existence is needed. Consequently, using the 0Day definition given above, we developed and applied a method for estimating how many 0Day vulnerabilities are in existence on any given day. The estimate is made by: empirically characterizing the distribution of the lifespans, measured in days, of 0Day vulnerabilities; determining the number of vulnerabilities publicly announced each day; and applying a novel method for estimating the number of 0Day vulnerabilities in existence on any given day using the number of vulnerabilities publicly announced each day and the previously derived distribution of 0Day lifespans. The method was first applied to a general set of software applications by analyzing the 0Day lifespans of 491 software vulnerabilities and using the daily rate of vulnerability announcements in the National Vulnerability Database. This led to a conservative estimate that in the worst year there were, on average, 2500 0Day software related vulnerabilities in existence on any given day. Using a smaller but intriguing set of 15 0Day software vulnerability lifespans representing the actual time from discovery to public disclosure, we then made a more aggressive estimate. In this case, we estimated that in the worst year there were, on average, 4500 0Day software vulnerabilities in existence on any given day. We then proceeded to identify the subset of software applications likely to be used in some control systems, analyzed the associated subset of vulnerabilities, and characterized their lifespans. Using the previously developed method of analysis, we very conservatively estimated 250 control system related 0Day vulnerabilities in existence on any given day. While reasonable, this first order estimate for control systems is probably far more conservative than those made for general software systems since the estimate did not include vulnerabilities unique to control system specific components. These control system specific vulnerabilities were unable to be included in the estimate for a variety of reasons with the most problematic being that the public announcement of unique control system vulnerabilities is very sparse. Consequently, with the intent to improve the above 0Day estimate for control systems, we first identified the additional, unique to control systems, vulnerability estimation constraints and then investigated new mechanisms which may be useful for estimating the number of unique 0Day software vulnerabilities found in control system components. We proceeded to identify a number of new mechanisms and approaches for estimating and incorporating control system specific vulnerabilities into an improved 0Day estimation method. These new mechanisms and approaches appear promising and will be more rigorously evaluated during the course of the next year.

99 GENERAL AND MISCELLANEOUS↗

TH-E-18A-01: Developments in Monte Carlo Methods for Medical Imaging

Monte Carlo simulation methods are widely used in medical physics research and are starting to be implemented in clinical applications such as radiation therapy planning systems. Monte Carlo simulations offer the capability to accurately estimate quantities of interest that are challenging to measure experimentally while taking into account the realistic anatomy of an individual patient. Traditionally, practical application of Monte Carlo simulation codes in diagnostic imaging was limited by the need for large computational resources or long execution times. However, recent advancements in high-performance computing hardware, combined with a new generation of Monte Carlo simulation algorithms and novel postprocessing methods, are allowing for the computation of relevant imaging parameters of interest such as patient organ doses and scatter-to-primaryratios in radiographic projections in just a few seconds using affordable computational resources. Programmable Graphics Processing Units (GPUs), for example, provide a convenient, affordable platform for parallelized Monte Carlo executions that yield simulation times on the order of 10{sup 7} xray/ s. Even with GPU acceleration, however, Monte Carlo simulation times can be prohibitive for routine clinical practice. To reduce simulation times further, variance reduction techniques can be used to alter the probabilistic models underlying the x-ray tracking process, resulting in lower variance in the results without biasing the estimates. Other complementary strategies for further reductions in computation time are denoising of the Monte Carlo estimates and estimating (scoring) the quantity of interest at a sparse set of sampling locations (e.g. at a small number of detector pixels in a scatter simulation) followed by interpolation. Beyond reduction of the computational resources required for performing Monte Carlo simulations in medical imaging, the use of accurate representations of patient anatomy is crucial to the virtual generation of medical images and accurate estimation of radiation dose and other imaging parameters. For this, detailed computational phantoms of the patient anatomy must be utilized and implemented within the radiation transport code. Computational phantoms presently come in one of three format types, and in one of four morphometric categories. Format types include stylized (mathematical equation-based), voxel (segmented CT/MR images), and hybrid (NURBS and polygon mesh surfaces). Morphometric categories include reference (small library of phantoms by age at 50th height/weight percentile), patient-dependent (larger library of phantoms at various combinations of height/weight percentiles), patient-sculpted (phantoms altered to match the patient's unique outer body contour), and finally, patient-specific (an exact representation of the patient with respect to both body contour and internal anatomy). The existence and availability of these phantoms represents a very important advance for the simulation of realistic medical imaging applications using Monte Carlo methods. New Monte Carlo simulation codes need to be thoroughly validated before they can be used to perform novel research. Ideally, the validation process would involve comparison of results with those of an experimental measurement, but accurate replication of experimental conditions can be very challenging. It is very common to validate new Monte Carlo simulations by replicating previously published simulation results of similar experiments. This process, however, is commonly problematic due to the lack of sufficient information in the published reports of previous work so as to be able to replicate the simulation in detail. To aid in this process, the AAPM Task Group 195 prepared a report in which six different imaging research experiments commonly performed using Monte Carlo simulations are described and their results provided. The simulation conditions of all six cases are provided in full detail, with all necessary data on material composition, source, geometry, scoring and other parameters provided. The results of these simulations when performed with the four most common publicly available Monte Carlo packages are also provided in tabular form. The Task Group 195 Report will be useful for researchers needing to validate their Monte Carlo work, and for trainees needing to learn Monte Carlo simulation methods. In this symposium we will review the recent advancements in highperformance computing hardware enabling the reduction in computational resources needed for Monte Carlo simulations in medical imaging. We will review variance reduction techniques commonly applied in Monte Carlo simulations of medical imaging systems and present implementation strategies for efficient combination of these techniques with GPU acceleration. Trade-offs involved in Monte Carlo acceleration by means of denoising and “sparse sampling” will be discussed. A method for rapid scatter correction in cone-beam CT (<5 min/scan) will be presented as an illustration of the simulation speeds achievable with optimized Monte Carlo simulations. We will also discuss the development, availability, and capability of the various combinations of computational phantoms for Monte Carlo simulation of medical imaging systems. Finally, we will review some examples of experimental validation of Monte Carlo simulations and will present the AAPM Task Group 195 Report. Learning Objectives: Describe the advances in hardware available for performing Monte Carlo simulations in high performance computing environments. Explain variance reduction, denoising and sparse sampling techniques available for reduction of computational time needed for Monte Carlo simulations of medical imaging. List and compare the computational anthropomorphic phantoms currently available for more accurate assessment of medical imaging parameters in Monte Carlo simulations. Describe experimental methods used for validation of Monte Carlo simulations in medical imaging. Describe the AAPM Task Group 195 Report and its use for validation and teaching of Monte Carlo simulations in medical imaging.

60 APPLIED LIFE SCIENCES↗

Source scaling comparison and validation in Central Italy: data intensive direct S waves versus the sparse data coda envelope methodology

SUMMARY Robustness of source parameter estimates is a fundamental issue in understanding the relationships between small and large events; however, it is difficult to assess how much of the variability of the source parameters can be attributed to the physical source characteristics or to the uncertainties of the methods and data used to estimate the values. In this study, we apply the coda method by Mayeda et al. using the coda calibration tool (CCT), a freely available Java-based code (https://github.com/LLNL/coda-calibration-tool) to obtain a regional calibration for Central Italy for estimating stable source parameters. We demonstrate the power of the coda technique in this region and show that it provides the same robustness in source parameter estimation as a data-driven methodology [generalized inversion technique (GIT)], but with much fewer calibration events and stations. The Central Italy region is ideal for both GIT and coda approaches as it is characterized by high-quality data, including recent well-recorded seismic sequences such as L'Aquila (2009) and Amatrice–Norcia–Visso (2016–2017). This allows us to apply data-driven methods such as GIT and coda-based methods that require few, but high-quality data. The data set for GIT analysis includes ∼5000 earthquakes and more than 600 stations, while for coda analysis we used a small subset of 39 events spanning 3.5 < Mw < 6.33 and 14 well-distributed broad-band stations. For the common calibration events, as well as an additional 247 events (∼1.7 < Mw < ∼5.0) not used in either calibration, we find excellent agreement between GIT-derived and CCT-derived source spectra. This confirms the ability of the coda approach to obtain stable source parameters even with few calibration events and stations. Even reducing the coda calibration data set by 75 per cent, we found no appreciable degradation in performance. This validation of the coda calibration approach over a broad range of event size demonstrates that this procedure, once extended to other regions, represents a powerful tool for future routine applications to homogeneously evaluate robust source parameters on a national scale. Furthermore, the coda calibration procedure can homogenize the Mw estimates for small and large events without the necessity of introducing any conversion scale between narrow-band measures such as local magnitude (ML) and Mw, which has been shown to introduce significant bias.

Morasca, Paola (ORCID:0000000265254867)↗

Complex Sources and Impacts on Remediation and Monitoring Approaches

Remedy selection, implementation, and coordination with tank farm activities for adjacent waste sites need to be facilitated by a technically defensible description of sources and their relative strength and temporal contributions to groundwater contamination. Detailed data describing contaminant source releases are typically not available, so source locations are highly uncertain. Furthermore, data on sources and model parameters are not readily available through direct measurements. Instead, source data are often derived by extrapolation from a few direct and/or indirect measurements, while model parameters are commonly estimated using inverse modeling or calibration methods. Because the conceptual model of sources will influence the mass and timing of the flux of contaminants to groundwater, uncertainty in the source terms should be considered. Even though a best-fit model can often be identified, it may not be the best representation of the sources given the sparse, uncertain nature of the data used for estimating source terms. To support future feasibility studies, a systematic approach is needed for identifying remediation and monitoring activities appropriate under conditions of uncertainty. In this study, an integrated assessment of alternative conceptual model elements has been examined using the B-Complex site in the Hanford Central Plateau to demonstrate how multiple sources in a waste management complex can be described to identify their relative contributions to groundwater. The heterogeneous structure of the system is modeled based on available field information on the lithological data for both the vadose zone and aquifer. The approach includes a simulation assessment and linkages to site data, with an uncertainty analysis applied to evaluate the effects of source term uncertainty on contaminant mass flux to groundwater. An integrated assessment of alternative conceptual model elements was evaluated to identify how parameter uncertainty impacts both temporal and spatial uncertainties associated with vadose zone source terms. Modeling scenarios identify important characteristics of remediation target zones to provide context for how surface barriers, in situ remedies, and water-table treatment zones can be designed to account for source dynamics. Ramifications for remediation and monitoring are discussed within the context of the source term uncertainty. The described approach facilitates systematically addressing alternative conceptual model questions in relation to remediation and monitoring and supports the remedial investigation/ feasibility study process and the remediation strategy development for the Hanford Central Plateau.

Rockhold, Mark L.↗

Complex Sources and Impacts on Remediation and Monitoring Approaches - 19058

Remedy selection, implementation, and coordination with tank farm activities for adjacent waste sites need to be facilitated by a technically defensible description of sources and their relative strength and temporal contributions to groundwater contamination. Detailed data describing contaminant source releases are typically not available, so source locations are highly uncertain. Furthermore, data on sources and model parameters are not readily available through direct measurements. Instead, source data are often derived by extrapolation from a few direct and/or indirect measurements, while model parameters are commonly estimated using inverse modeling or calibration methods. Because the conceptual model of sources will influence the mass and timing of the flux of contaminants to groundwater, uncertainty in the source terms should be considered. Even though a best-fit model can often be identified, it may not be the best representation of the sources given the sparse, uncertain nature of the data used for estimating source terms. To support future feasibility studies, a systematic approach is needed for identifying remediation and monitoring activities appropriate under conditions of uncertainty. In this study, an integrated assessment of alternative conceptual model elements has been examined using the B-Complex site in the Hanford Central Plateau to demonstrate how multiple sources in a waste management complex can be described to identify their relative contributions to groundwater. The heterogeneous structure of the system is modeled based on available field information on the lithological data for both the vadose zone and aquifer. The approach includes a simulation assessment and linkages to site data, with an uncertainty analysis applied to evaluate the effects of source term uncertainty on contaminant mass flux to groundwater. An integrated assessment of alternative conceptual model elements was evaluated to identify how parameter uncertainty impacts both temporal and spatial uncertainties associated with vadose zone source terms. Modeling scenarios identify important characteristics of remediation target zones to provide context for how surface barriers, in situ remedies, and water-table treatment zones can be designed to account for source dynamics. Ramifications for remediation and monitoring are discussed within the context of the source term uncertainty. The described approach facilitates systematically addressing alternative conceptual model questions in relation to remediation and monitoring and supports the remedial investigation/ feasibility study process and the remediation strategy development for the Hanford Central Plateau. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Modified sparse regularization for electrical impedance tomography

Electrical impedance tomography (EIT) aims to estimate the electrical properties at the interior of an object from current-voltage measurements on its boundary. It has been widely investigated due to its advantages of low cost, non-radiation, non-invasiveness, and high speed. Image reconstruction of EIT is a nonlinear and ill-posed inverse problem. Therefore, regularization techniques like Tikhonov regularization are used to solve the inverse problem. A sparse regularization based on L{sub 1} norm exhibits superiority in preserving boundary information at sharp changes or discontinuous areas in the image. However, the limitation of sparse regularization lies in the time consumption for solving the problem. In order to further improve the calculation speed of sparse regularization, a modified method based on separable approximation algorithm is proposed by using adaptive step-size and preconditioning technique. Both simulation and experimental results show the effectiveness of the proposed method in improving the image quality and real-time performance in the presence of different noise intensities and conductivity contrasts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Automated bone segmentation from dental CBCT images using patch-based sparse representation and convex optimization

Purpose: Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate three-dimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signal-to-noise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segment CBCT images, the authors propose a new method for fully automated CBCT segmentation by using patch-based sparse representation to (1) segment bony structures from the soft tissues and (2) further separate the mandible from the maxilla. Specifically, a region-specific registration strategy is first proposed to warp all the atlases to the current testing subject and then a sparse-based label propagation strategy is employed to estimate a patient-specific atlas from all aligned atlases. Finally, the patient-specific atlas is integrated into amaximum a posteriori probability-based convex segmentation framework for accurate segmentation. Results: The proposed method has been evaluated on a dataset with 15 CBCT images. The effectiveness of the proposed region-specific registration strategy and patient-specific atlas has been validated by comparing with the traditional registration strategy and population-based atlas. The experimental results show that the proposed method achieves the best segmentation accuracy by comparison with other state-of-the-art segmentation methods. Conclusions: The authors have proposed a new CBCT segmentation method by using patch-based sparse representation and convex optimization, which can achieve considerably accurate segmentation results in CBCT segmentation based on 15 patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Statistical Learning for Nonlinear Model Reduction from Local Simulations of Stochastic and Particle- and Agent-Based Systems

Stochastic physical systems across the sciences that have very high-dimensional state spaces, with a large number of fast degrees of freedom that force direct simulators to proceed by integration steps that are orders of magnitude smaller than events of interests (e.g., particle collisions). Examples range from molecular motion to dynamics of large populations of cells. A grand challenge in the simulation and understanding of such systems is the systematic construction of accurate, interpretable, reduced models, enabling faster simulations, revealing fundamental properties of the dynamics, and predicting phenomena of interest that the original simulator could not reached with sufficient accuracy or within a given computational budget. In this projected we developed novel statistical estimation/machine learning techniques for analyzing and building empirical reduced models for important families of high-dimensional stochastic systems, in particular: - we developed techniques for estimating interaction kernels in interacting particle- and agent-based systems, which are ubiquitous in Physics, Biology and many other sciences, given observed trajectories of the system; - we developed techniques for nonlinear model reduction for high-dimensional stochastic systems that have a small number of unknown, nonlinear slow variables, and a large number of fast modes, that are possibly of large magnitude, given observed short trajectories of the system in the form of bursts of trajectories from different initial conditions; - we developed novel techniques for estimating linear dynamical systems on graphs when both the dynamics and the underlying graph are unknown, and we have a sparse set of space-time observations; - we considered the problem of estimating an unknown nonlinear observation function of a standard process (e.g. Brownian motion), so that we can recognized if an observed dynamics is "just" a nonlinear version of a known dynamics; we also developed benchmarks for learning algorithms aimed at learning and classifying diffusion processes.

97 MATHEMATICS AND COMPUTING↗

Monaural Music Source Separation using Convolutional Sparse Coding

We present a comprehensive performance study of a new time-domain approach for estimating the components of an observed monaural audio mixture. Unlike existing time-frequency approaches that use the product of a set of spectral templates and their corresponding activation patterns to approximate the spectrogram of the mixture, the proposed approach uses the sum of a set of convolutions of estimated activations with prelearned dictionary filters to approximate the audio mixture directly in the time domain. The approximation problem can be solved by an efficient convolutional sparse coding algorithm. The effectiveness of this approach for source separation of musical audio has been demonstrated in our prior work, but under rather restricted and controlled conditions, requiring the musical score of the mixture being informed a priori and little mismatch between the dictionary filters and the source signals. In this paper, we report an evaluation that considers wider, and more practical, experimental settings. This includes the use of an audio-based multipitch estimation algorithm to replace the musical score, and an external dataset of audio single notes to construct the dictionary filters. Here, our result shows that the proposed approach remains effective with a larger dictionary, and compares favorably with the state-of-the-art nonnegative matrix factorization approach. However, in the absence of the score and in the case of a small dictionary, our approach may not be better.

97 MATHEMATICS AND COMPUTING↗

Estimation of Interfacial Tension between Organic Liquid Mixtures and Water

Knowledge of IFT values for chemical mixtures helps guide the design and analysis of various processes, including NAPL remediation with surfactants or alcohol flushing, enhanced oil recovery, and chemical separation technologies, yet available literature values are sparse. A comprehensive comparison of thermodynamic and empirical models for estimating interfacial tension (IFT) of organic chemical mixtures with water is conducted, mainly focusing on chlorinated organic compounds for 14 ternary, three quaternary, and one quinary systems. Emphasis is placed on novel results for systems with three and four organic chemical compounds, and for systems with composite organic compounds like lard oil and mineral oil. Seven models are evaluated: the ideal and nonideal monolayer models (MLID and MLNID), the ideal and nonideal mutual solubility models (MSID and MSNID), an empirical model for ternary systems (EM), a linear mixing model based on mole fractions (LMMM), and a newly developed linear mixing model based on volume fractions of organic mixtures (LMMV) for higher order systems. The two ideal models (MLID and MSID) fit ternary systems of chlorinated organic compounds without surface active compounds relatively well. However, both ideal models did not perform well for the mixtures containing a surface active compound. However, for these systems, both the MLNID and MSNID models matched the IFT data well. It is shown that the MLNID model with a surface coverage value (0.00341 mmol/m2) obtained in this study can practically be used for chlorinated organic compounds. The LMMM results in poorer estimates of the IFT as the difference in IFT values of individual organic compounds in a mixture increases. The EM, with two fitting parameters, provided accurate results for all 14 ternary systems including composite organic compounds. The new LMMV method for quaternary and higher component systems was successfully tested. This study shows that the LMMV may be able to be used for higher component systems and it can be easily incorporated into compositional multiphase flow models using only parameters from ternary systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A comparison of methods for representing sparsely sampled random quantities.

This report discusses the treatment of uncertainties stemming from relatively few samples of random quantities. The importance of this topic extends beyond experimental data uncertainty to situations involving uncertainty in model calibration, validation, and prediction. With very sparse data samples it is not practical to have a goal of accurately estimating the underlying probability density function (PDF). Rather, a pragmatic goal is that the uncertainty representation should be conservative so as to bound a specified percentile range of the actual PDF, say the range between 0.025 and .975 percentiles, with reasonable reliability. A second, opposing objective is that the representation not be overly conservative; that it minimally over-estimate the desired percentile range of the actual PDF. The presence of the two opposing objectives makes the sparse-data uncertainty representation problem interesting and difficult. In this report, five uncertainty representation techniques are characterized for their performance on twenty-one test problems (over thousands of trials for each problem) according to these two opposing objectives and other performance measures. Two of the methods, statistical Tolerance Intervals and a kernel density approach specifically developed for handling sparse data, exhibit significantly better overall performance than the others.

Romero, Vicente Jose↗

Continuously amplified warming in the Alaskan Arctic: Implications for estimating global warming hiatus: SPATIAL COVERAGE AND BIAS IN TREND

Historically, in-situ measurements have been notoriously sparse over the Arctic. As a consequence, the existing gridded data of Surface Air Temperature (SAT) may have large biases in estimating the warming trend in this region. Using data from an expanded monitoring network with 31 stations in the Alaskan Arctic, we demonstrate that the SAT has increased by 2.19 °C in this region, or at a rate of 0.23 °C/decade during 1921-2015. Mean- while, we found that the SAT warmed at 0.71 °C/decade over 1998-2015, which is two to three times faster than the rate established from the gridded datasets. Focusing on the "hiatus" period 1998-2012 as identied by the Intergovernmental Panel on Climate Change (IPCC) report, the SAT has increased at 0.45 °C/decade, which captures more than 90% of the regional trend for 1951- 2012. We suggest that sparse in-situ measurements are responsible for underestimation of the SAT change in the gridded datasets. It is likely that enhanced climate warming may also have happened in the other regions of the Arctic since the late 1990s but left undetected because of incomplete observational coverage.

54 ENVIRONMENTAL SCIENCES↗

Physics-informed graphical neural network for power system state estimation

State estimation is highly critical for accurately observing the dynamic behavior of the power grids and minimizing risks from cyber threats. However, existing state estimation methods encounter challenges in accurately capturing power system dynamics, primarily because of limitations in encoding the grid topology and sparse measurements. Here, this paper proposes a physics-informed graphical learning state estimation method to address these limitations by leveraging both domain physical knowledge and a graph neural network (GNN). We employ a GNN architecture that can handle the graph-structured data of power systems more effectively than traditional data-driven methods. The physics-based knowledge is constructed from the branch current formulation, making the approach adaptable to both transmission and distribution systems. The validation results of three IEEE test systems show that the proposed method can achieve lower mean square error more than 20% than the conventional methods.

43 PARTICLE ACCELERATORS↗

Consensus-Based Approach for Active Power Control and Reserve Estimation in Distributed PV Systems

With the increased adoption of distributed energy resources (DER), they are expected to contribute to power system reliability services and enhance power system stability. This paper presents a distributed consensus control approach for the real-time active power reserve estimation and power management in distributed PV (photovoltaic) systems. The proposed method estimates the cumulative active power reserve from numerous PV generators using only the sparse communication network for a DER aggregator to provide active power regulation services. The real-time active power reserve estimation using the proposed approach can be used by DER aggregators to manage curtailment in distributed PV systems to maintain stipulated reserves and further to provide power system frequency regulation. Using the proposed approach, the DER aggregator only requires measurements at the feeder substation and it does not require information from individual DER units, thereby improving system resiliency. The proposed distributed consensus control method is validated on IEEE 123 testbed using PSCAD simulations.

active power reserve↗

Consensus-Based Approach for Active Power Control and Reserve Estimation in Distributed PV Systems: Preprint

With the increased adoption of distributed energy resources (DER), they are expected to contribute to power system reliability services and enhance power system stability. This paper presents a distributed consensus control approach for the real-time active power reserve estimation and power management in distributed PV (photovoltaic) systems. The proposed method estimates the cumulative active power reserve from numerous PV generators using only the sparse communication network for a DER aggregator to provide active power regulation services. The real-time active power reserve estimation using the proposed approach can be used by DER aggregators to manage curtailment in distributed PV systems to maintain stipulated reserves and further to provide power system frequency regulation. Using the proposed approach, the DER aggregator only requires measurements at the feeder substation and it does not require information from individual DER units, thereby improving system resiliency. The proposed distributed consensus control method is validated on IEEE 123 testbed using PSCAD simulations.

active power reserve↗

Overlooked cooling effects of albedo in terrestrial ecosystems

Radiative forcing (RF) resulting from changes in surface albedo is increasingly recognized as a significant driver of global climate change but has not been adequately estimated, including by Intergovernmental Panel on Climate Change (IPCC) assessment reports, compared with other warming agents. Here, we first present the physical foundation for modeling albedo-induced RF and the consequent global warming impact (GWI Δα ). We then highlight the shortcomings of available current databases and methodologies for calculating GWI Δα at multiple temporal scales. There is a clear lack of comprehensive in situ measurements of albedo due to sparse geographic coverage of ground-based stations, whereas estimates from satellites suffer from biases due to the limited frequency of image collection, and estimates from earth system models (ESMs) suffer from very coarse spatial resolution land cover maps and associated albedo values in pre-determined lookup tables. Field measurements of albedo show large differences by ecosystem type and large diurnal and seasonal changes. As indicated from our findings in southwest Michigan, GWI Δα is substantial, exceeding the RF Δα values of IPCC reports. Inclusion of GWI Δα to landowners and carbon credit markets for specific management practices are needed in future policies. We further identify four pressing research priorities: developing a comprehensive albedo database, pinpointing accurate reference sites within managed landscapes, refining algorithms for remote sensing of albedo by integrating geostationary and other orbital satellites, and integrating the GWI Δα component into future ESMs.

54 ENVIRONMENTAL SCIENCES↗

Optimizing High Performance Markov Clustering for Pre-Exascale Architectures

HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM). The existing parallel algorithms in HipMCL are not scalable to Exascale architectures, both due to their communication costs dominating the runtime at large concurrencies and also due to their inability to take advantage of accelerators that are increasingly popular. In this work, we systematically remove scalability and performance bottlenecks of HipMCL. We enable GPUs by performing the expensive expansion phase of the MCL algorithm on GPU. Additionally, we propose a CPU-GPU joint distributed SpGEMM algorithm called pipelined Sparse SUMMA and integrate a probabilistic memory requirement estimator that is fast and accurate. Furthermore, we develop a new merging algorithm for the incremental processing of partial results produced by the GPUs, which improves the overlap efficiency and the peak memory usage. We also integrate a recent and faster algorithm for performing SpGEMM on CPUs. We validate our new algorithms and optimizations with extensive evaluations. With the enabling of the GPUs and integration of new algorithms, HipMCL is up to 12.4x faster, being able to cluster a network with 70 million proteins and 68 billion connections just under 15 minutes using 1024 nodes of ORNL's Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

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↗