English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper considers a smart grid cyber-security problem analyzing thevulnerabilities of electric power networks to false data attacks. The analysisproblem is related to a constrained cardinality minimization problem. The mainresult shows that an $l_1$ relaxation technique provides an exact optimalsolution to this cardinality minimization problem. The proposed result is basedon a polyhedral combinatorics argument. It is different from well-known resultsbased on mutual coherence and restricted isometry property. The results areillustrated on benchmarks including the IEEE 118-bus and 300-bus systems.

On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem