arXiv subjects

Anna Scaglione

Publications and source records attributed to Anna Scaglione.

At least 55 records · Page 3Linked to original sources

arXiv2020

Integrating Hardware Security into a Blockchain-Based Transactive Energy Platform

This applied research paper introduces a novel framework for integrating hardware security and blockchain functionality with grid-edge devices to establish a distributed cyber-security mechanism that verifies the provenance of messages to and from the devices. Expanding the idea of Two Factor Authentication and Hardware Root of Trust, this work describes the development of a Cryptographic Trust Center(TM) (CTC(TM)) chip integrated into grid-edge devices to create uniform cryptographic key management. Product managers, energy system designers, and security architects can utilize this modular framework as a unified approach to manage distributed devices of various vendors, vintages, and sizes. Results demonstrate the application of CTC(TM) to a blockchain-based Transactive Energy (TE) platform for provisioning of cryptographic keys and improved uniformity of the operational network and data management. This process of configuring, installing, and maintaining keys is described as Eco-Secure Provisioning(TM) (ESP(TM)). Laboratory test results show the approach can resolve several cyber-security gaps in common blockchain frameworks such as Hyperledger Fabric.

cs.CR↗

arXiv2020

A User Guide to Low-Pass Graph Signal Processing and its Applications

The notion of graph filters can be used to define generative models for graph data. In fact, the data obtained from many examples of network dynamics may be viewed as the output of a graph filter. With this interpretation, classical signal processing tools such as frequency analysis have been successfully applied with analogous interpretation to graph data, generating new insights for data science. What follows is a user guide on a specific class of graph data, where the generating graph filters are low-pass, i.e., the filter attenuates contents in the higher graph frequencies while retaining contents in the lower frequencies. Our choice is motivated by the prevalence of low-pass models in application domains such as social networks, financial markets, and power systems. We illustrate how to leverage properties of low-pass graph filters to learn the graph topology or identify its community structure; efficiently represent graph data through sampling, recover missing measurements, and de-noise graph data; the low-pass property is also used as the baseline to detect anomalies.

eess.SP↗

arXiv2020

Physical Education and English Language Arts Based K-12 Engineering Outreach in Software Defined Networking (Extended Version)

K-12 engineering outreach has typically focused on elementary electrical and mechanical engineering or robot experiments integrated in science or math classes. In contrast, we propose a novel outreach program focusing on communication network principles that enable the ubiquitous web and smart-phone applications. We design outreach activities that illustrate the communication network principles through activities and team competitions in physical education (PE) as well as story writing and cartooning in English Language Arts (ELA) classes. The PE activities cover the principles of store-and-forward packet switching, Hypertext Transfer Protocol (HTTP) web page download, connection establishment in cellular wireless networks, as well as packet routing in Software-Defined Networking (SDN). The proposed outreach program has been formatively evaluated by K-12 teachers. A survey for the evaluation of the impact of the outreach program on the student perceptions, specifically, the students' interest, self-efficacy, utility, and negative stereotype perceptions towards communication network engineering, is also presented.

cs.NI↗

arXiv2020

Accelerating Incremental Gradient Optimization with Curvature Information

This paper studies an acceleration technique for incremental aggregated gradient ({\sf IAG}) method through the use of \emph{curvature} information for solving strongly convex finite sum optimization problems. These optimization problems of interest arise in large-scale learning applications. Our technique utilizes a curvature-aided gradient tracking step to produce accurate gradient estimates incrementally using Hessian information. We propose and analyze two methods utilizing the new technique, the curvature-aided IAG ({\sf CIAG}) method and the accelerated CIAG ({\sf A-CIAG}) method, which are analogous to gradient method and Nesterov's accelerated gradient method, respectively. Setting $κ$ to be the condition number of the objective function, we prove the $R$ linear convergence rates of $1 - \frac{4c_0 κ}{(κ+1)^2}$ for the {\sf CIAG} method, and $1 - \sqrt{\frac{c_1}{2κ}}$ for the {\sf A-CIAG} method, where $c_0,c_1 \leq 1$ are constants inversely proportional to the distance between the initial point and the optimal solution. When the initial iterate is close to the optimal solution, the $R$ linear convergence rates match with the gradient and accelerated gradient method, albeit {\sf CIAG} and {\sf A-CIAG} operate in an incremental setting with strictly lower computation complexity. Numerical experiments confirm our findings. The source codes used for this paper can be found on \url{http://github.com/hoitowai/ciag/}.

