<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.55648/1998-6920-2026-20-2-28-44</article-id><article-id custom-type="elpub" pub-id-type="custom">sibsutis-1068</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></article-categories><title-group><article-title>Анализ устойчивости модели адаптивной аутентификации к целевым оптимизационным атакам имитации гибридного цифрового отпечатка</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of the resilience of the adaptive authentication model to adversarial attacks via hybrid digital fingerprint imitation</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1143-5275</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Саломатин</surname><given-names>Александр Александрович</given-names></name><name name-style="western" xml:lang="en"><surname>Salomatin</surname><given-names>Alexander Alexandrovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>к.т.н., старший научный сотрудник, Институт проблем управления им. В.А. Трапезникова РАН</p></bio><bio xml:lang="en"/><email xlink:type="simple">sandr@ipu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-8049-851X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Широков</surname><given-names>Александр Сергеевич</given-names></name><name name-style="western" xml:lang="en"><surname>Shirokov</surname><given-names>Alexander Sergeevich</given-names></name></name-alternatives><bio xml:lang="ru"><p>научный сотрудник, Институт проблем управления им. В.А. Трапезникова РАН (ИПУ РАН)</p></bio><bio xml:lang="en"/><email xlink:type="simple">shiras@ipu.ru</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>Melnikov</surname><given-names>Andrey Kimovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>к.т.н., доцент ВАК, главный научный сотрудник, АО «Вычислительные решения»</p></bio><bio xml:lang="en"/><email xlink:type="simple">ak@comp-sol.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Институт проблем управления им. В.А. Трапезникова РАН (ИПУ РАН, 117342, г. Москва, ул. Профсоюзная, д. 65, стр. 2)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>V.A. Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences (ICP RAS, 117342, Moscow, Profsoyuznaya St., 65, building 2)</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>АО «Вычислительные решения» (117587, город Москва, Варшавское ш, д. 125)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>JSC "Computational Solutions" (117587, Moscow, Varshavskoe shosse, no. 125)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>22</day><month>06</month><year>2026</year></pub-date><volume>20</volume><issue>2</issue><issue-title>Вестник СибГУТИ</issue-title><fpage>28</fpage><lpage>44</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Саломатин А.А., Широков А.С., Мельников А.К., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Саломатин А.А., Широков А.С., Мельников А.К.</copyright-holder><copyright-holder xml:lang="en">Salomatin A.A., Shirokov A.S., Melnikov A.K.</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://vestnik.sibsutis.ru/jour/article/view/1068">https://vestnik.sibsutis.ru/jour/article/view/1068</self-uri><abstract><p>В статье исследуется устойчивость модели адаптивной аутентификации к целевым оптимизационным атакам имитации гибридного цифрового отпечатка. Предложено адверсариальное расширение модели адаптивной аутентификации, основанной на цифровом отпечатке, объединяющем технические и поведенческие атрибуты. Атака формализована как задача условной оптимизации с раздельными величинами допустимых возмущений технических (εd) и поведенческих (εb) атрибутов в условиях ограниченной обратной связи. Для оценки устойчивости модели введена вероятностная мера устойчивости R, согласованная с классическими метриками FAR/FRR. Экспериментальная проверка проведена на датасете из 1280 сессий (32 пользователя, 30 признаков) с использованием алгоритма CMA-ES. Результаты экспериментов показали, что модели с адаптивным взвешиванием обеспечивают двукратное повышение устойчивости относительно модели с равными весами в зоне реалистичных атак (εb≤0.2): R=0.66-0.79 против 0.39–0.53, и снижают вероятность успешной атаки до 0.36 при стратегии оптимизации технических и поведенческих признаков. Экспериментально установлено, что автоматическое снижение весов при росте дисперсии признаков затрудняет целевые оптимизационные атаки злоумышленников. Выявленная уязвимость защиты при εd≥0.5 (R≤0.07) определяет границы применимости модели и обосновывает необходимость многофакторной аутентификации при высокой доле возмущений.</p></abstract><trans-abstract xml:lang="en"><p>The article investigates the resilience of the adaptive authentication model to adversarial attacks via hybrid digital fingerprint imitation. An adversarial extension of the adaptive authentication model based on a digital fingerprint combining technical and behavioral attributes is proposed. The attack is formalized as a conditional optimization problem with separate values of permissible perturbations of technical (εd) and behavioral (εb) attributes under conditions of limited feedback. To evaluate model resilence, a probabilistic resilience measure R is introduced, consistent with the classical FAR/FRR metrics. Experimental validation was performed on a dataset of 1280 sessions (32 users, 30 attributes) using the CMA-ES algorithm. The experimental results showed that models with adaptive weighting provide a twofold increase in resilience compared to the model with equal weights in the realistic attack regime (εd ≤0.2): R=0.66-0.79 versus 0.39–0.53, and reduce the probability of a successful attack to 0.36 under a strategy for optimizing technical and behavioral features. It has been experimentally established that the automatic reduction of weights with an increase in the variance of features complicates adversarial attacks by attackers. The identified security vulnerability at εd ≥0.5 (R≤0.07) defines the limits of the model's applicability and justifies the need for multifactor authentication with a high proportion of perturbations.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>гибридный цифровой отпечаток</kwd><kwd>адаптивная аутентификация</kwd><kwd>целевые оптимизационные атаки</kwd><kwd>устойчивость аутентификации</kwd><kwd>поведенческая биометрия</kwd><kwd>кибербезопасность</kwd></kwd-group><kwd-group xml:lang="en"><kwd>hybrid digital fingerprint</kwd><kwd>adaptive authentication</kwd><kwd>adversarial attacks</kwd><kwd>authentication resilience</kwd><kwd>behavioral biometrics</kwd><kwd>cybersecurity</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">Вехов В.Б., Смушкин А.Б. Криминалистическое исследование цифровых отпечатков компьютерных устройств // Всероссийский криминологический журнал. – 2024. – Т. 18, № 4. – С. 390-397. – DOI 10.17150/2500-4255.2024.18(4).390-397. – EDN PCRWRC</mixed-citation><mixed-citation xml:lang="en">Vekhov V.B., Smushkin A.B. Kriminalisticheskoe issledovanie tsifrovykh otpechatkov komp'yuternykh ustroistv // Vserossiiskii kriminologicheskii zhurnal. – 2024. – T. 18, № 4. – S. 390-397. – DOI 10.17150/2500-4255.2024.18(4).390-397. – EDN PCRWRC</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Саломатин А.А., Лукинова О.В. Теоретические основы адаптации легитимизации пользователя на основе динамики вектора атрибутов цифрового отпечатка // Известия Юго-западного государственного университета. – 2026. – (в печати).</mixed-citation><mixed-citation xml:lang="en">Salomatin A.A., Lukinova O.V. Teoreticheskie osnovy adaptatsii legitimizatsii pol'-zovatelya na os-nove dinamiki vektora atributov tsifrovogo otpechatka // Izvestiya Yugo-zapadnogo gosudarstvennogo universiteta. – 2026. – (in press).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Bonneau J., Herley C., van Oorschot P. C., Stajano F. Passwords and the Evolution of Imperfect Authentication // Communications of the ACM. – 2015. – Vol. 58, No. 7. – P. 78–87.</mixed-citation><mixed-citation xml:lang="en">Bonneau J., Herley C., van Oorschot P. C., Stajano F. Passwords and the Evolution of Imperfect Au-thentication // Communications of the ACM. – 2015. – Vol. 58, No. 7. – P. 78–87.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Bonneau J., Herley C., van Oorschot P. C., Stajano F. The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes // IEEE Symposium on Security and Privacy. – San Francisco, CA, USA. – 2012. – P. 553–567. – DOI: 10.1109/SP.2012.44</mixed-citation><mixed-citation xml:lang="en">Bonneau J., Herley C., van Oorschot P. C., Stajano F. The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes // IEEE Symposium on Security and Pri-vacy. – San Francisco, CA, USA. – 2012. – P. 553–567. – DOI: 10.1109/SP.2012.44</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Das A., Bonneau J., Caesar M., Borisov N., Wang X. The Tangled Web of Password Reuse // Proceedings of the Network and Distributed System Security Symposium. – 2014. – DOI: 10.14722/ndss.2014.23357</mixed-citation><mixed-citation xml:lang="en">Das A., Bonneau J., Caesar M., Borisov N., Wang X. The Tangled Web of Password Reuse // Proceed-ings of the Network and Distributed System Security Symposium. – 2014. – DOI: 10.14722/ndss.2014.23357</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Juels A., Rivest R. Honeywords: Making Password-Cracking Detectable // Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security. – 2013. – P. 145–160. – DOI: 10.1145/2508859.2516671</mixed-citation><mixed-citation xml:lang="en">Juels A., Rivest R. Honeywords: Making Password-Cracking Detectable // Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security. – 2013. – P. 145–160. – DOI: 10.1145/2508859.2516671</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Eberz S., Rasmussen K. B., Lenders V., Martinovic I. Evaluating Behavioral Biometrics for Continuous Authentication: Challenges and Metrics // Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security. – 2017. – P. 386–399. – DOI: 10.1145/3052973.3053032</mixed-citation><mixed-citation xml:lang="en">Eberz S., Rasmussen K. B., Lenders V., Martinovic I. Evaluating Behavioral Biometrics for Continu-ous Authentication: Challenges and Metrics // Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security. – 2017. – P. 386–399. – DOI: 10.1145/3052973.3053032</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Viswanath B., Bashir M. A., Crovella M., Guha S., Gummadi K. P., Krishnamurthy B., Mislove A. Towards Detecting Anomalous User Behavior in Online Social Networks // USENIX Security Symposium. – 2014. – P. 223–238.</mixed-citation><mixed-citation xml:lang="en">Viswanath B., Bashir M. A., Crovella M., Guha S., Gummadi K. P., Krishnamurthy B., Mislove A. Towards Detecting Anomalous User Behavior in Online Social Networks // USENIX Security Sympo-sium. – 2014. – P. 223–238.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Monrose F., Rubin A. Authentication via Keystroke Dynamics // Proceedings of the 4th ACM Conference on Computer and Communications Security. – 1997. – P. 48–56. – DOI: 10.1145/266420.266434</mixed-citation><mixed-citation xml:lang="en">Monrose F., Rubin A. Authentication via Keystroke Dynamics // Proceedings of the 4th ACM Confer-ence on Computer and Communications Security. – 1997. – P. 48–56. – DOI: 10.1145/266420.266434</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Killourhy K., Maxion R. Comparing Anomaly Detection Algorithms for Keystroke Dynamics // IEEE/IFIP International Conference on Dependable Systems and Networks. – Lisbon, Portugal. – 2009. – P. 125–134. – DOI: 10.1109/DSN.2009.5270346.</mixed-citation><mixed-citation xml:lang="en">Killourhy K., Maxion R. Comparing Anomaly Detection Algorithms for Keystroke Dynamics // IEEE/IFIP International Conference on Dependable Systems and Networks. – Lisbon, Portugal. – 2009. – P. 125–134. – DOI: 10.1109/DSN.2009.5270346.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Shen C., Cai Z., Guan X., Maxion R. Performance Evaluation of Anomaly-Detection Algorithms for Mouse Dynamics // Computers &amp; Security. – 2014. – Vol. 45. – P. 156–171. – DOI: 10.1016/j.cose.2014.05.002</mixed-citation><mixed-citation xml:lang="en">Shen C., Cai Z., Guan X., Maxion R. Performance Evaluation of Anomaly-Detection Algorithms for Mouse Dynamics // Computers &amp; Security. – 2014. – Vol. 45. – P. 156–171. – DOI: 10.1016/j.cose.2014.05.002</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Serwadda A., Phoha V. When Kids’ Toys Breach Mobile Phone Security // Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security. – 2013. – P. 599–610. – DOI: 10.1145/2508859.2516659</mixed-citation><mixed-citation xml:lang="en">Serwadda A., Phoha V. When Kids’ Toys Breach Mobile Phone Security // Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security. – 2013. – P. 599–610. – DOI: 10.1145/2508859.2516659</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Biggio B., Roli F. Wild Patterns: Ten Years after the Rise of Adversarial Machine Learning // Pattern Recognition. – 2018. – Vol. 84. – P. 317–331. – DOI: 10.1016/j.patcog.2018.07.023.</mixed-citation><mixed-citation xml:lang="en">Biggio B., Roli F. Wild Patterns: Ten Years after the Rise of Adversarial Machine Learning // Pattern Recognition. – 2018. – Vol. 84. – P. 317–331. – DOI: 10.1016/j.patcog.2018.07.023.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Goodfellow I. J., Shlens J., Szegedy C. Explaining and Harnessing Adversarial Examples // arXiv. – 2015. – DOI: 10.48550/arXiv.1412.6572</mixed-citation><mixed-citation xml:lang="en">Goodfellow I. J., Shlens J., Szegedy C. Explaining and Harnessing Adversarial Examples // arXiv. – 2015. – DOI: 10.48550/arXiv.1412.6572</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Papernot N. et al. Practical Black-Box Attacks Against Machine Learning // Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security. – 2017. – P. 506–519. – DOI: 10.1145/3052973.3053009</mixed-citation><mixed-citation xml:lang="en">Papernot N. et al. Practical Black-Box Attacks Against Machine Learning // Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security. – 2017. – P. 506–519. – DOI: 10.1145/3052973.3053009</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Sommer R., Paxson V. Outside the Closed World: On Using Machine Learning for Network Intrusion Detection // IEEE Symposium on Security and Privacy. – Oakland, CA, USA. – 2010. – P. 305–316. – DOI: 10.1109/SP.2010.25.</mixed-citation><mixed-citation xml:lang="en">Sommer R., Paxson V. Outside the Closed World: On Using Machine Learning for Network Intrusion Detection // IEEE Symposium on Security and Privacy. – Oakland, CA, USA. – 2010. – P. 305–316. – DOI: 10.1109/SP.2010.25.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Dalvi N. et al. Adversarial Classification // Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. – 2004. – P. 99–108. – DOI: 10.1145/1014052.1014066</mixed-citation><mixed-citation xml:lang="en">Dalvi N. et al. Adversarial Classification // Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. – 2004. – P. 99–108. – DOI: 10.1145/1014052.1014066</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Li B., Vorobeychik Y. Scalable Optimization of Randomized Operational Decisions in Adversarial Classification Settings // Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics. – 2015. – Vol. 38. – P. 599–607.</mixed-citation><mixed-citation xml:lang="en">Li B., Vorobeychik Y. Scalable Optimization of Randomized Operational Decisions in Adversarial Classification Settings // Proceedings of the Eighteenth International Conference on Artificial Intelli-gence and Statistics. – 2015. – Vol. 38. – P. 599–607.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Barreno M. et al. The Security of Machine Learning // Machine Learning. – 2010. – Vol. 81. – P. 121–148. – DOI: 10.1007/s10994-010-5188-5</mixed-citation><mixed-citation xml:lang="en">Barreno M. et al. The Security of Machine Learning // Machine Learning. – 2010. – Vol. 81. – P. 121–148. – DOI: 10.1007/s10994-010-5188-5</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Chandola V. et al. Anomaly Detection: A Survey // ACM Computing Surveys. – 2009. – Vol. 41, No. 3. – Article 15. – P. 1–58. – DOI: 10.1145/1541880.1541882</mixed-citation><mixed-citation xml:lang="en">Chandola V. et al. Anomaly Detection: A Survey // ACM Computing Surveys. – 2009. – Vol. 41, No. 3. – Article 15. – P. 1–58. – DOI: 10.1145/1541880.1541882</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Apify. fingerprint-generator: Realistic browser fingerprint generator [Электронный ресурс]. – 2024. – URL: https://github.com/apify/fingerprint-generator (дата обращения: 06.04.2026).</mixed-citation><mixed-citation xml:lang="en">Apify. fingerprint-generator: Realistic browser fingerprint generator. – 2024. – URL: https://github.com/apify/fingerprint-generator (accessed: 06.04.2026).</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Andriamilanto N., Allard T., Le Guelvouit G., Garel A. A Large-scale Empirical Analysis of Browser Fingerprints Properties for Web Authentication // ACM Transactions on the Web. – 2021. – Vol. 16, No. 1. – Art. 4. – DOI: 10.1145/3478026</mixed-citation><mixed-citation xml:lang="en">Andriamilanto N., Allard T., Le Guelvouit G., Garel A. A Large-scale Empirical Analysis of Browser Fingerprints Properties for Web Authentication // ACM Transactions on the Web. – 2021. – Vol. 16, No. 1. – Art. 4. – DOI: 10.1145/3478026</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Barford P., Crovella M. Generating Representative Web Workloads for Network and Server Performance Evaluation // Proceedings of the 1998 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. – 1998. – P. 151–160.</mixed-citation><mixed-citation xml:lang="en">Barford P., Crovella M. Generating Representative Web Workloads for Network and Server Perfor-mance Evaluation // Proceedings of the 1998 ACM SIGMETRICS International Conference on Meas-urement and Modeling of Computer Systems. – 1998. – P. 151–160.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Weinreich H., Obendorf H., Herder E., Mayer H. Not Quite the Average: An Empirical Study of Web Use // ACM Transactions on the Web. – 2008. – Vol. 2, No. 1. – Art. 5. – P. 1–31. – DOI: 10.1145/1326561.1326566</mixed-citation><mixed-citation xml:lang="en">Weinreich H., Obendorf H., Herder E., Mayer H. Not Quite the Average: An Empirical Study of Web Use // ACM Transactions on the Web. – 2008. – Vol. 2, No. 1. – Art. 5. – P. 1–31. – DOI: 10.1145/1326561.1326566</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang Y., Chen W., Wang D., Yang Q. User-click Modeling for Understanding and Predicting Search-Behavior // KDD '11: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. – San Diego, CA, USA, 2011. – P. 1388–1396. – DOI: 10.1145/2020408.2020613</mixed-citation><mixed-citation xml:lang="en">Zhang Y., Chen W., Wang D., Yang Q. User-click Modeling for Understanding and Predicting Search-Behavior // KDD '11: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. – San Diego, CA, USA, 2011. – P. 1388–1396. – DOI: 10.1145/2020408.2020613</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Hansen N. The CMA Evolution Strategy: A Tutorial // arXiv preprint arXiv:1604.00772. – 2016.</mixed-citation><mixed-citation xml:lang="en">Hansen N. The CMA Evolution Strategy: A Tutorial // arXiv preprint arXiv:1604.00772. – 2016.</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>
