<?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">mirtr</journal-id><journal-title-group><journal-title xml:lang="ru">Мир транспорта</journal-title><trans-title-group xml:lang="en"><trans-title>World of Transport and Transportation</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1992-3252</issn><publisher><publisher-name>Russian University of Transport (RUT)</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">mirtr-81</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>THEORY</subject></subj-group></article-categories><title-group><article-title>СТРУКТУРНАЯ ОПТИМИЗАЦИЯ ИНТЕГРИРОВАННЫХ АСУ</article-title><trans-title-group xml:lang="en"><trans-title>STRUCTURAL OPTIMIZATION OF INTEGRATED AUTO MATIC CONTROL SYSTEMS</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>Popov</surname><given-names>A. P.</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат технических наук, доцент кафедры «Автоматизированные станочные системы и инструменты»</p></bio><bio xml:lang="en"><p>Ph.D. (Tech.), associate professor of the department of automated machining systems and tools</p></bio><email xlink:type="simple">pap60@bk.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>Moscow State University of Mechanical Engineering (MAMI), Moscow</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>28</day><month>06</month><year>2014</year></pub-date><volume>0</volume><issue>3</issue><fpage>34</fpage><lpage>40</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Попов А.П., 2014</copyright-statement><copyright-year>2014</copyright-year><copyright-holder xml:lang="ru">Попов А.П.</copyright-holder><copyright-holder xml:lang="en">Popov A.P.</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://mirtr.elpub.ru/jour/article/view/81">https://mirtr.elpub.ru/jour/article/view/81</self-uri><abstract><p>Отличительной особенностью структурирования сетевых математических моделей является использование имеющегося спектра весовых значений вершин антисимметричных связных графов. Отраженные математические объекты позволяют строить упорядоченную структуру отношений между полными путями сетевого графа, описываемую ориентированным граф-деревом. А это дает, в свою очередь, возможность эффективно решать численные задачи на моделях. Представленное структурирование помогает получить эффективный алгоритм поиска полных путей. Такого рода алгоритм способствует реализации нового метода структурной оптимизации.</p></abstract><trans-abstract xml:lang="en"><p>A distinctive feature of the structuring of the network mathematical models is the use of available spectrum of weighting values of anti-symmetric connected graphs’ nodes. Reflected mathematical objects make it possible to build an ordered structure of relations between full paths of network graph, which is described with an oriented graph- tree. And it provides, in turn, the ability to effectively solve the numerical problems on the models. Represented structuring process helps to get efficient search algorithm for full paths. This kind of algorithm contributes to the realization of a new method of a structural optimization.</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>ACS</kwd><kwd>network model</kwd><kwd>structuring</kwd><kwd>graph</kwd><kwd>digraph</kwd><kwd>graph-tree</kwd><kwd>contour</kwd><kwd>group</kwd><kwd>optimization</kwd><kwd>mathematical model</kwd><kwd>algorithm</kwd><kwd>differential</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">Харари Ф. Теория графов. – М.: УРСС, 2003. – 296 с. Harari, F. Graph Theory [Teoriya grafov]. Moscow, URSS publ., 2003, 296 p.</mixed-citation><mixed-citation xml:lang="en">Харари Ф. Теория графов. – М.: УРСС, 2003. – 296 с. Harari, F. Graph Theory [Teoriya grafov]. Moscow, URSS publ., 2003, 296 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Акулич И. С. Математическое программирование в примерах и задачах. – М.: Высшая школа, 2003. – 320 с. Akulich, I. S. Mathematical programming in examples and tasks [Matematicheskoe programmirovanie v primerah i zadachah]. Moscow, Vysshaya shkola publ., 2003, 320 p.</mixed-citation><mixed-citation xml:lang="en">Акулич И. С. Математическое программирование в примерах и задачах. – М.: Высшая школа, 2003. – 320 с. Akulich, I. S. Mathematical programming in examples and tasks [Matematicheskoe programmirovanie v primerah i zadachah]. Moscow, Vysshaya shkola publ., 2003, 320 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Новиков Д. А. Сетевые структуры и организационные системы. – М.: ИПУ РАН, 2003. – 102 с. Novikov, D. A. Network structures and organizational systems [Setevye struktury i organizatsionnye sistemy]. Moscow, IPU RAN publ., 2003, 102 p.</mixed-citation><mixed-citation xml:lang="en">Новиков Д. А. Сетевые структуры и организационные системы. – М.: ИПУ РАН, 2003. – 102 с. Novikov, D. A. Network structures and organizational systems [Setevye struktury i organizatsionnye sistemy]. Moscow, IPU RAN publ., 2003, 102 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">David Lee. Coping with Discontinuities in Computer Vision: Their Detection, Classification, and Measurement// IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, № 4, 1990. pp 321–344.</mixed-citation><mixed-citation xml:lang="en">David Lee. Coping with Discontinuities in Computer Vision: Their Detection, Classification, and Measurement// IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, № 4, 1990. pp 321–344.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Вдовин В. М., Суркова Л. Е., Валентинов В. А. Теория систем и системный анализ. – М.: Дашков и Ко, 2011. – 640 с. Vdovin, V.M., Surkova, L.E., Valentinov, V. A. Systems’ theory and system analysis [Teoriya sistem i sistemnyj analiz]. Moscow, Dashkov i Ko publ., 2011, 640 p.</mixed-citation><mixed-citation xml:lang="en">Вдовин В. М., Суркова Л. Е., Валентинов В. А. Теория систем и системный анализ. – М.: Дашков и Ко, 2011. – 640 с. Vdovin, V.M., Surkova, L.E., Valentinov, V. A. Systems’ theory and system analysis [Teoriya sistem i sistemnyj analiz]. Moscow, Dashkov i Ko publ., 2011, 640 p.</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>
