Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

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 1,423 records · Page 79

SU-F-J-113: Multi-Atlas Based Automatic Organ Segmentation for Lung Radiotherapy Planning

Purpose: Normal organ segmentation is one time-consuming and labor-intensive step for lung radiotherapy treatment planning. The aim of this study is to evaluate the performance of a multi-atlas based segmentation approach for automatic organs at risk (OAR) delineation. Methods: Fifteen Lung stereotactic body radiation therapy patients were randomly selected. Planning CT images and OAR contours of the heart - HT, aorta - AO, vena cava - VC, pulmonary trunk - PT, and esophagus – ES were exported and used as reference and atlas sets. For automatic organ delineation for a given target CT, 1) all atlas sets were deformably warped to the target CT, 2) the deformed sets were accumulated and normalized to produce organ probability density (OPD) maps, and 3) the OPD maps were converted to contours via image thresholding. Optimal threshold for each organ was empirically determined by comparing the auto-segmented contours against their respective reference contours. The delineated results were evaluated by measuring contour similarity metrics: DICE, mean distance (MD), and true detection rate (TD), where DICE=(intersection volume/sum of two volumes) and TD = {1.0 - (false positive + false negative)/2.0}. Diffeomorphic Demons algorithm was employed for CT-CT deformable image registrations. Results: Optimal thresholds were determined to be 0.53 for HT, 0.38 for AO, 0.28 for PT, 0.43 for VC, and 0.31 for ES. The mean similarity metrics (DICE[%], MD[mm], TD[%]) were (88, 3.2, 89) for HT, (79, 3.2, 82) for AO, (75, 2.7, 77) for PT, (68, 3.4, 73) for VC, and (51,2.7, 60) for ES. Conclusion: The investigated multi-atlas based approach produced reliable segmentations for the organs with large and relatively clear boundaries (HT and AO). However, the detection of small and narrow organs with diffused boundaries (ES) were challenging. Sophisticated atlas selection and multi-atlas fusion algorithms may further improve the quality of segmentations.

60 APPLIED LIFE SCIENCES↗

The importance of round-robin validation when assessing machine-learning-based vertical extrapolation of wind speeds

The extrapolation of wind speeds measured at a meteorological mast to wind turbine rotor heights is a key component in a bankable wind farm energy assessment and a significant source of uncertainty. Industry-standard methods for extrapolation include the power-law and logarithmic profiles. The emergence of machine-learning applications in wind energy has led to several studies demonstrating substantial improvements in vertical extrapolation accuracy in machine-learning methods over these conventional power-law and logarithmic profile methods. In all cases, these studies assess relative model performance at a measurement site where, critically, the machine-learning algorithm requires knowledge of the rotor-height wind speeds in order to train the model. This prior knowledge provides fundamental advantages to the site-specific machine-learning model over the power-law and log profiles, which, by contrast, are not highly tuned to rotor-height measurements but rather can generalize to any site. Furthermore, there is no practical benefit in applying a machine-learning model at a site where winds at the heights relevant for wind energy production are known; rather, its performance at nearby locations (i.e., across a wind farm site) without rotor-height measurements is of most practical interest. To more fairly and practically compare machine-learning-based extrapolation to standard approaches, we implemented a round-robin extrapolation model comparison, in which a random-forest machine-learning model is trained and evaluated at different sites and then compared against the power-law and logarithmic profiles. We consider 20 months of lidar and sonic anemometer data collected at four sites between 50 and 100 km apart in the central United States. We find that the random forest outperforms the standard extrapolation approaches, especially when incorporating surface measurements as inputs to include the influence of atmospheric stability. When compared at a single site (the traditional comparison approach), the machine-learning improvement in mean absolute error was 28 % and 23 % over the power-law and logarithmic profiles, respectively. Using the round-robin approach proposed here, this improvement drops to 20 % and 14 %, respectively. These latter values better represent practical model performance, and we conclude that round-robin validation should be the standard for machine-learning-based wind speed extrapolation methods.

17 WIND ENERGY↗

Liver motion during cone beam computed tomography guided stereotactic body radiation therapy

Purpose: Understanding motion characteristics of liver such as, interfractional and intrafractional motion variability, difference in motion within different locations in the organ, and their complex relationship with the breathing cycles are particularly important for image-guided liver SBRT. The purpose of this study was to investigate such motion characteristics based on fiducial markers tracked with the x-ray projections of the CBCT scans, taken immediately prior to the treatments. Methods: Twenty liver SBRT patients were analyzed. Each patient had three fiducial markers (2 Multiplication-Sign 5-mm gold) percutaneously implanted around the gross tumor. The prescription ranged from 2 to 8 fractions per patient. The CBCT projections data for each fraction ({approx}650 projections/scan), for each patient, were analyzed and the 2D positions of the markers were extracted using an in-house algorithm. In total, >55 000 x-ray projections were analyzed from 85 CBCT scans. From the 2D extracted positions, a 3D motion trajectory of the markers was constructed, from each CBCT scans, resulting in left-right (LR), anterior-posterior (AP), and cranio-caudal (CC) location information of the markers with >55 000 data points. The authors then analyzed the interfraction and intrafraction liver motion variability, within different locations in the organ, and as a function of the breathing cycle. The authors also compared the motion characteristics against the planning 4DCT and the RPM Trade-Mark-Sign (Varian Medical Systems, Palo Alto, CA) breathing traces. Variations in the appropriate gating window (defined as the percent of the maximum range at which 50% of the marker positions are contained), between fractions were calculated as well. Results: The range of motion for the 20 patients were 3.0 {+-} 2.0 mm, 5.1 {+-} 3.1 mm, and 17.9 {+-} 5.1 mm in the planning 4DCT, and 2.8 {+-} 1.6 mm, 5.3 {+-} 3.1 mm, and 16.5 {+-} 5.7 mm in the treatment CBCT, for LR, AP, and CC directions, respectively. The range of respiratory period was 3.9 {+-} 0.7 and 4.2 {+-} 0.8 s during the 4DCT simulation and the CBCT scans, respectively. The authors found that breathing-induced AP and CC motions are highly correlated. That is, all markers moved cranially also moved posteriorly and vice versa, irrespective of the location. The LR motion had a more variable relationship with the AP/CC motions, and appeared random with respect to the location. That is, when the markers moved toward cranial-posterior direction, 58% of the markers moved to the patient-right, 22% of the markers moved to the patient-left, and 20% of the markers had minimal/none motion. The absolute difference in the motion magnitude between the markers, in different locations within the liver, had a positive correlation with the absolute distance between the markers (R{sup 2}= 0.69, linear-fit). The interfractional gating window varied significantly for some patients, with the largest having 29.4%-56.4% range between fractions. Conclusions: This study analyzed the liver motion characteristics of 20 patients undergoing SBRT. A large variation in motion was observed, interfractionally and intrafractionally, and that as the distance between the markers increased, the difference in the absolute range of motion also increased. This suggests that marker(s) in closest proximity to the target be used.

60 APPLIED LIFE SCIENCES↗

Exploring Light’s Interactions with Bubbles and Light Absorbers in Photoelectrochemical Devices using Ray Tracing

Ray tracing was used to perform optical optimization of arrays of photovoltaic microrods and explore the interaction between light and bubbles of oxygen gas on the surface of the microrods. The incident angle of light was varied over a wide range. The percent of incident light absorbed by the microrods and reflected by the bubbles was computed over this range. It was found that, for the 10 μm diameter, 100 μm tall SrTiO 3 microrods simulated in the model, the optimal center-­to-­center spacing was 14 μm for a square grid. This geometry produced 75% average and 90% maximum absorbance. For a triangular grid using the same microrods, the optimal center-­to-­center spacing was 14 μm. This geometry produced 67% average and 85% maximum absorbance. For a randomly laid out grid of 5 μm diameter, 100 μm tall SrTiO 3 microrods with an average center-­to-­center spacing of 20 μm, the average absorption was 23% and the maximum absorption was 43%. For a 50% areal coverage fraction of bubbles on the absorber surface, between 2%-­20% of the incident light energy was reflected away from the rods by the bubbles, depending upon incident angle and bubble morphology.

