Random Forest outperforms other IDS algorithms in smart grids.
problem Security vulnerabilities in smart grids.
method Comparison of four data mining algorithms (Random Forest, SVM, Neural Network, and KNN) in detecting attacks.
result Random Forest outperforms other algorithms in terms of detection accuracy and efficiency.
We address the problem of maintaining high voltage power transmission networks in security at all time, namely anticipating exceeding of thermal limit for eventual single line disconnection (whatever its cause may be) by running slow, but accurate, physical grid simulators. New conceptual frameworks are calling for a p…
We address the problem of maintaining high voltage power transmission networks in security at all time. This requires that power flowing through all lines remain below a certain nominal thermal limit above which lines might melt, break or cause other damages. Current practices include enforcing the deterministic "N-1" …
Power grids are one of the most important components of infrastructure in today's world. Every nation is dependent on the security and stability of its own power grid to provide electricity to the households and industries. A malfunction of even a small part of a power grid can cause loss of productivity, revenue and i…
Grid security and open markets are two major smart grid goals. Transparency of market data facilitates a competitive and efficient energy environment, yet it may also reveal critical physical system information. Recovering the grid topology based solely on publicly available market data is explored here. Real-time ener…
Power system studies require the topological structures of real-world power networks; however, such data is confidential due to important security concerns. Thus, power grid synthesis (PGS), i.e., creating realistic power grids that imitate actual power networks, has gained significant attention. In this letter, we cas…
Paper uses deep reinforcement learning for adaptive emergency control of power systems.
problem Traditional emergency control schemes are inadequate for modern power grids due to increasing uncertainties.
method Developed deep reinforcement learning (DRL) for adaptive emergency control of power systems.
result Demonstrated excellent performance and robustness of DRL-based emergency control schemes in various scenarios.
System identifies power grid location from media recordings.
problem Identifying the origin of power distribution grid from media recordings.
method Cascaded SVM and pole-matching classifiers for grid identification.
result Cascaded system improves accuracy by 15.57%.
Framework detects anomalies in real-time PMU data.
problem Anomaly detection in power grid operations.
method Statistical learning and dynamical model.
result Effective anomaly detection and classification.
We propose a new method to efficiently compute load-flows (the steady-state of the power-grid for given productions, consumptions and grid topology), substituting conventional simulators based on differential equation solvers. We use a deep feed-forward neural network trained with load-flows precomputed by simulation. …
Deep RL agent secures 2nd place in CityLearn Challenge for district demand management.
problem Optimizing electrical demand of diverse buildings in a district.
method Centralised 'Soft Actor Critic' deep reinforcement learning agent.
result Achieved an averaged score of 0.967 on challenge dataset.
Deep learning detects cyber-attacks in smart grid systems.
problem Cyber-attacks on smart grid systems.
method Deep learning-based intrusion detection system trained on industrial dataset.
result Proposed system outperforms Naive Bayes, SVM, and Random Forest.
Paper uses Gaussian processes to solve AC-OPF with renewable uncertainty.
problem Optimizing power grids with fluctuating renewable sources.
method Data-driven approach using Gaussian processes.
result Efficiently solves chance-constrained AC-OPF with uncertainty.
Detects non-technical electricity losses using image representations of time-series data.
problem Detecting anomalies in large-scale, unlabelled data for non-technical losses.
method Transformed time-series data into image representations, used semi-supervised deep learning.
result Significant improvement in detecting abnormal electricity consumption patterns.
Nowadays more and more data are gathered for detecting and preventing cyber attacks. In cyber security applications, data analytics techniques have to deal with active adversaries that try to deceive the data analytics models and avoid being detected. The existence of such adversarial behavior motivates the development…
During recent years the counterparty risk subject has received a growing attention because of the so called Basel Accord. In particular the Basel III Accord asks the banks to fulfill finer conditions concerning counterparty credit exposures arising from banks' derivatives, securities financing transactions, default and…
Model predicts one-year NDVI for Four Corners region.
problem Long-term forecasting of vegetation conditions using climate attributes.
method Two-phase machine learning model using historical climate data.
result Open-source tools outperform alternative methods for NDVI forecasts.
A hybrid ML model detects fraudulent transactions with high accuracy.
problem Detecting and preventing fraudulent credit card transactions.
method Intelligent combination of multiple algorithms with Grid search and IHT-LR.
result Achieves impressive accuracy rates of 99.66% for ENS model.
Grid-scale batteries' bid patterns in price uncertainty markets
problem Interpreting bids from grid-scale batteries in wholesale electricity markets under price uncertainty
method Developing an asset-level model of a price-taking battery
result Empirical results deliver insights into withholding behavior, uncertainty effects, and risk management reshaping bid curves
We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…
We address the problem of assisting human dispatchers in operating power grids in today's changing context using machine learning, with theaim of increasing security and reducing costs. Power networks are highly regulated systems, which at all times must meet varying demands of electricity with a complex production sys…
The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.
problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2 under certain conditions. Half grid diagrams prove every link can be represented by a special type of grid diagram.
problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.
Grid homology confirms the Upsilon invariant in knot theory.
problem Verifying the equivalence of Upsilon invariants in knot theory.
method Reconstructed Upsilon invariant using grid homology and proved equivalence.
result Upsilon invariants in knot Floer and grid homology are equivalent.
GridPyM handles grid diagrams for knot theory.
problem Handling grid diagrams for knot theory.
method Generates and simplifies grids, models local transformations.
result Models local transformations between grid diagrams.
Grid homology theory for spatial graphs extends skein sequence.
problem No specific problem stated; focuses on extending a sequence.
method Defined grid homology theory for spatial graphs and extended skein sequence.
result Skein exact sequence extended to grid homology for spatial graphs.
Extends knot invariant to filtered grid complexes.
problem Knot invariants and grid complexes.
method Combining Ozsváth-Szabó-Stipsicz crossing-change maps with Alishahi-Eftekhary l(K) invariant.
result Combinatorial formulation of knot invariant.
New method finds grid diagrams for many fibered knots.
problem Detecting fibered knots using grid diagrams.
method Developed an efficient method to identify grid diagrams with unique maximal Alexander grading states.
result Found suitable grid diagrams for 5385 of 5397 fibered prime knots with crossing number ≤ 13.
Grid homology properties for MOY graphs studied.
problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.
Grid homology invariant proved for lens space links.
problem Proving combinatorial invariance of grid homology for lens space links.
method Combining combinatorial methods with sign assignments to prove invariance.
result Grid homology is a link invariant for lens space links.
New trading strategy beats traditional grid in crypto markets.
problem Low expected return of traditional grid trading strategy.
method Dynamic Grid Trading (DGT) strategy that adapts to market conditions.
result DGT strategy outperforms traditional grid and buy-and-hold strategies.
New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.
problem Constructing explicit examples of triple grid diagrams for Lagrangian surfaces in CP^2.
method Elegant geometric construction reducing to linear algebra.
result Explicit construction of moduli space of triple grid diagrams.
Optimizes a portfolio for an investor preferring accepted securities over a reference security.
problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.
Develops equivariant grid homology for strongly invertible knots.
problem Invariants of strongly invertible knots.
method Equivariant grid diagrams and mapping cones.
result Equivariant unknotting numbers and genus bounds.
Computes homology of an obstruction chain complex in grid homology.
problem Computing the homology of an obstruction chain complex in grid homology.
method Defined and computed the homology of the obstruction chain complex of the full grid.
result Results about the existence of sign assignments in grid homology.
Grid homology shows knot unknotting lower bound.
problem Knot unknotting number determination
method Grid homology analysis
result Torsion homology classes order bounds unknotting number
SKI accelerates GP inference with sparse grids to handle higher dimensions.
problem SKI scales poorly in high dimensions due to dense grid size.
method Sparse grids within SKI framework, novel matrix-vector multiplication algorithm.
result SKI can be scaled to higher dimensions while maintaining accuracy.
The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.
problem Understanding grid homology for spatial graphs with various types of edges.
method Developed grid homology for spatial graphs with cut edges and applied it to prove a Künneth formula for connected sums.
result A Künneth formula for knot Floer homology of connected sums is proven using grid homology.
Study shows Bitcoin security tied to mining rewards and prices.
problem Understanding Bitcoin security's dependency on market outcomes.
method Used ARDL approach with daily blockchain and Bitcoin data from 2014-2019.
result Bitcoin security outcomes linked to Bitcoin price and mining rewards.
Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.
problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.
Minimal grid diagrams for 12-crossing prime knots identified.
problem Identifying minimal grid diagrams for prime knots.
method Listed minimal grid diagrams for 12-crossing prime knots.
result Provided a list of minimal grid diagrams for 12-crossing prime knots.
A pair of points in a riemannian manifold makes a secure configuration if the totality of geodesics connecting them can be blocked by a finite set. The manifold is secure if every configuration is secure. We investigate the security of compact, locally symmetric spaces.
The paper analyzes how grid cells perform path integration and learns hexagon grid patterns.
problem Understanding how grid cells perform path integration calculations.
method Theoretical analysis of a general representation model of path integration by grid cells, identifying group representation and isotropic scaling conditions.
result The learned model of hexagon grid patterns is capable of accurate long distance path integration.
It will be shown that according to theorems of K. Menger, every neuron grid if identified with a curve is able to preserve the adopted qualitative structure of a data space. Furthermore, if this identification is made, the neuron grid structure can always be mapped to a subset of a universal neuron grid which is constr…
The increasing penetration of distributed energy resources poses numerous reliability issues to the urban distribution grid. The topology estimation is a critical step to ensure the robustness of distribution grid operation. However, the bus connectivity and grid topology estimation are usually hard in distribution gri…
The paper studies how grid cell patterns emerge in neural networks.
problem Understanding how grid cells in the brain form hexagonal firing patterns.
method Training recurrent neural networks with conformal normalization of velocity inputs.
result Conformal normalization is crucial for the emergence of hexagonal grid patterns in neural networks.
This paper proposes a multi-grid method for learning energy-based generative ConvNet models of images. For each grid, we learn an energy-based probabilistic model where the energy function is defined by a bottom-up convolutional neural network (ConvNet or CNN). Learning such a model requires generating synthesized exam…
Combinatorial proof of grid homology properties.
problem Properties of double-point enhanced grid homology.
method Purely combinatorial proof, extended to Z coefficients. result Skein exact sequence obeyed by grid homology.