Paper proposes a fast stability scanning method for future grid scenarios.
problem Capturing inter-seasonal variations in renewable generation.
method Novel feature selection algorithm and self-adaptive PSO-k-means clustering.
result Reduced computational burden up to ten times with acceptable accuracy.
AI model enhances grid monitoring with synchro-waveform tech.
problem Dynamic, stochastic, low-inertia future grids need advanced monitoring.
method AI Foundation Model with synchro-waveform tech.
result Significantly improved fault detection accuracy and speed.
Study examines barriers to grid-connected battery systems in Spain, finding high cycle cost remains main obstacle.
problem Barriers to grid-connected battery systems in Spain's deregulated electricity market.
method Utilization analysis and concept of 'potentially profitable utilization time' introduced.
result High cycle cost remains the main barrier for grid-connected battery systems in Spain.
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…
New method selects critical DER scenarios for distribution grid investment planning.
problem Determining critical DER adoption scenarios for risk assessment in distribution grids.
method Bayesian Optimization framework using Gaussian Process surrogates and Pareto-critical acquisition function.
result Statistical guarantee and significant speed-up over exhaustive search in selecting critical DER scenarios.
Survey of RL methods for optimizing power grid topologies.
problem Optimizing power grid operation with adaptive control strategies.
method Reinforcement Learning (RL) for dynamic and uncertain environments.
result Comprehensive evaluation of RL-based methods for power grid topology optimization.
Study on typical knots and links using grid diagrams, focusing on size, components, and writhe.
problem Understanding the statistical behavior of knots and links, especially their typical properties.
method Modeling knots and links with grid diagrams, examining three invariants: size, components, and writhe, through numerical analysis.
result The size of a random knot is uniformly distributed and linearly dependent on grid size, while the number of components follows a distribution whose mean and variance grow with log_2 of grid size.
DE outperforms grid search for defect predictor tuning.
problem Finding optimal parameters for defect predictors.
method Compared differential evolution (DE) to grid search for parameter tuning.
result DE was over 210 times faster than grid search.
For power grid operations, a large body of research focuses on using generation redispatching, load shedding or demand side management flexibilities. However, a less costly and potentially more flexible option would be grid topology reconfiguration, as already partially exploited by Coreso (European RSC) and RTE (Frenc…
Paper proposes a framework for calculating ownership costs of DERs using uncertainty and risk analyses.
problem Optimal operation of distributed energy resources (DERs) and microgrids (MGs) in smart grids.
method A general framework for ownership cost calculation using uncertainty and risk analyses, with four approaches compared.
result Best ownership cost calculation approach chosen based on simulation results for a typical diesel generator (DiG).
This paper surveys ML applications in SG for cyberattacks.
problem Cyberattacks in smart grid due to advanced technologies.
method Comprehensive review of existing research in cyberattacks detection and mitigation.
result Machine learning is effective in detecting and mitigating cyberattacks.
Paper analyzes bidding strategies in smart grid PDAs, proposing a new method that outperforms existing strategies.
problem Optimizing bidding strategies in smart grid PDAs to balance energy demand effectively.
method Theoretical analysis of double auctions, derivation of best response, and modeling as an MDP.
result Proposed MDPLCPBS strategy outperforms existing strategies in the PowerTAC wholesale market PDA.
This paper explores ML in power line communications, from modeling to diagnostics.
problem Improving efficiency and diagnostics in power line communications.
method Discusses classical ML models and their application to PLC at various layers.
result Demonstrates how ML can enhance various aspects of PLC.
This paper optimizes a power-to-heat system using reinforcement learning for cost minimization under uncertain conditions.
problem Optimizing a power-to-heat system with fluctuating renewable energy sources.
method Stochastic optimal control, reinforcement learning (Q-learning).
result Reinforcement learning provides an efficient solution to the optimization problem.
Empirical comparison of 18 hyperparameter tuning algorithms for SVM.
problem Tuning hyperparameters C and γ for SVM with RBF kernel. method Compared 18 search algorithms on 115 real-life data sets.
result Trees of Parzen estimators and particle swarm optimization perform similarly to grid search.
The paper proposes a new method for probabilistic load forecasting using Bernstein-Polynomial Normalizing Flows.
problem High variability in short-term load forecasting at the low-voltage level due to fluctuating demand and increasing electrification.
method Flexible conditional density forecasting based on Bernstein polynomial normalizing flows with neural network control.
result Density predictions outperform traditional methods for 24h-ahead load forecasting.
Study improves precipitation predictions for High Mountain Asia using machine learning.
problem Uncertainty in future precipitation over High Mountain Asia due to regional climate model biases.
method Probabilistic machine learning framework combining 13 regional climate models via a mixture of experts.
result 32% improvement over equally-weighted average and 254% improvement over single ensemble member.
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…
Paper optimizes neural networks for Bermudan option pricing with faster convergence and risk management tools.
problem Efficiently pricing Bermudan options with static hedging and risk management.
method Monte-Carlo-based artificial neural network framework with novel optimisation algorithm.
result The proposed neural network accelerates convergence and provides improved risk management tools.
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. Curiosity-driven agent predicts future state values to learn faster.
problem Sparse reward learning in reinforcement learning.
method The agent predicts future state values and uses consistency with current values as a regularization term.
result The extended agent learns significantly faster in sparse reward settings.
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.
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.
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.
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.
AutoQuant addresses cryptocurrency backtesting fragility by modeling execution costs and improving strategy selection.
problem Fragile backtests of cryptocurrency perpetual futures ignoring microstructure frictions and execution costs.
method Execution-centric framework with Bayesian optimization, double screening, and strict T+1 semantics.
result Fee-only and zero-cost backtests overestimate returns, highlighting the importance of modeling execution costs.
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.
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.
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.
New ML model predicts long-term power generation at large areas.
problem Accurate forecasting of long-term power generation from renewable sources.
method Machine learning model applied to aggregated power generation data.
result The model predicts power generation with high accuracy over 15 days.
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 develops algorithms to accurately identify power grid topology.
problem Identifying the exact topology of a power grid in real-time.
method Graphical model framework for topology estimation using voltage measurements.
result Exact extraction of operational topology is theoretically guaranteed for grid topologies without three-node cycles.
Satellite imagery and ML improve livelihood measurements and estimate electrification's impact.
problem Sparse data hinders policy development and evaluation.
method Satellite imagery, machine learning, and ML inference techniques.
result Grid access improves rural asset wealth by 0.17 standard deviations.
System detects power grid health using AI and machine learning.
problem Detecting and preventing power grid malfunctions.
method Artificial intelligence, machine learning, recurrent neural networks, SVM, LSTM.
result High accuracy in detecting grid health, scalable for complex architectures.
This paper improves image generation models using a multi-grid method.
problem Improving image generation models.
method A multi-grid method for learning energy-based generative ConvNet models.
result The multi-grid method outperforms traditional models.
Data-driven method estimates urban MV and LV grid topology using smart meter data.
problem Reliability issues in urban distribution grids due to distributed energy resources.
method Probabilistic graphical model with group lasso regularization.
result Highly accurate topology estimation in various grid configurations.
Combinatorial proof shows knot invariant in Lipshitz's grid homology.
problem Proving knot invariance in Lipshitz's grid homology.
method Purely combinatorial proof.
result Proves 'minus' version of Lipshitz's double-point enhanced grid homology is a knot invariant.
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.
Efficiently prices options in stochastic volatility models using sparse grids.
problem Option pricing in stochastic volatility models.
method Sparse grid high-order ADI scheme for second-order in time and fourth-order in space.
result Computational efficiency gains confirmed by numerical experiments.
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…
The study examines topological surfaces using grid structures in Euclidean and hyperbolic spaces.
problem Understanding topological surfaces in geometric spaces.
method Using gridded surfaces in cubic honeycombs of Euclidean and hyperbolic spaces.
result Topological surfaces can be represented as gridded structures in these spaces.