08 HYDROGEN↗

Machine learning for disruption warnings on Alcator C-Mod, DIII-D, and EAST

In this paper, we report on disruption prediction using a shallow machinelearning method known as Random Forests, trained on large databases containingonly plasma parameters that are available in real-time on Alcator C-Mod, DIII-D, and EAST. The database for each tokamak contains parameters sampled ~10 6 times throughout ~10 4 discharges (disruptive and non-disruptive) over the last 4years of operation. It is found that a number of parameters (e.g.P rad /P input ,l i ,n/n G ,B n=1 /B 0 ) exhibit changes in aggregate as a disruption is approached on one ormore of these tokamaks. However, for each machine, the most useful parameters,as well as the details of their precursor behaviors, are markedly different. When the prediction problem is framed using a binary classification scheme to discriminate between time slices "close to disruption" and "far from disruption," it is found that the prediction algorithms differ substantially in performance among the three machines ona time slice-by-time slice basis, but have similar disruption detection rates (~80-90%) on a shot-by-shot basis after appropriate optimisation. This could have important implications for disruption prediction and avoidance on ITER, for which developmentof a training database of disruptions may be infeasible. The algorithm's output is interpretable using a method that identifies the most strongly contributing inputsignals, which may have implications for avoiding disruptive scenarios. Lastly, to further support its real-time capability, successful applications in inter-shot and real-time environments on EAST and DIII-D are also discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗

Machine learning based algorithms for uncertainty quantification in numerical weather prediction models

Complex numerical weather prediction models incorporate a variety of physical processes, each described by multiple alternative physical schemes with specific parameters. The selection of the physical schemes and the choice of the corresponding physical parameters during model configuration can significantly impact the accuracy of model forecasts. There is no combination of physical schemes that works best for all times, at all locations, and under all conditions. It is therefore of considerable interest to understand the interplay between the choice of physics and the accuracy of the resulting forecasts under different conditions. This paper demonstrates the use of machine learning techniques to study the uncertainty in numerical weather prediction models due to the interaction of multiple physical processes. The first problem addressed herein is the estimation of systematic model errors in output quantities of interest at future times, and the use of this information to improve the model forecasts. The second problem considered is the identification of those specific physical processes that contribute most to the forecast uncertainty in the quantity of interest under specified meteorological conditions. In order to address these questions we employ two machine learning approaches, random forests and artificial neural networks. The discrepancies between model results and observations at past times are used to learn the relationships between the choice of physical processes and the resulting forecast errors. Numerical experiments are carried out with the Weather Research and Forecasting (WRF) model. The output quantity of interest is the model precipitation, a variable that is both extremely important and very challenging to forecast. The physical processes under consideration include various micro-physics schemes, cumulus parameterizations, short wave, and long wave radiation schemes. The experiments demonstrate the strong potential of machine learning approaches to aid the study of model errors.

97 MATHEMATICS AND COMPUTING↗

A machine learning-based service for estimating quality of genomes using PATRIC

Recent advances in high-volume sequencing technology and mining of genomes from metagenomic samples call for rapid and reliable genome quality evaluation. The current release of the PATRIC database contains over 220,000 genomes, and current metagenomic technology supports assemblies of many draft-quality genomes from a single sample, most of which will be novel. We have added two quality assessment tools to the PATRIC annotation pipeline. EvalCon uses supervised machine learning to calculate an annotation consistency score. EvalG implements a variant of the CheckM algorithm to estimate contamination and completeness of an annotated genome.We report on the performance of these tools and the potential utility of the consistency score. Additionally, we provide contamination, completeness, and consistency measures for all genomes in PATRIC and in a recent set of metagenomic assemblies. EvalG and EvalCon facilitate the rapid quality control and exploration of PATRIC-annotated draft genomes.

59 BASIC BIOLOGICAL SCIENCES↗