math.OC↗

arXiv2019

Detection and Isolation of Adversaries in Decentralized Optimization for Non-Strongly Convex Objectives

Decentralized optimization has found a significant utility in recent years, as a promising technique to overcome the curse of dimensionality when dealing with large-scale inference and decision problems in big data. While these algorithms are resilient to node and link failures, they however, are not inherently Byzantine fault-tolerant towards insider data injection attacks. This paper proposes a decentralized robust subgradient push (RSGP) algorithm for detection and isolation of malicious nodes in the network for optimization non-strongly convex objectives. In the attack considered in this work, the malicious nodes follow the algorithmic protocols, but can alter their local functions arbitrarily. However, we show that in sufficiently structured problems, the method proposed is effective in revealing their presence. The algorithm isolates detected nodes from the regular nodes, thereby mitigating the ill-effects of malicious nodes. We also provide performance measures for the proposed method.

eess.SY↗

arXiv2019

Keeping Them Honest: a Trustless Multi-Agent Algorithm to Validate Transactions Cleared on Blockchain using Physical Sensors

In recent years, many Blockchain based frameworks for transacting commodities on a congestible network have been proposed. In particular, as the number of controllable grid connected assets increases, there is a need for a decentralized, coupled economic and control mechanism to dynamically balance the entire electric grid. Blockchain based Transactive Energy (TE) systems have gained significant momentum as an approach to sustain the reliability and security of the power grid in order to support the flexibility of electricity demand. What is lacking in these designs, however, is a mechanism that physically verifies all the energy transactions, to keep the various inherently selfish players honest. In this paper, we introduce a secure peer-to-peer network mechanism for the physical validation of economic transactions cleared over a distributed ledger. The framework is $\textit{secure}$ in the sense that selfish and malicious agents that are trying to inject false data into the network are prevented from adversely affecting the optimal functionality of the verification process by detecting and isolating them from the communication network. Preliminary simulations focusing on TE show the workings of this framework.

eess.SP↗

arXiv2019

A Framework for Generating Synthetic Distribution Feeders using OpenStreetMap

This work proposes a framework to generate synthetic distribution feeders mapped to real geo-spatial topologies using available OpenStreetMap data. The synthetic power networks can facilitate power systems research and development by providing thousands of realistic use cases. The location of substations is taken from recent efforts to develop synthetic transmission test cases, with underlying real and reactive power in the distribution network assigned using population information gathered from United States 2010 Census block data. The methods illustrate how to create individual synthetic distribution feeders, and groups of feeders across entire ZIP Code, with minimal input data for any location in the United States. The framework also has the capability to output data in \OpenDSS format to allow further simulation and analysis.

eess.SY↗

arXiv2019

An Adversarial Model for Attack Vector Vulnerability Analysis on Power and Gas Delivery Operations

Power systems often rely on natural gas pipeline networks to supply fuel for gas-fired generation. Market inefficiencies and a lack of formal coordination between the wholesale power and gas delivery infrastructures may magnify the broader impact of a cyber-attack on a natural gas pipeline. In this study we present a model that can be used to quantify the impact of cyber-attacks on electricity and gas delivery operations. We model activation of cyber-attack vectors that attempt to gain access to pipeline gas compressor controls using a continuous-time Markov chain over a state space based on the gas operator Industrial Control System firewall zone partition. Our approach evaluates the operating states and decision-making in the networks using physically realistic and operationally representative models. We summarize these models, the sequence of analyses used to quantify the impacts of a cyber-incident, and propose a Monte Carlo simulation approach to quantify the resulting effect on the reliability of the bulk power system by the increase in operational cost. The methodology is applied to a case study of interacting power, gas, and cyber test networks.

eess.SY↗

arXiv2019

Blind Community Detection from Low-rank Excitations of a Graph Filter

