<?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">sapi</journal-id><journal-title-group><journal-title xml:lang="ru">Системный анализ и прикладная информатика</journal-title><trans-title-group xml:lang="en"><trans-title>«System analysis and applied information science»</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2309-4923</issn><issn pub-type="epub">2414-0481</issn><publisher><publisher-name>Belarusian National Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sapi-11</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>Data processing and decision–making</subject></subj-group></article-categories><title-group><article-title>ВЕРОЯТНОСТНЫЕ СВОЙСТВА НАЧАЛЬНЫХ ЗНАЧЕНИЙ ВЕСОВЫХ КОЭФФИЦИЕНТОВ В СИНХРОНИЗИРУЕМЫХ ИСКУССТВЕННЫХ НЕЙРОННЫХ СЕТЯХ КИНЦЕЛЯ</article-title><trans-title-group xml:lang="en"><trans-title>PROBABILISTIC PROPERTIES OF THE INITIAL VALUES OF WEIGHTING FACTORS IN SYNCHRONIZED ARTIFICIAL NEURAL</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>Golikov</surname><given-names>V. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Доктор технических наук, профессор</p></bio><email xlink:type="simple">CA_PI@bntu.by</email><xref ref-type="aff" rid="aff-1"/></contrib><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>Brich</surname><given-names>N. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Аспирант</p></bio><email xlink:type="simple">CA_PI@bntu.by</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>Belarusian National Technical University</institution><country>Belarus</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>07</day><month>05</month><year>2015</year></pub-date><volume>0</volume><issue>1-2</issue><fpage>33</fpage><lpage>37</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Голиков В.Ф., Брич Н.В., 2015</copyright-statement><copyright-year>2015</copyright-year><copyright-holder xml:lang="ru">Голиков В.Ф., Брич Н.В.</copyright-holder><copyright-holder xml:lang="en">Golikov V.F., Brich N.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://sapi.bntu.by/jour/article/view/11">https://sapi.bntu.by/jour/article/view/11</self-uri><abstract><p>Использование методов нейрокриптографии является перспективным способом для формирования идентичных бинарных последовательностей. В статье проанализировано влияние начальных значений весовых коэффициентов двух сетей на скорость достижения синхронности ИНС. Выявлено положительное свойство – равновероятность направлений движения начальных значений весовых коэффициентов. На основе проведенного исследования авторами предполагается возможность по совершенствованию архитектуры сети и алгоритма коррекции весовых коэффициентов.</p></abstract><trans-abstract xml:lang="en"><p>One of the most efficient ways for identical binary se quences generation is using methods of neural cryptography. The initial weight vestors values influence on speed of synchronization is analized. Equal probability of initial weight vestors motion directions is great advantage. On this base authors suppose new line of research conserned with improvement of network architecture and correction algorithm.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Kanter, I. The Theory of Neural Networks and Cryptography, Quantum Computers and Computing / I. Kanter, W.Kinzel.−2005. – Vol. 5, n.1. – P. 130−140.</mixed-citation><mixed-citation xml:lang="en">Kanter, I. The Theory of Neural Networks and Cryptography, Quantum Computers and Computing / I. Kanter, W.Kinzel.−2005. – Vol. 5, n.1. – P. 130−140.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Kinzel, W. Neural Cryptography / W.Kinzel, / I. Kanter // 9th International Conference on Neural Information Processing, Singapore, 2002.</mixed-citation><mixed-citation xml:lang="en">Kinzel, W. Neural Cryptography / W.Kinzel, / I. Kanter // 9th International Conference on Neural Information Processing, Singapore, 2002.</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>
