About: Finding the most important electricity substations using PageRank - A case study     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
  • On-line monitoring elektrických distribučních sítí je důležité pro zachování spolehlivosti. Instalace on-line sensorů do všech zařízení je však neefektivní. Článek popisuje metodu pro ohodnocení rozvoden podle důležitosti vužitím PageRank, který je běžný u internetových vyhledávačů. (cs)
  • On-line monitoring of an electricity distribution network is important for the preservation of reliability of the network. The real distribution networks are very large and installing on-line sensors to all components of the distribution network would be unrealistic and very expensive. Fortunately, analyzing the hierarchy of the network it is possible to select only a few amounts of important distribution points - candidates for installing of on-line sensors and remote-controlled equipment. We tried to select the critical points by using the Google's PageRank algorithm, which was applied to a graph-model of real 110 kV overhead lines network situated in the Czech Republic. The network has 28 high voltage substations (nodes of the graph). The multiplicity of overhead lines is modelled as a weight of the edge of the graph. The results are very promising: Although we did not provide apriori information to the algorithm, the behavior of PageRank algorithm is in full agreement with the behavior of a h
  • On-line monitoring of an electricity distribution network is important for the preservation of reliability of the network. The real distribution networks are very large and installing on-line sensors to all components of the distribution network would be unrealistic and very expensive. Fortunately, analyzing the hierarchy of the network it is possible to select only a few amounts of important distribution points - candidates for installing of on-line sensors and remote-controlled equipment. We tried to select the critical points by using the Google's PageRank algorithm, which was applied to a graph-model of real 110 kV overhead lines network situated in the Czech Republic. The network has 28 high voltage substations (nodes of the graph). The multiplicity of overhead lines is modelled as a weight of the edge of the graph. The results are very promising: Although we did not provide apriori information to the algorithm, the behavior of PageRank algorithm is in full agreement with the behavior of a h (en)
Title
  • Finding the most important electricity substations using PageRank - A case study
  • Finding the most important electricity substations using PageRank - A case study (en)
  • Nalezení rozvodny s největší důležitostí využitím PageRank (cs)
skos:prefLabel
  • Finding the most important electricity substations using PageRank - A case study
  • Finding the most important electricity substations using PageRank - A case study (en)
  • Nalezení rozvodny s největší důležitostí využitím PageRank (cs)
skos:notation
  • RIV/61989100:27240/07:00015095!RIV09-MSM-27240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6198898701), 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
  • 422037
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/07:00015095
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • PageRank; reliability; importance; substation (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [ED65F94FEE74]
http://linked.open...v/mistoKonaniAkce
  • Hotel Dlouhé stráně, Kouty nad Desnou
http://linked.open...i/riv/mistoVydani
  • Ostrava
http://linked.open...i/riv/nazevZdroje
  • EPE 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
  • Goňo, Radomír
  • Briš, Radim
  • Praks, Pavel
  • Zajac, Petr
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. Fakulta elektrotechniky a informatiky
https://schema.org/isbn
  • 978-80-248-1391-2
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software