About: Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks     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
  • Retention levels of road safety barriers are specified on the basis of risk assessment taking into account accidental data and further information available in the Czech Republic and also selected recommendations of Road Safety Association PIARC. The method of Bayesian networks is applied in the analysis and compared with event tree method. Newly proposed classes of retention for several categories of road surroundings considering the intensity of heavy traffic and two levels of hazard situation are incorporated to the revision of national prescriptive document that is expected to enhance the road safety.
  • Retention levels of road safety barriers are specified on the basis of risk assessment taking into account accidental data and further information available in the Czech Republic and also selected recommendations of Road Safety Association PIARC. The method of Bayesian networks is applied in the analysis and compared with event tree method. Newly proposed classes of retention for several categories of road surroundings considering the intensity of heavy traffic and two levels of hazard situation are incorporated to the revision of national prescriptive document that is expected to enhance the road safety. (en)
Title
  • Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks
  • Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks (en)
skos:prefLabel
  • Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks
  • Risk Analysis and Retention Optimization of Road Safety Barriers Based on Bayesian Networks (en)
skos:notation
  • RIV/68407700:21610/10:00169434!RIV11-GA0-21610___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA103/09/0693)
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
  • 285348
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21610/10:00169434
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • risk analysis; retention; optimization of road safety barriers; Bayesian networks (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [A01BBD03F871]
http://linked.open...v/mistoKonaniAkce
  • Rhodes
http://linked.open...i/riv/mistoVydani
  • London
http://linked.open...i/riv/nazevZdroje
  • Reliability, Risk and Safety. Back to the Future
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Marková, Jana
  • Jung, Karel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Taylor & Francis
https://schema.org/isbn
  • 978-0-415-60427-7
http://localhost/t...ganizacniJednotka
  • 21610
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