<?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="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-1380</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="en"><subject>INFORMATION TECHNOLOGY, COMPUTER SCIENCE AND MANAGEMENT</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИКА, ВЫЧИСЛИТЕЛЬНАЯ ТЕХНИКА И УПРАВЛЕНИЕ</subject></subj-group></article-categories><title-group><article-title>MODEL OF OPTIMAL REGULATION  OF NON-OBSERVABLE (HIDDEN) RANDOM PROCESS</article-title><trans-title-group xml:lang="ru"><trans-title>МОДЕЛЬ ОПТИМАЛЬНОГО РЕГУЛИРОВАНИЯ  НЕНАБЛЮДАЕМОГО (СКРЫТОГО) СЛУЧАЙНОГО ПРОЦЕССА</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>LEDNOV</surname><given-names>D.</given-names></name></name-alternatives></contrib></contrib-group><pub-date pub-type="collection"><year>2006</year></pub-date><pub-date pub-type="epub"><day>16</day><month>10</month><year>2018</year></pub-date><volume>6</volume><issue>2</issue><fpage>125</fpage><lpage>133</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; LEDNOV D., 2006</copyright-statement><copyright-year>2006</copyright-year><copyright-holder xml:lang="ru">ЛЕДНОВ Д.</copyright-holder><copyright-holder xml:lang="en">LEDNOV D.</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.vestnik-donstu.ru/jour/article/view/1380">https://www.vestnik-donstu.ru/jour/article/view/1380</self-uri><abstract><p>In the present paper the problem of non-observable (hidden) random autoregression process control based on the criteria of minimal dispersion of dynamical ratio value between an observable autoregression processes with hidden random process-dependent behavior is researched.</p><p>A sequence of controlled parameters is calculated for the specific case of problem. An approach reducing the calculation complexity of control parameter is found.</p></abstract><trans-abstract xml:lang="ru"><p>В настоящей работе поставлена задача управления ненаблюдаемым (скрытым) случайным процессом авторегрессии на основе критерия минимальной дисперсии значения динамических отношений между наблюдаемыми процессами авторегрессии, на поведение которых влияет скрытый процесс. Проведено вычисление последовательности значений управляющего параметра для частного случая поставленной задачи. Рассмотрено приближение, которое позволяет сократить сложность вычислений управляющего параметра.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>модель наблюдений</kwd><kwd>процесс авторегрессии</kwd><kwd>управление.</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">Kalman R.E. A New Approach to Linear Filtering and Prediction Problems// Transaction of the ASME-Jornal of Basic Engineering. – 1960. 82 (Series D): 35-45.</mixed-citation><mixed-citation xml:lang="en">Kalman R.E. A New Approach to Linear Filtering and Prediction Problems// Transaction of the ASME-Jornal of Basic Engineering. – 1960. 82 (Series D): 35-45.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Панков А.Р., Миллер Г.Б. Минимаксная линейная рекуррентная фильтрация неопределенно-стохастических последовательностей по интегральному критерию// Информационные процессы. – 2001. – Т.1. - №2. – С.150-166</mixed-citation><mixed-citation xml:lang="en">Панков А.Р., Миллер Г.Б. Минимаксная линейная рекуррентная фильтрация неопределенно-стохастических последовательностей по интегральному критерию// Информационные процессы. – 2001. – Т.1. - №2. – С.150-166</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Agranovsky A.V. Lednov D.A. A model of controlled hidden linear autoregression processes for speakers identification// International Workshop ‘’SPEECH AND COMPUTER’’ (SPECOM). – 2005. – V2. – P.571-573.</mixed-citation><mixed-citation xml:lang="en">Agranovsky A.V. Lednov D.A. A model of controlled hidden linear autoregression processes for speakers identification// International Workshop ‘’SPEECH AND COMPUTER’’ (SPECOM). – 2005. – V2. – P.571-573.</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>