Accurate and efficient calculation of excitation energies with the active-space particle-particle random phase approximation

An efficient method for calculating excitation energies based on the particle-particle random phase approximation (ppRPA) is presented. Neglecting the contributions from the high-lying virtual states and the low-lying core states leads to the significantly smaller active-space ppRPA matrix while keeping the error to within 0.05 eV from the corresponding full ppRPA excitation energies. The resulting computational cost is significantly reduced and becomes less than the construction of the non-local Fock exchange potential matrix in the self-consistent-field (SCF) procedure. With only a modest number of active orbitals, the original ppRPA singlet-triplet (ST) gaps as well as the low-lying single and double excitation energies can be accurately reproduced at much reduced computational costs, up to 100 times faster than the iterative Davidson diagonalization of the original full ppRPA matrix. For high-lying Rydberg excitations where the Davidson algorithm fails, the computational savings of active-space ppRPA with respect to the direct diagonalization is even more dramatic. The virtues of the underlying full ppRPA combined with the significantly lower computational cost of the active-space approach will significantly expand the applicability of the ppRPA method to calculate excitation energies at a cost of O(K^{4}), with a prefactor much smaller than a single SCF Hartree-Fock (HF)/hybrid functional calculation, thus opening up new possibilities for the quantum mechanical study of excited state electronic structure of large systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Kinetic theory of particle-in-cell simulation plasma and the ensemble averaging technique

Abstract We derive the kinetic theory of fluctuations in physically and numerically stable particle-in-cell (PIC) simulations of electrostatic plasmas. The starting point is the single-time correlation at the start of the simulation between the statistical fluctuations of the weighted densities of macroparticle centers in the plasma particle phase-space. The fluctuations are associated with different initial conditions, typically due to the random initial conditions (in velocity space) of the macroparticles/simulation plasma, assigned according to their initial distribution of probability. The single-time correlations at all time steps and in each spatial grid cell are then determined from the Laplace–Fourier transforms of the discretized Klimontovich-like equation for the macroparticles and Maxwell’s equations for the fields, as computed by modern PIC codes. We recover the expressions for the electrostatic field and the plasma particle density fluctuation autocorrelation spectra as well as the kinetic equations describing the average evolution of PIC-simulated plasma particles, first derived by Langdon (1970b Proc. 4th Conf. Numerical Simulation of Plasmas ) using a test macroparticle approach perturbing a discretized Vlasovian plasma and then averaging the obtained physical quantity over the initial macroparticle velocity distribution. We generalize and extend these results to the modern algorithms in PIC codes using arbitrary macroparticle weights. Analytical estimates of statistical fluctuation amplitudes are derived as a function of the plasma simulation parameters, using the central limit theorem in the limit of a large number of macroparticles per cell. The theory is then used to analyze the ensemble averaging technique of PIC simulations where statistical averages are performed over ensembles of PIC simulations, modeling the same plasma physics problem but using different statistical realizations of the initial distribution functions of the macroparticles. This method is illustrated by linear Landau damping uncovering (from noise, which is usually considered numerical) the physical fluctuations driven by a single small amplitude electrostatic wave perturbing a PIC simulation plasma in equilibrium.

fluctuations correlations↗

Reversible simulations of elastic collisions

Consider a system of N identical hard spherical particles moving in a d-dimensional box and undergoing elastic, possibly multi-particle, collisions. We develop a new algorithm that recovers the pre-collision state from the post-collision state of the system, across a series of consecutive collisions, \textit{with essentially no memory overhead}. The challenge in achieving reversibility for an n-particle collision (where, in general, n<< N) arises from the presence of nd-d-1 degrees of freedom (arbitrary angles) during each collision, as well as from the complex geometrical constraints placed on the colliding particles. To reverse the collisions in a traditional simulation setting, all of the particular realizations of these degrees of freedom (angles) during the forward simulation must be tracked. This requires memory proportional to the number of collisions, which grows very fast with N and d, thereby severely limiting the \textit{de facto} applicability of the scheme. This limitation is addressed here by first performing a pseudo-randomization of angles, which ensures determinism in the reverse path for any values of n and d. To address the more difficult problem of geometrical and dynamic constraints, a new approach is developed which correctly samples the constrained phase space. Upon combining the pseudo-randomization with correct phase space sampling, perfect reversibility of collisions is achieved, as illustrated for n<=3, d=2, and n=2, d=3. This result enables, for the first time, reversible simulations of elastic collisions with essentially zero memory accumulation. In principle, the approach presented here could be generalized to larger values of n, which would be of definite interest for molecular dynamics simulations at high densities.