This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes. We model the observed signals as noisy outputs of an unknown network process, represented as a graph filter that is excited by a set of unknown low-rank inputs/excitations. Application scenarios of this model include diffusion dynamics, pricing experiments, and opinion dynamics. Rather than learning the precise parameters of the graph itself, we aim at retrieving the community structure directly. The paper shows that communities can be detected by applying a spectral method to the covariance matrix of graph signals. Our analysis indicates that the community detection performance depends on a `low-pass' property of the graph filter. We also show that the performance can be improved via a low-rank matrix plus sparse decomposition method when the latent parameter vectors are known. Numerical experiments demonstrate that our approach is effective.

cs.SI↗

arXiv2018

SUCAG: Stochastic Unbiased Curvature-aided Gradient Method for Distributed Optimization

We propose and analyze a new stochastic gradient method, which we call Stochastic Unbiased Curvature-aided Gradient (SUCAG), for finite sum optimization problems. SUCAG constitutes an unbiased total gradient tracking technique that uses Hessian information to accelerate con- vergence. We analyze our method under the general asynchronous model of computation, in which each function is selected infinitely often with possibly unbounded (but sublinear) delay. For strongly convex problems, we establish linear convergence for the SUCAG method. When the initialization point is sufficiently close to the optimal solution, the established convergence rate is only dependent on the condition number of the problem, making it strictly faster than the known rate for the SAGA method. Furthermore, we describe a Markov-driven approach of implementing the SUCAG method in a distributed asynchronous multi-agent setting, via gossiping along a random walk on an undirected communication graph. We show that our analysis applies as long as the graph is connected and, notably, establishes an asymptotic linear convergence rate that is robust to the graph topology. Numerical results demonstrate the merits of our algorithm over existing methods.

math.OC↗

arXiv2018

Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems

Decentralized optimization algorithms have received much attention due to the recent advances in network information processing. However, conventional decentralized algorithms based on projected gradient descent are incapable of handling high dimensional constrained problems, as the projection step becomes computationally prohibitive to compute. To address this problem, this paper adopts a projection-free optimization approach, a.k.a.~the Frank-Wolfe (FW) or conditional gradient algorithm. We first develop a decentralized FW (DeFW) algorithm from the classical FW algorithm. The convergence of the proposed algorithm is studied by viewing the decentralized algorithm as an inexact FW algorithm. Using a diminishing step size rule and letting $t$ be the iteration number, we show that the DeFW algorithm's convergence rate is ${\cal O}(1/t)$ for convex objectives; is ${\cal O}(1/t^2)$ for strongly convex objectives with the optimal solution in the interior of the constraint set; and is ${\cal O}(1/\sqrt{t})$ towards a stationary point for smooth but non-convex objectives. We then show that a consensus-based DeFW algorithm meets the above guarantees with two communication rounds per iteration. Furthermore, we demonstrate the advantages of the proposed DeFW algorithm on low-complexity robust matrix completion and communication efficient sparse learning. Numerical results on synthetic and real data are presented to support our findings.

math.OC↗

arXiv2018

Low-Resolution Fault Localization Using Phasor Measurement Units with Community Detection

A significant portion of the literature on fault localization assumes (more or less explicitly) that there are sufficient reliable measurements to guarantee that the system is observable. While several heuristics exist to break the observability barrier, they mostly rely on recognizing spatio-temporal patterns, without giving insights on how the performance are tied with the system features and the sensor deployment. In this paper, we try to fill this gap and investigate the limitations and performance limits of fault localization using Phasor Measurement Units (PMUs), in the low measurements regime, i.e., when the system is unobservable with the measurements available. Our main contribution is to show how one can leverage the scarce measurements to localize different type of distribution line faults (three-phase, single-phase to ground, ...) at the level of sub-graph, rather than with the resolution of a line. We show that the resolution we obtain is strongly tied with the graph clustering notion in network science.

eess.SY↗

arXiv2018

Decentralized DC MicroGrid Monitoring and Optimization via Primary Control Perturbations

We treat the emerging power systems with direct current (DC) MicroGrids, characterized with high penetration of power electronic converters. We rely on the power electronics to propose a decentralized solution for autonomous learning of and adaptation to the operating conditions of the DC Mirogrids; the goal is to eliminate the need to rely on an external communication system for such purpose. The solution works within the primary droop control loops and uses only local bus voltage measurements. Each controller is able to estimate (i) the generation capacities of power sources, (ii) the load demands, and (iii) the conductances of the distribution lines. To define a well-conditioned estimation problem, we employ decentralized strategy where the primary droop controllers temporarily switch between operating points in a coordinated manner, following amplitude-modulated training sequences. We study the use of the estimator in a decentralized solution of the Optimal Economic Dispatch problem. The evaluations confirm the usefulness of the proposed solution for autonomous MicroGrid operation.

eess.SY↗

arXiv2018

Continuous Time Multi-stage Stochastic Reserve and Unit Commitment

In this paper we introduce a continuous time multi stage stochastic optimization for scheduling generating units, their commitment, reserve capacities and their continuous time generation profiles in the day-ahead wholesale electricity market. Our formulation approximates the solution of a variational problem, in which the balance, generation capacity and ramping constraints are in continuous time. Due to the greater accuracy of our representation of ramping events this approach improves the system reliability and lowers the real-time cost.

math.OC↗

arXiv2017

An Active Sequential Xampling Detector for Spectrum Sensing

Enabling low power wireless devices to adopt Nyquist sampling at high carriers is prohibitive. In spectrum sensing, this limit calls for an analog front-end that can sweep different bands quickly, in order to use the available spectrum opportunistically. In this paper we propose a new framework that allows to optimize a sub-Nyquist sampling front-end to combine the benefits of optimum sequential sensing with those of Compressive Spectrum Sensing (CSS). The sensing strategy we propose is formulated as a sequential utility optimization problem. The utility function decreases linearly with the number of measurements (accrued to make a decision) and increases as a function of the signal components binary states. The optimization selects the best linear combinations of sub-bands to mix, in order to accrue maximum utility. The structure of the utility represents the trade-off between exploration, exploitation and risk of making an error, that is characteristic of the spectrum sensing problem. We first present the analog front-end architecture, and then map the measurement model into the abstract optimization problem proposed, and analyzed, in the remainder of the paper. We characterize the optimal policy under constraints on the sensing matrix and derive the approximation factor of the greedy approach. Numerical simulations showcase the benefits of combining opportunistic spectrum sensing with sub-Nyquist sampling.

cs.IT↗

arXiv2017

Curvature-aided Incremental Aggregated Gradient Method

We propose a new algorithm for finite sum optimization which we call the curvature-aided incremental aggregated gradient (CIAG) method. Motivated by the problem of training a classifier for a d-dimensional problem, where the number of training data is $m$ and $m \gg d \gg 1$, the CIAG method seeks to accelerate incremental aggregated gradient (IAG) methods using aids from the curvature (or Hessian) information, while avoiding the evaluation of matrix inverses required by the incremental Newton (IN) method. Specifically, our idea is to exploit the incrementally aggregated Hessian matrix to trace the full gradient vector at every incremental step, therefore achieving an improved linear convergence rate over the state-of-the-art IAG methods. For strongly convex problems, the fast linear convergence rate requires the objective function to be close to quadratic, or the initial point to be close to optimal solution. Importantly, we show that running one iteration of the CIAG method yields the same improvement to the optimality gap as running one iteration of the full gradient method, while the complexity is $O(d^2)$ for CIAG and $O(md)$ for the full gradient. Overall, the CIAG method strikes a balance between the high computation complexity incremental Newton-type methods and the slow IAG method. Our numerical results support the theoretical findings and show that the CIAG method often converges with much fewer iterations than IAG, and requires much shorter running time than IN when the problem dimension is high.

stat.ML↗

arXiv2017

A Stochastic Model for Short-Term Probabilistic Forecast of Solar Photo-Voltaic Power

In this paper, a stochastic model with regime switching is developed for solar photo-voltaic (PV) power in order to provide short-term probabilistic forecasts. The proposed model for solar PV power is physics inspired and explicitly incorporates the stochasticity due to clouds using different parameters addressing the attenuation in power.Based on the statistical behavior of parameters, a simple regime-switching process between the three classes of sunny, overcast and partly cloudy is proposed. Then, probabilistic forecasts of solar PV power are obtained by identifying the present regime using PV power measurements and assuming persistence in this regime. To illustrate the technique developed, a set of solar PV power data from a single rooftop installation in California is analyzed and the effectiveness of the model in fitting the data and in providing short-term point and probabilistic forecasts is verified. The proposed forecast method outperforms a variety of reference models that produce point and probabilistic forecasts and therefore portrays the merits of employing the proposed approach.

stat.AP↗

arXiv2017

Anomaly Detection Using Optimally-Placed Micro-PMU Sensors in Distribution Grids

As the distribution grid moves toward a tightly-monitored network, it is important to automate the analysis of the enormous amount of data produced by the sensors to increase the operators situational awareness about the system. In this paper, focusing on Micro-Phasor Measurement Unit ($μ$PMU) data, we propose a hierarchical architecture for monitoring the grid and establish a set of analytics and sensor fusion primitives for the detection of abnormal behavior in the control perimeter. Due to the key role of the $μ$PMU devices in our architecture, a source-constrained optimal $μ$PMU placement is also described that finds the best location of the devices with respect to our rules. The effectiveness of the proposed methods are tested through the synthetic and real $μ$PMU data.

eess.SY↗