Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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,711 records · Page 95

A Real-Time Big Data Control-Theoretical Framework for Cyber-Physical-Human Systems [Book Chapter]

It is known that cyber-physical-human systems naturally arise from interdependent infrastructure systems and smart connected communities. Such applications require ubiquitous information sensing and processing, intelligent machine-to-machine communication for a seamless coordination, as well as intelligent interactions between humans and machines. This chapter presents a control-theoretical framework to model heterogeneous physical dynamic systems, information and communication, as well as cooperative controls and/or distributed optimization of such interconnected systems. It is shown that efficient analytical and computational algorithms can be modularly designed and hierarchically implemented to operate and optimize cyber-physical-human systems, first to quantify individually the input–output relationship of nonlinear dynamic behaviors of every physical subsystem, then to coordinate locally both cyber-physical interactions of neighboring agents as well as physical-human interactions, and finally to dynamically model and optimize the overall networked system. The hierarchical structure makes the overall optimization and control problem scalable and solvable. Moreover, the three levels integrate individual designs and optimization, distributed cooperative optimization, and decision-making through real-time, data-driven, model-based learning and control. Specifically, one of the contributions of the chapter is to demonstrate how the combination of dissipativity theory and cooperative control serves as a natural framework and promising tools to analyze, optimize, and control such large-scale system. Application to digital grid is investigated as an illustrative example.

97 MATHEMATICS AND COMPUTING↗

A Fast Scalable Quasi-Static Time Series Analysis Method for PV Impact Studies Using Linear Sensitivity Model

Understanding the impact of distributed photovoltaic (PV) resources on various elements of the distribution feeder is imperative for their cost effective integration. A year-long quasi-static time series (QSTS) simulation at 1-second granularity is often necessary to fully study these impacts. However, the significant computational burden associated with running QSTS simulations is a major challenge to their adoption. In this paper, we propose a fast scalable QSTS simulation algorithm that is based on a linear sensitivity model for estimating voltage-related PV impact metrics of a three-phase unbalanced, nonradial distribution system with various discrete step control elements including tap changing transformers and capacitor banks. Here, the algorithm relies on computing voltage sensitivities while taking into account all the effects of discrete controllable elements in the circuit. Consequently, the proposed sensitivity model can accurately estimate the state of controllers at each time step and the number of control actions throughout the year. For the test case of a real distribution feeder with 2969 buses (5469 nodes), 6 load/PV time series power profiles, and 9 voltage regulating elements including controller delays, the proposed algorithm demonstrates a dramatic time reduction, more than 180 times faster than traditional QSTS techniques.

14 SOLAR ENERGY↗

Density fields and halo mass functions in the geometrical adhesion toy model

In dimension 2 and above, the Burgers dynamics, the so-called 'adhesion model' in cosmology, can actually give rise to several dynamics in the inviscid limit. We investigate here the statistical properties of the density field when it is defined by a 'geometrical model' associated with this Burgers velocity field and where the matter distribution is fully determined, at each time step, by geometrical constructions. Our investigations are based on a set of numerical experiments that make use of an improved algorithm, for which the geometrical constructions are efficient and robust. In this work we focus on Gaussian initial conditions with power-law power spectra of slope n in the range -3<n<1, where a self-similar evolution develops, and we compute the behavior of power spectra, density probability distributions and mass functions. As expected for such dynamics, the density power spectra show universal high-k tails that are governed by the formation of pointlike masses. The two other statistical indicators however show the same qualitative properties as those observed for 3D gravitational clustering. In particular, the mass functions obey a Press-Schechter like scaling up to a very good accuracy in 1D, and to a lesser extent in 2D. Our results suggest that the 'geometrical adhesion model', whose solution is fully known at all times, provides a precious tool to understand some of the statistical constructions frequently used to study the development of mass halos in gravitational clustering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Kernelized Generalized Likelihood Ratio Test for Spectrum Sensing in Cognitive Radio

