<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">sustain</journal-id><journal-title-group><journal-title xml:lang="ru">Надежность</journal-title><trans-title-group xml:lang="en"><trans-title>Dependability</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-2646</issn><issn pub-type="epub">2500-3909</issn><publisher><publisher-name>RAMS Journal Limited liability company</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.21683/1729-2646-2014-0-4-61-77</article-id><article-id custom-type="elpub" pub-id-type="custom">sustain-43</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>СТРУКТУРНАЯ НАДЕЖНОСТЬ. ТЕОРИЯ И ПРАКТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>STRUCTURAL RELIABILITY. THE THEORY AND PRACTICE</subject></subj-group></article-categories><title-group><article-title>МЕТОД УСТРАНЕНИЯ ВЗАИМНОГО ПЕРЕСЕЧЕНИЯ ОЦЕНОК ЭЗАРИ-ПРОШАНА В ЗАДАЧАХ АНАЛИЗА СВЯЗНОСТИ ДВУХПОЛЮСНЫХ СЕТЕЙ</article-title><trans-title-group xml:lang="en"><trans-title>METHOD FOR ELIMINATION OF MUTUAL CROSSING OF ESARY-PROSCHAN ESTIMATES IN TASKS OF ANALYSIS OF BIPOLAR NETWORKS CONNECTIVITY</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Носов</surname><given-names>М. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Nosov</surname><given-names>M. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат технических наук, профессор, заслуженный работник Высшей школы РФ, профессор кафедры «Инфокоммуникационных технологий и систем связи»</p></bio><bio xml:lang="en"><p>PhD Engineering, Professor, Honored worker of Higher School of Russian Federation, Professor of Chair of Infocommunication technology and telecommunication systems</p></bio><email xlink:type="simple">nosov.1933@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Академия гражданской защиты МЧС России</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Academy of civil protection (MChS) of Russia</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>06</day><month>07</month><year>2016</year></pub-date><volume>0</volume><issue>4</issue><fpage>61</fpage><lpage>77</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Носов М.В., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Носов М.В.</copyright-holder><copyright-holder xml:lang="en">Nosov M.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.dependability.ru/jour/article/view/43">https://www.dependability.ru/jour/article/view/43</self-uri><abstract><p>Рассматривается содержание метода, обеспечивающего устранение взаимного пересечения и уменьшение значений погрешностей оценок Эзари-Прошана.</p></abstract><trans-abstract xml:lang="en"><p>The paper presents the method for elimination of mutual crossing and reduction of Esary-Proshan estimates errors.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>вероятность связности</kwd><kwd>вероятность несвязности</kwd><kwd>двухполюсная сеть</kwd><kwd>случайный граф двухполюсной сети</kwd><kwd>простая цепь</kwd><kwd>простой разрез</kwd><kwd>верхняя оценка</kwd><kwd>нижняя оценка</kwd><kwd>точное значение</kwd><kwd>оценки Эзари-Прошана</kwd><kwd>двухсторонние оценки</kwd><kwd>элементарные конструкции</kwd></kwd-group><kwd-group xml:lang="en"><kwd>probability of connection</kwd><kwd>probability of discontinuity</kwd><kwd>bipolar network</kwd><kwd>random graph of bipolar network</kwd><kwd>simple path</kwd><kwd>simple cut</kwd><kwd>upper bound</kwd><kwd>lower bound</kwd><kwd>exact value</kwd><kwd>Esary-Proshan estimates</kwd><kwd>bilateral estimates</kwd><kwd>elementary designs</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Esary J., Proshan F. Coherent Struktures of Non-Identifical Components // Technometrics. 1963.V.5. №2. Р.191-209;</mixed-citation><mixed-citation xml:lang="en">Esary J., Proschan F. Coherent Structures of Non-Identifical Components // Technometrics. 1963. V.5. № 2. Р. 191-209.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Полесский В.П. Развязывание клаттеров, корреляцинные неравенства и границы комбинаторной надежности // Проблемы передачи информации. 1997.Т.33. Вып.3. С.50-70;</mixed-citation><mixed-citation xml:lang="en">Polessky V.P. Decoupling of clutters, correlated inequalities and boundaries of combinatory dependability // Problems of information transfer. 1997. V.33. Issue.3. pp. 50-70.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Филин Б.П. О предельном развязывании клаттеров в оценках Полесского границ комбинаторной надежности случайных бинарных систем // Автоматика и телемеханика. 2005.№9.С.149-189;</mixed-citation><mixed-citation xml:lang="en">Filin B.P. About maximum decoupling of clutters in Polessky’s estimations of combinatory dependability boundaries of random binary systems // Automatics and telemechanics. 2005. # 9. pp. 149-189.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Филин Б.П. Методы анализа структурной надежности сетей связи. М.: Радио и связь, 1998;</mixed-citation><mixed-citation xml:lang="en">Filin B.P. Methods of communication networks’ structural dependability analysis. M.: Radio and communication, 1998.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Рябинин И.А. Надежность и безопасность структурно-сложных систем. СПб.: Политехника, 2000;</mixed-citation><mixed-citation xml:lang="en">Ryabinin I.A. Dependability and safety of structural – complex systems. St. Petersburg: Polytechnics, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Кривулец В.Г. Об оценке оценок Эзари-Прошана в задачах анализа структурной надежности сетей связи // Труды 55-й Научной сессии, посвященной Дню радио./РНТОРЭС им. А.С. Попова. 2000;</mixed-citation><mixed-citation xml:lang="en">Krivulets V.G. About assessment of Esary-Proschan estimates in problems of the analysis of communication networks structural dependability // Proceeding of the 55-th Scientific session devoted to Radio Day./ RNTORES. 2000.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Носов М.В. Предельные оценки надежности систем с сетевой структурой. / Надежность. 2010.№2;</mixed-citation><mixed-citation xml:lang="en">Nosov M.V. Marginal valuation of dependability of systems with network structure. / Dependability. 2010. # 2.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Носов М.В. Практическое приложение теории предельных оценок. // Надежность 2010. №3.;</mixed-citation><mixed-citation xml:lang="en">Nosov M.V. Practical application of the theory of marginal ratings. // Dependability 2010.№3.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Нетес В.А. Об оценке вероятности связности двухполюсных сетей / Электросвязь.2001.№11.С.39-41.;</mixed-citation><mixed-citation xml:lang="en">Netes V.A. About an estimation of connectivity probability of bipolar networks / Telecommunications.2001. # 11, pp. 39-41.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Шубинский И.Б. Структурная надежность информационных систем. М: «Журнал Надежность», 2012. 216 с.</mixed-citation><mixed-citation xml:lang="en">Shubinsky I.B. Structural dependability of information systems. M: “Dependability Journal”, 2012. 216 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Шубинский И.Б. Функциональная надежность информационных систем. М: «Журнал Надежность», 2012. 295 с.</mixed-citation><mixed-citation xml:lang="en">Shubinsky I.B. Functional dependability of information systems. M: “Dependability Journal”, 2012. 295 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Мур Р., Шеннон К. Надежные схемы из ненадежных реле / Работы по теории информации и кибернетики. М.: ИЛ, 1963, С.114-153.</mixed-citation><mixed-citation xml:lang="en">Moore R., Shannon K. Reliable circuits out of unreliable relays / Works in the theory of information and cybernetics. M.: SILT, 1963, p. 114-153.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
