About: Measurement placement algorithm for power system state estimation using PageRank - Case Studies     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The aim is to determine a measurement distribution to make the system observable for power system state estimation. The power system is observable for state estimation when the measurements can be used to describe the system. The measurements should be distributed throughout the network in order to estimate the states of all nodes. The rank of the system matrix is used to determine the observability. For observability, nodes of the graph are selected by scrolling down the list of nodes sorted by importance. The PageRank algorithm is used as a tool for computation of the nodes? importance. Our approach is illustrated on three IEEE test networks. Results are compared to those obtained using the Graph Theoretic Procedure.
  • The aim is to determine a measurement distribution to make the system observable for power system state estimation. The power system is observable for state estimation when the measurements can be used to describe the system. The measurements should be distributed throughout the network in order to estimate the states of all nodes. The rank of the system matrix is used to determine the observability. For observability, nodes of the graph are selected by scrolling down the list of nodes sorted by importance. The PageRank algorithm is used as a tool for computation of the nodes? importance. Our approach is illustrated on three IEEE test networks. Results are compared to those obtained using the Graph Theoretic Procedure. (en)
  • Cílem je determinovat distribuci měření s cílem mít celý výkonový systém pozorovatelný (observable). Výkonový systém je pozorovatelný, pokud daná měření mohou být použita pro vysvětlení systému. Náš přístup je ilustrován na třech testovacích sítích IEEE. Výsledky algortimu PageRank jsou porovnány s metodou Graph Theoretic Procedure. (cs)
Title
  • Measurement placement algorithm for power system state estimation using PageRank - Case Studies
  • Measurement placement algorithm for power system state estimation using PageRank - Case Studies (en)
  • Measurement placement algoritmus pro odhadování stavu systému užitím PageRank - případová studie (cs)
skos:prefLabel
  • Measurement placement algorithm for power system state estimation using PageRank - Case Studies
  • Measurement placement algorithm for power system state estimation using PageRank - Case Studies (en)
  • Measurement placement algoritmus pro odhadování stavu systému užitím PageRank - případová studie (cs)
skos:notation
  • RIV/61989100:27240/07:00015053!RIV09-MSM-27240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6198910007)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 432529
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/07:00015053
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • PageRank; reliability; importance; substation (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [11F33B148746]
http://linked.open...v/mistoKonaniAkce
  • Ostrava
http://linked.open...i/riv/mistoVydani
  • Ostrava
http://linked.open...i/riv/nazevZdroje
  • Quality and Reliability 2007 (RQR 2007)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Praks, Pavel
  • Hurtgen, M.
  • Zajac, P.
  • Maun, J. C.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Vysoká škola báňská - Technická univerzita Ostrava
https://schema.org/isbn
  • 978-80-248-1575-6
http://localhost/t...ganizacniJednotka
  • 27240
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 92 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software