Spectrum sensing in next-generation wireless radio networks is considered a key technology to overcome the problem of spectrum scarcity. Unfortunately, many approaches to spectrum sensing do not work well in low signal-to-noise ratio (SNR) environments. This paper proposes and analyzes a new algorithm named kernelized generalized likelihood ratio test (KGLRT) for spectrum sensing in cognitive radio systems to overcome this problem. Effectively, KGLRT uses a nonlinear kernel to map input data onto a high-dimensional feature space; then, the widely accepted (linear) generalized likelihood ratio test is used for hypothesis testing. This new algorithm gives a gain of 4 dB in SNR over its linear counterpart. A theoretical analysis for this algorithm is given for the first time and is shown analogous to algorithms used in image signal processing. The detection metrics are found to be concentrated random variables; furthermore, the probability distributions of the detection metrics are proved to follow the F -distributions, which agree with the results obtained using the concentration inequality. The analytical thresholds are derived for target false-alarm probabilities. Here, the thresholds are independent of noise power; thus, the proposed algorithm can overcome noise uncertainty issues at very low SNR levels. Simulations validate the theoretical results.

47 OTHER INSTRUMENTATION↗

Do Epistemic Uncertainties Allow for Replacing Microstructural Experiments with Reconstruction Algorithms?

A novel problem in computational materials modeling is addressed: “Are the computational microstructure reconstruction techniques reliable enough to replace experiments?” Here, “reliable” computations are associated with producing “expected” reconstructions that are adequately close to the experimental data. The output of computational techniques can deviate from the experimental measurements because of the epistemic uncertainties in the algorithms. In this work, an analytical formulation for quantification of epistemic uncertainties in a microstructure reconstruction algorithm based on Markov random field is presented. The method is used to predict the large-scale spatial distribution of a microstructure given an experimental input measured over a small spatial domain. However, small variations are observed on the microstructural features of the synthesized samples due to the Markov random field algorithm. The proposed analytical technique aims to quantify these uncertainties and estimate their propagation to the macroscale material properties to provide a significant understanding on how reliable it is to replace the experiments with the Markov random field model to predict microstructural maps over large spatial domains.

97 MATHEMATICS AND COMPUTING↗

Scalable Distributed Memory Community Detection Using Vite

Graph clustering, popularly known as community detection, is a fundamental graph operation used in several applications of relevance for network analysis and cybersecurity. Community detection is an operation of partitioning a network into an arbitrary number of “communities” such that each com munity represents a tightly-knit group of nodes with relatively sparser connections to the rest of the nodes in the network. The need to compute clustering on large-scale networks necessitates the development of efficient parallel algorithms capable of exploiting modern parallel architectures. However, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the 2018 Graph Challenge, we present Vite which is a distributed-memory parallel community detection method. Vite is a parallelization of the algorithmic template provided by a widely-used serial method (Louvain). Alongside, it uses several heuristics aimed at significantly improving parallelism and performance, while preserving output quality. Using the inputs from the 2018 Graph Challenge (static and streaming), we demonstrate superior performance and high quality solutions based on four parallelization heuristics.

community detection↗

Towards robust autonomous impedance spectroscopy analysis: A calibrated hierarchical Bayesian approach for electrochemical impedance spectroscopy (EIS) inversion

Distribution-based analyses, such as the distribution of relaxation times (DRT) and the distribution of diffusion times (DDT), present model-free alternatives to equivalent circuit modeling for analysis of electrochemical impedance spectroscopy (EIS) data. However, reconstructing such distributions from noisy impedance data is an ill-posed problem that must be solved with specialized inversion algorithms, requiring careful control and tuning. Furthermore, most inversion algorithms developed to date can only solve problems of limited complexity. Herein, we present a new hierarchical Bayesian method for EIS inversion, leveraging efficient algorithms for optimization and Hamiltonian Monte Carlo (HMC) sampling to solve models of arbitrary complexity. We overcome the challenge of ad-hoc parameter tuning by encoding intrinsic characteristics of the DRT and DDT into flexible prior distributions and “pre-calibrating” the model to simulated data. This approach is versatile, highly robust to noise, and provides quantitative estimates of both the error structure of the data and the uncertainty in the recovered distributions. The model is validated with simulated data to demonstrate accurate recovery of the DRT and the DDT. The method also shows promise for simultaneous recovery of multiple distributions, raising the intriguing possibility of semi-autonomous EIS analysis and ad-hoc model construction. Finally, the practical utility of the method is illustrated with experimental data. Throughout, we draw comparisons to several recently published EIS inversion methodologies.

36 MATERIALS SCIENCE↗

Resilient Communication Scheme for Distributed Decision of Interconnecting Networks of Microgrids

Networking of microgrids can provide the operational flexibility needed for the increasing number of DERs deployed at the distribution level and supporting end-use demand when there is loss of the bulk power system. But, networked microgrids are vulnerable to cyber-physical attacks and faults due to the complex interconnections. As such, it is necessary To design resilient control systems to support the operations of networked microgrids in responses to cyber-physical attacks and faults. This paper introduces a resilient communication scheme for interconnecting multiple microgrids to support critical demand, in which the interconnection decision can be made distributedly by each microgrid controller even in the presence of cyberattacks to some communication links or microgrid controllers. This scheme blends a randomized peer-to-peer communication network for exchanging information among controllers and resilient consensus algorithms for achieving reliable interconnection agreement. The network of 6 microgrids divided from a modified 123-node test distribution feeder is used to demonstrate the effectiveness of the proposed resilient communication scheme.

Vu, Thanh Long↗

MALT90 Kinematic Distances to Dense Molecular Clumps

Using molecular-line data from the Millimetre Astronomy Legacy Team 90 GHz Survey (MALT90), we have estimated kinematic distances to 1905 molecular clumps identified in the ATLASGAL 870 μ m continuum survey over the longitude range 295° < l < 350°. The clump velocities were determined using a flux-weighted average of the velocities obtained from Gaussian fits to the HCO{sup +}, HNC, and N{sub 2}H{sup +} (1–0) transitions. The near/far kinematic distance ambiguity was addressed by searching for the presence or absence of absorption or self-absorption features in 21 cm atomic hydrogen spectra from the Southern Galactic Plane Survey. Our algorithm provides an estimation of the reliability of the ambiguity resolution. The Galactic distribution of the clumps indicates positions where the clumps are bunched together, and these locations probably trace the locations of spiral arms. Several clumps fall at the predicted location of the far side of the Scutum–Centaurus arm. Moreover, a number of clumps with positive radial velocities are unambiguously located on the far side of the Milky Way at galactocentric radii beyond the solar circle. The measurement of these kinematic distances, in combination with continuum or molecular-line data, now enables the determination of fundamental parameters such as mass, size, and luminosity for each clump.

79 ASTRONOMY AND ASTROPHYSICS↗

Modified GMDH-NN algorithm and its application for global sensitivity analysis

Global sensitivity analysis (GSA) is a very useful tool to evaluate the influence of input variables in the whole distribution range. Sobol' method is the most commonly used among variance-based methods, which are efficient and popular GSA techniques. High dimensional model representation (HDMR) is a popular way to compute Sobol' indices, however, its drawbacks cannot be ignored. We show that modified GMDH-NN algorithm can calculate coefficients of metamodel efficiently, so this paper aims at combining it with HDMR and proposes GMDH-HDMR method. The new method shows higher precision and faster convergent rate. Several numerical and engineering examples are used to confirm its advantages. - Highlights: • The GMDH-NN is improved to construct the explicit polynomial model of optimal complexity by self-organization. • The paper aims at combining improved GMDH-NN with HDMR expansions and using it to compute Sobol' indices directly. • The method can be applied in uniform, normal and exponential distribution by using suitable orthogonal polynomials. • Engineering examples, e.g., electronic circuit models can be solved by the presented method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Experimental evaluation of a spatial resampling technique to improve the accuracy of pencil-beam dose calculation in proton therapy

Purpose: In proton therapy, pencil-beam algorithms (PBAs) are the most widely used dose calculation methods. However, the PB calculations that employ one-dimensional density scaling neglect the effects of lateral density heterogeneity on the dose distributions, whereas some particles included in such pencil beams could overextend beyond the interface of the density heterogeneity. We have simplified a pencil-beam redefinition algorithm (PBRA), which was proposed for electron therapy, by a spatial resampling technique toward an application for proton therapy. The purpose of this study is to evaluate the calculation results of the spatial resampling technique in terms of lateral density heterogeneity by comparison with the dose distributions that were measured in heterogeneous slab phantoms. Methods: The pencil beams are characterized for multiple residual-range (i.e., proton energy) bins. To simplify the PBRA, the given pencil beams are resampled on one or two transport planes, in which smaller sub-beams that are parallel to each other are generated. We addressed the problem of lateral density heterogeneity comparing the calculation results to the dose distributions measured at different depths in heterogeneous slab phantoms using a two-dimensional detector. Two heterogeneity slab phantoms, namely, phantoms A and B, were designed for the measurements and calculations. In phantom A, the heterogeneity slab was placed close to the surface. On the other hand, in phantom B, it was placed close to the Bragg peak in the mono-energetic proton beam. Results: In measurements, lateral dose profiles showed a dose reduction and increment in the vicinity of x= 0 mm in both phantoms at depths z= 142 and 161 mm due to lateral particle disequilibrium. In phantom B, these dose reduction/increment effects were higher/lower, respectively, than those in phantom A. This is because a longer distance from the surface to the heterogeneous slab increases the strength of proton scattering. Sub-beams, which were generated from the resampling plane, formed a detouring/overextending path that was different from that of elemental pencil beams. Therefore, when the spatial resampling was implemented at the surface and immediately upstream of the lateral heterogeneity, the calculation could predict these dose reduction/increment effects. Without the resampling procedure, these dose reduction/increment effects could not be predicted in both phantoms owing to the blurring of the pencil beam. We found that the PBA with the spatial resampling technique predicted the dose reduction/increment at the dose profiles in both phantoms when the sampling plane was defined immediately upstream of the heterogeneous slab. Conclusions: We have demonstrated the implementation of a spatial resampling technique for pencil-beam calculation to address the problem of lateral density heterogeneity. While further validation is required for clinical use, this study suggests that the spatial resampling technique can make a significant contribution to proton therapy.

61 RADIATION PROTECTION AND DOSIMETRY↗

Development and Validation of a Lifecycle-based Prognostics Architecture with Test Bed Validation

On-line monitoring and tracking of nuclear plant system and component degradation is being investigated as a method for improving the safety, reliability, and maintainability of aging nuclear power plants. Accurate prediction of the current degradation state of system components and structures is important for accurate estimates of their remaining useful life (RUL). The correct quantification and propagation of both the measurement uncertainty and model uncertainty is necessary for quantifying the uncertainty of the RUL prediction. This research project developed and validated methods to perform RUL estimation throughout the lifecycle of plant components. Prognostic methods should seamlessly operate from beginning of component life (BOL) to end of component life (EOL). We term this "Lifecycle Prognostics." When a component is put into use, the only information available may be past failure times of similar components used in similar conditions, and the predicted failure distribution can be estimated with reliability methods such as Weibull Analysis (Type I Prognostics). As the component operates, it begins to degrade and consume its available life. This life consumption may be a function of system stresses, and the failure distribution should be updated to account for the system operational stress levels (Type II Prognostics). When degradation becomes apparent, this information can be used to again improve the RUL estimate (Type III Prognostics). This research focused on developing prognostics algorithms for the three types of prognostics, developing uncertainty quantification methods for each of the algorithms, and, most importantly, developing a framework using Bayesian methods to transition between prognostic model types and update failure distribution estimates as new information becomes available. The developed methods were then validated on a range of accelerated degradation test beds. The ultimate goal of prognostics is to provide an accurate assessment for RUL predictions, with as little uncertainty as possible. From a reliability and maintenance standpoint, there would be improved safety by avoiding all failures. Calculated risk would decrease, saving money by avoiding unnecessary maintenance. One major bottleneck for data-driven prognostics is the availability of run-to-failure degradation data. Without enough degradation data leading to failure, prognostic models can yield RUL distributions with large uncertainty or mathematically unsound predictions. To address these issues a "Lifecycle Prognostics" method was developed to create RUL distributions from Beginning of Life (BOL) to End of Life (EOL). This employs established Type I, II, and III prognostic methods, and Bayesian transitioning between each Type. Bayesian methods, as opposed to classical frequency statistics, show how an expected value, a priori, changes with new data to form a posterior distribution. For example, when you purchase a component you have a prior belief, or estimation, of how long it will operate before failing. As you operate it, you may collect information related to its condition that will allow you to update your estimated failure time. Bayesian methods are best used when limited data are available. The use of a prior also means that information is conserved when new data are available. The weightings of the prior belief and information contained in the sampled data are dependent on the variance (uncertainty) of the prior, the variance (uncertainty) of the data, and the amount of measured data (number of samples). If the variance of the prior is small compared to the uncertainty of the data, the prior will be weighed more heavily. However, as more data are collected, the data will be weighted more heavily and will eventually swamp out the prior in calculating the posterior distribution of model parameters. Fundamentally Bayesian analysis updates a prior belief with new data to get a posterior belief. The general approach to applying the Bayesian method to lifecycle prognostics consisted of identifying the prior, which is the RUL estimate and uncertainty from the previous prognostics type, and combining it with observational data related to the newer prognostics type. The resulting lifecycle prognostics algorithm uses all available information throughout the component lifecycle.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Joint reconstruction of x-ray fluorescence and transmission tomography