Perumalla, Kalyan S.↗

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗

Optimum Full Information, Unlimited Complexity, Invariant and Minimax Clock Skew and Offset Estimators for IEEE 1588

This paper presents the problem of clock skew and offset estimation for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Because of the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of clock skew and offset estimation schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity.

Cellular networks↗

Application of Markov Chain Monte Carlo Methods for Uncertainty Quantification in Inverse Transport Problems

Determination of the components of a radioactive source/shield system using the system’s radiation signature is of great importance in homeland security, material safeguards, and waste management. Although significant progress has been made toward solving this inverse transport problem in recent years, work remains to be done to quantify the uncertainty in reconstructed results. In this article we apply two Markov chain Monte Carlo (MCMC) approaches, the delayed rejection adaptive metropolis (DRAM) and differential evolution adaptive metropolis (DREAM) methods, to solve inverse problems and quantify uncertainty. The DRAM method uses delayed rejection combined with global adaptation of the proposal covariance matrix. Furthermore, the DREAM method hybridizes MCMC sampling with the differential evolution (DE) algorithm. In numerical test cases, the DRAM and DREAM methods are shown to be superior to a first-order inverse Hessian approach for problems with noisy data and multiple unknown quantities, with DREAM converging to the posterior distribution more quickly than DRAM. The DREAM and DRAM results indicate that a full posterior distribution is required to quantify uncertainty in many inverse transport problems.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DNS and LES of turbulent flow in a closed channel featuring a pattern of hemispherical roughness elements

Three mesh adaptivity algorithms were developed to facilitate and expedite the use of the CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques in accurate full-scale neutronics simulations of fusion energy systems with immense sizes and complicated geometries. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility and resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation. Additionally, because of the significant increase in the efficiency of FW-CADIS simulations, the three algorithms enabled this difficult calculation to be accurately solved on a regular computer cluster, eliminating the need for a world-class super computer.

Nuclear Science & Technology↗

Neural MUSE Analysis

Researchers at Oak Ridge National Laboratory (ORNL) created data as part of the MUSE (Multi-Agency Urban Search Experiment Detector and Algorithm Test Bed) project simulating illicit nuclear materials located in various buildings along a road. In the simulation, a truck containing a radiation detector drives down the road gathering listmode data (counting the and energy of incident gamma radiation). Building materials, source shielding, driving speed, truck direction, truck location on the road, source type, and source placement are all varied between runs of the data set. This data was created using deterministic neutron transport and Monte Carlo methods through a combination of SCALE, MAVRIC, MCNP, and GADRAS. As part of a follow-on NA-22 project, two Kaggle competitions were created to determine the best algorithms for finding and identifying gamma sources in this simulated urban environment. The winning algorithm was neural network-based and had a test accuracy of 76.4% accuracy for source identification. This work seeks to build upon this work and improve the results through the application of novel machine learning techniques. As a first step, the data was classified by a simple Convolutional Neural Network (CNN) To accomplish this, the data was first preprocessed into “waterfall plots.” These plots are composed of energy vs count plots that are stacked vertically to show progression in time. The horizontal axis indicating the particle energy incorporated user defined bin spacing with options for in linear-, logarithmic-, square root-, and user-spaced bins. The z or color dimension showed the number of counts corresponding the energy-time combination. This data was then used to generate more data, by generating a local estimate of the mean of the distribution for a bin and then randomly re-sampling that bin from a Poisson distribution. Once all of this data was generated, it was fed into a well-known CNN architecture, ResNet50. The output layer of this model was removed and replaced with layers corresponding to the shape desired isotope outputs. The provided training data was used to train the classifier and the remaining testing data was used to evaluate the model. Results are soon to be forthcoming.

61 RADIATION PROTECTION AND DOSIMETRY↗

Wind Energy Management System EMS Integration Project: Incorporating Wind Generation and Load Forecast Uncertainties into Power Grid Operations

The power system balancing process, which includes the scheduling, real time dispatch (load following) and regulation processes, is traditionally based on deterministic models. Since the conventional generation needs time to be committed and dispatched to a desired megawatt level, the scheduling and load following processes use load and wind and solar power production forecasts to achieve future balance between the conventional generation and energy storage on the one side, and system load, intermittent resources (such as wind and solar generation), and scheduled interchange on the other side. Although in real life the forecasting procedures imply some uncertainty around the load and wind/solar forecasts (caused by forecast errors), only their mean values are actually used in the generation dispatch and commitment procedures. Since the actual load and intermittent generation can deviate from their forecasts, it becomes increasingly unclear (especially, with the increasing penetration of renewable resources) whether the system would be actually able to meet the conventional generation requirements within the look-ahead horizon, what the additional balancing efforts would be needed as we get closer to the real time, and what additional costs would be incurred by those needs. To improve the system control performance characteristics, maintain system reliability, and minimize expenses related to the system balancing functions, it becomes necessary to incorporate the predicted uncertainty ranges into the scheduling, load following, and, in some extent, into the regulation processes. It is also important to address the uncertainty problem comprehensively by including all sources of uncertainty (load, intermittent generation, generators’ forced outages, etc.) into consideration. All aspects of uncertainty such as the imbalance size (which is the same as capacity needed to mitigate the imbalance) and generation ramping requirement must be taken into account. The latter unique features make this work a significant step forward toward the objective of incorporating of wind, solar, load, and other uncertainties into power system operations. Currently, uncertainties associated with wind and load forecasts, as well as uncertainties associated with random generator outages and unexpected disconnection of supply lines, are not taken into account in power grid operation. Thus, operators have little means to weigh the likelihood and magnitude of upcoming events of power imbalance. In this project, funded by the U.S. Department of Energy (DOE), a framework has been developed for incorporating uncertainties associated with wind and load forecast errors, unpredicted ramps, and forced generation disconnections into the energy management system (EMS) as well as generation dispatch and commitment applications. A new approach to evaluate the uncertainty ranges for the required generation performance envelope including balancing capacity, ramping capability, and ramp duration has been proposed. The approach includes three stages: forecast and actual data acquisition, statistical analysis of retrospective information, and prediction of future grid balancing requirements for specified time horizons and confidence levels. Assessment of the capacity and ramping requirements is performed using a specially developed probabilistic algorithm based on a histogram analysis, incorporating all sources of uncertainties of both continuous (wind and load forecast errors) and discrete (forced generator outages and start-up failures) nature. A new method called the “flying brick” technique has been developed to evaluate the look-ahead required generation performance envelope for the worst case scenario within a user-specified confidence level. A self-validation algorithm has been developed to validate the accuracy of the confidence intervals.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Out-of-time-order correlators and Lyapunov exponents in sparse SYK

We use a combination of analytical and numerical methods to study out-of-time order correlators (OTOCs) in the sparse Sachdev-Ye-Kitaev (SYK) model. We find that at a given order of N, the standard result for the q-local, all-to-all SYK, obtained through the sum over ladder diagrams, is corrected by a series in the sparsity parameter, k. We present an algorithm to sum the diagrams at any given order of 1/(kq) n . We also study OTOCs numerically as a function of the sparsity parameter and determine the Lyapunov exponent. We find that numerical stability when extracting the Lyapunov exponent requires averaging over a massive number of realizations. This trade-off between the efficiency of the sparse model and consistent behavior at finite N becomes more significant for larger values of N.

2D gravity↗