Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Avtomatika i Telemekhanika, 2005, Issue 9, Pages 149–189 (Mi at1439)  

Reliability

On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems

B. P. Filin

Federal Center "All-Russian Research Institute of Problems of Civil Defence and Emergency Situations" of the Ministry of Emergency Situations, Moscow, Russia
References:
Abstract: Consideration was given to the so-called “Polesskii estimates” which define new, more accurate reliability boundaries of the random binary systems as compared with the classical Esary-Proshan estimates. As was later shown, these estimates can be further refined. By giving a simplified, that is, purely applied, interpretation of the formal Polesskii rules, the present author demonstrated that Polesskii's concepts in principle enable one to reach the maximum disentanglement of clutters, thus substantially approaching the reliability boundaries of the random binary systems. The results of comparing the Polesskii estimates with other possible lines to attack the approachment of the boundaries of combinatorial reliability of the random binary systems were presented.
Presented by the member of Editorial Board: B. G. Volik

Received: 25.03.2004
English version:
Automation and Remote Control, 2005, Volume 66, Issue 9, Pages 1496–1532
DOI: https://doi.org/10.1007/s10513-005-0188-9
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: B. P. Filin, “On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems”, Avtomat. i Telemekh., 2005, no. 9, 149–189; Autom. Remote Control, 66:9 (2005), 1496–1532
Citation in format AMSBIB
\Bibitem{Fil05}
\by B.~P.~Filin
\paper On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems
\jour Avtomat. i Telemekh.
\yr 2005
\issue 9
\pages 149--189
\mathnet{http://mi.mathnet.ru/at1439}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2172627}
\transl
\jour Autom. Remote Control
\yr 2005
\vol 66
\issue 9
\pages 1496--1532
\crossref{https://doi.org/10.1007/s10513-005-0188-9}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-26044437163}
Linking options:
  • https://www.mathnet.ru/eng/at1439
  • https://www.mathnet.ru/eng/at/y2005/i9/p149
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:232
    Full-text PDF :73
    References:40
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024