X-ray fluorescence tomography is based on the detection of fluorescence x-ray photons produced following x-ray absorption while a specimen is rotated; it provides information on the 3D distribution of selected elements within a sample. One limitation in the quality of sample recovery is the separation of elemental signals due to the finite energy resolution of the detector. Another limitation is the effect of self-absorption, which can lead to inaccurate results with dense samples. To recover a higher quality elemental map, we combine x-ray fluorescence detection with a second data modality: conventional x-ray transmission tomography using absorption. By using these combined signals in a nonlinear optimization-based approach, we demonstrate the benefit of our algorithm on real experimental data and obtain an improved quantitative reconstruction of the spatial distribution of dominant elements in the sample. Furthermore, compared with single-modality inversion based on x-ray fluorescence alone, this joint inversion approach reduces ill-posedness and should result in improved elemental quantification and better correction of self-absorption.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

HIERARCHICAL PROBABILISTIC INFERENCE OF COSMIC SHEAR

Point estimators for the shearing of galaxy images induced by gravitational lensing involve a complex inverse problem in the presence of noise, pixelization, and model uncertainties. We present a probabilistic forward modeling approach to gravitational lensing inference that has the potential to mitigate the biased inferences in most common point estimators and is practical for upcoming lensing surveys. The first part of our statistical framework requires specification of a likelihood function for the pixel data in an imaging survey given parameterized models for the galaxies in the images. We derive the lensing shear posterior by marginalizing over all intrinsic galaxy properties that contribute to the pixel data (i.e., not limited to galaxy ellipticities) and learn the distributions for the intrinsic galaxy properties via hierarchical inference with a suitably flexible conditional probabilitiy distribution specification. We use importance sampling to separate the modeling of small imaging areas from the global shear inference, thereby rendering our algorithm computationally tractable for large surveys. With simple numerical examples we demonstrate the improvements in accuracy from our importance sampling approach, as well as the significance of the conditional distribution specification for the intrinsic galaxy properties when the data are generated from an unknown number of distinct galaxy populations with different morphological characteristics.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Robust Real-Time Modeling of Distribution Systems with Data-Driven Grid-Wise Observability (Final Technical Report)

The overall objective of this project is to leverage existing and emerging sensor measurements to develop data-driven observability enhancement algorithms as well as robust state estimation and parameter identification techniques to enable real-time grid-wise monitoring and modeling of loads and distributed energy resources (DERs). The project resulted in a holistic framework with the following key components: 1) data-driven and machine learning-based grid-edge visibility enhancement, 2) robust branch-current-based state estimation (BCSE), and 3) robust real-time steady-state and dynamic-state modeling of loads and DERs. The research outcomes have provided utility companies better network visibility, higher-fidelity load/DER models, and more accurate assessment of DERs’ impacts, thus, facilitating the integration of renewable energy sources. The synergistic collaborative project among Iowa State University (ISU), Argonne National Laboratory (ANL), Electric Power Research Center (EPRC), SIEMENS Industry, Alliant Energy, Cedar Falls Utilities (CFU), and Maquoketa Valley Electric Cooperative (MVEC) to leverage the team’s extensive expertise and experience in power distribution systems, state estimation, online modeling and identification, and DER integrations. The proposed frameworks have been verified with industry adopted software and attempted integrated with existing tool wherever possible

24 POWER TRANSMISSION AND DISTRIBUTION↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