<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid>9004</titleid>
  <issn>2071-8217</issn>
  <journalInfo lang="ENG">
    <title>Problems of information security. Computer systems</title>
  </journalInfo>
  <issue>
    <number>3</number>
    <altNumber> </altNumber>
    <dateUni>2024</dateUni>
    <pages>1-155</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-19</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-6178-6420</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>National Research University Higher School of Economics</orgName>
              <surname>Bogdanov</surname>
              <initials>Dmitry</initials>
              <email>bogdanovds@rambler.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>TVP Laboratory</orgName>
              <surname>Logachev</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-5606-7509</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>MIREA – Russian Technological University</orgName>
              <surname>Mironkin</surname>
              <initials>Vladimir </initials>
              <email>mironkin.v@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The probabilitic-theoretic models of physical random number generators</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper presents the main probability-theoretic models describing a wide class of physical random number generators and allowing us to propose general approaches to their synthesis and analysis</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/m3bn-24ap-6tn8</doi>
          <udk>004.056.55</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>physical random number generator</keyword>
            <keyword>stochastic process</keyword>
            <keyword>scheme of instantaneous value</keyword>
            <keyword>scheme of intervals</keyword>
            <keyword>scheme of excursion</keyword>
            <keyword>optimal interpolation problem</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.1/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>20-29</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-6695-2328</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>St. Petersburg State Marine Technical University</orgName>
              <surname>Garkushev</surname>
              <initials>Alexander</initials>
              <email>sangark@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0009-0009-1545-8835</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>St. Petersburg State Marine Technical University</orgName>
              <surname>Vyvolokina</surname>
              <initials>Albina</initials>
              <email>albina.vyvolokina@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0007-2389-0789</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>St. Petersburg State Marine Technical University</orgName>
              <surname>Fokina</surname>
              <initials>Sofia</initials>
              <email>sofiya.fockina@gmail.com</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0001-9665-0128</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Suprun </surname>
              <initials>Alexander</initials>
              <email>afs54@inbox.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Application of indicator functions in models of detection and neutralization of malicious information objects</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article proposes a new approach to the application of the well-known method of indicator functions, which used to simulate the detection and neutralization of suspicious information objects in the information environment of an industrial enterprise, as well as to simulate a security system during operation. Formula dependencies are given for calculation of stochastic indicators, allowing some objective estimates of values of time parameters and their impact on safe functioning of information systems</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/26b3-6761-5umb</doi>
          <udk>004.056.57, 629.5.067</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>indicator function</keyword>
            <keyword>information security</keyword>
            <keyword>information system</keyword>
            <keyword>neutralization</keyword>
            <keyword>identification of the object</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.2/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>30-39</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0002-7176-7105</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Far Eastern State Transport University</orgName>
              <surname>Rybkina</surname>
              <initials>Olesya</initials>
              <email>itis_dvgups@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Construction of deterministic and stochastic mathematical models of information system protection</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Mathematical models of information system defense against information security threats are proposed based on the classical model of the struggle between two adversaries - the Lanchester model. Using the method of constructing systems of differential equations with a given set of invariants - first integrals, a deterministic model with invariant control and a stochastic model with Viner perturbations and a model with software control with probability 1 have been constructed. The behavior of the systems has been evaluated by means of mathematical modeling in MathCad. Behavior of the constructed models depending on initial conditions is considered. The existence of the stochastic model of information system protection against information security threats protected with probability 1 is established</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/g4gd-n9vm-h933</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>mathematical model</keyword>
            <keyword>Lanchester model</keyword>
            <keyword>information security</keyword>
            <keyword>deterministic model of information protection</keyword>
            <keyword>stochastic model of information protection</keyword>
            <keyword>invariant control</keyword>
            <keyword>program control with probability 1</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.3/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>40-57</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0000-0786-415X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <surname>Zaitzeva</surname>
              <initials>Valeriya</initials>
              <email>valeriazaic@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9659-1244</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Poltavtseva</surname>
              <initials>Maria </initials>
              <email>potavtseva@ibks.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Security assessment of Big Data systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article deals with the task of the security assessing of big data systems. The authors define the main features of big data systems as an object of security assessment and analyze the known methods of assessment, including methodologies for assessing the security of information systems. Based on the results obtained, a new method of assessment is proposed, taking into account such factors as the state of the access control system in the considered heterogeneous systems and the number of privileged users. A mathematical formalization of the assessment is proposed, the main stages of its implementation are described, and a test case is presented</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/zuv1-6ufz-v6v6</doi>
          <udk>004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security</keyword>
            <keyword>Big Data</keyword>
            <keyword>heterogeneous data processing systems</keyword>
            <keyword>security assessment</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.4/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>58-68</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-6419-0072</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>St. Petersburg State University of Aerospace Instrumentation</orgName>
              <surname>Tatarnikova</surname>
              <initials>Tatiana</initials>
              <email>Tm-tatarn@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>57200960264</scopusid>
              <orcid>0000-0001-6289-3295</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Russian State Hydrometeorological University</orgName>
              <surname>Sikarev</surname>
              <initials>Igor</initials>
              <email>sikarev@yandex.ru</email>
              <address>Russia, 192007, St. Petersburg, Voronezhskaya str., 79</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Russian State Hydrometeorological University</orgName>
              <surname>Rychikhin</surname>
              <initials>Daniil</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Ways to obtain evidential information from a computer using Open Source</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The current task of obtaining evidentiary information as a direction for the development of digital forensics is considered. The procedure for collecting evidentiary information from computer storage devices is given, including the basic requirements for collecting evidence, its safety and ensuring integrity. An overview of methods for obtaining evidentiary information from a computer is given, among which an accessible and effective method is highlighted using Open Source software to form a snapshot of RAM. The results of an experiment to study the possibility of obtaining and analyzing a snapshot of a computer's RAM using Open Source tools are presented and approximate information is determined that can be obtained when using them in the interests of computer technical expertise</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/k8d8-uu31-54za</doi>
          <udk>343.98</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>digital forensics</keyword>
            <keyword>evidentiary information obtained from a computer</keyword>
            <keyword>the procedure for collecting evidentiary information</keyword>
            <keyword>methods for obtaining evidentiary information</keyword>
            <keyword>an experiment on obtaining evidentiary information from a computer</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.5/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>69-79</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-8627-4947</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Busygin</surname>
              <initials>Alexey</initials>
              <email>a.busygin@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-9732-0099</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kalinin</surname>
              <initials>Maxim</initials>
              <email>max@ibks.spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Application of distributed ledger technology to protect smart city information systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses the application of the distributed ledger technology to secure information systems of the smart city. The authors identified the limitations of existing solutions in this area and considered the main directions for the development of distributed ledger technology, ensuring successful integration into the smart city ecosystem</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/tuu4-6exx-8r6x</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>smart city</keyword>
            <keyword>internet of things</keyword>
            <keyword>distributed ledger technology</keyword>
            <keyword>information security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.6/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>80-87</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-9665-0128</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Suprun </surname>
              <initials>Alexander</initials>
              <email>afs54@inbox.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-6527-2352</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peoples’ Friendship University of Russia named after Patrice Lumumba</orgName>
              <surname>Anisimov</surname>
              <initials>Evgeny</initials>
              <email>anis.an‑33@yandex.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0003-1736-7178</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Anisimov</surname>
              <initials>Vladimir</initials>
              <email>an‑33@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Assessment of the possibility of upgrading information security systems in the planned time frame</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In the interests of sound planning for the modernization of information security systems, approaches to constructing methods for assessing the possibility of developing and introducing within the planned time frame innovations necessary for the timely detection, prevention and elimination of the consequences of information security threats are considered. As an indicator for assessing this possibility, it is proposed to use the probability of modernizing the information security system over a certain specified period of time. To quantify this indicator, approaches based on a generalization of Chebyshev’s inequality and the principle of stochastic dominance are proposed</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/254r-88eu-dxxe</doi>
          <udk>519.854.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security system</keyword>
            <keyword>modernization planning</keyword>
            <keyword>assessing the likelihood of meeting the deadlines for introducing innovations</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.7/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>88-93</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-7199-6384</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Special Technology Center LLC</orgName>
              <surname>Kurakin</surname>
              <initials>Alexander </initials>
              <email>akurakin@stc-spb.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">An integral indicator of the effectiveness of the use of a group of unmanned aerial vehicles in solving aerial photography tasks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper evaluates the effectiveness of a group of unmanned aerial vehicles in performing aerial photography tasks in solving heterogeneous tasks and various payload variants. The modeling of options for equipping the elements of the group when performing various tasks is carried out. The integral indicator is defined as a combination of particular performance indicators, efficiency and resource intensity. The relationship between task options and payload options has been established. Numerical modeling of combinations of group equipment options and task options is carried out</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/nu3p-36v9-263z</doi>
          <udk>004.021</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>efficiency</keyword>
            <keyword>resource intensity</keyword>
            <keyword>integral indicator</keyword>
            <keyword>group of unmanned aerial vehicles</keyword>
            <keyword>flight task</keyword>
            <keyword>efficiency</keyword>
            <keyword>comparative assessment</keyword>
            <keyword>aerial photography</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.8/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>94-108</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-1345-1874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Pavlenko</surname>
              <initials>Evgeny</initials>
              <email>pavlenko_eyu@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis and prediction of states of industrial networks with adaptive topology based on network motifs</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">An approach to investigating the states of complex industrial networks with adaptive topology using network motifs - statistically significant subgraphs of a larger graph - is proposed. The analysis presented addresses the ability of network motifs to characterize system performance and the possibility of their application to short-, medium-, and long-term prediction of system states. Using the Smart Grid network structure as an example, a directed graph is modeled, in which the most common motifs are searched, several attack scenarios on network nodes are simulated and a network state prediction is built. The results of experimental studies confirmed the correctness and validity of the application of this mathematical apparatus for the set tasks</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/39u8-prha-62z7</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>dynamic graph</keyword>
            <keyword>network motive</keyword>
            <keyword>target function</keyword>
            <keyword>network with adaptive topology</keyword>
            <keyword>forecasting</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.9/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>109-126</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-0924-6221</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Saint Petersburg State University of Aerospace Instrumentation</orgName>
              <surname>Bezzateev</surname>
              <initials>Sergey</initials>
              <email>sergey.bezzateev@gmail.com</email>
              <address>Russia, 190000, St. Petersburg, Bolshaya Morskaya str., 67, liter A</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-7126-6787</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zhemelev</surname>
              <initials>Georgiy</initials>
              <email>wws.dev@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0003-1284-0915</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <surname>Fomicheva</surname>
              <initials>Svetlana</initials>
              <email>levikha@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research on the performance of AutoML platforms in confidential computing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper examines the performance indicators of automatic machine learning platforms when they function in standard and confidential modes using the example of a nonlinear multidimensional regression. A general protocol of distributed machine learning trusted in the sense of security is proposed. It is shown that within the framework of confidential virtualization, when optimizing the architecture of machine learning pipelines and hyperparameters, the best quality indicators of generated pipelines for multidimensional regressors and speed characteristics are demonstrated by solutions based on Auto Sklearn compared with Azure AutoML, which is explained by different learning strategies. The results of the experiments are presented</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/abff-du38-v739</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>automatic machine learning</keyword>
            <keyword>confidential computing</keyword>
            <keyword>confidential virtual machines</keyword>
            <keyword>optimization of the architecture of the machine-learning model</keyword>
            <keyword>hyperparameters</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.10/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>127-141</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0009-0000-3249-4103</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Bogina</surname>
              <initials>Vasilisa</initials>
              <email>bogina_vm@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>LLC “NeoBIT”</orgName>
              <surname>Velichko</surname>
              <initials>Kirill</initials>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0009-0008-9034-1365</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Makeeva</surname>
              <initials>Anna</initials>
              <email>makeeva.aa@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0001-9862-1507</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Dakhnovich</surname>
              <initials>Andrey</initials>
              <email>add@ibks.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="005">
            <authorCodes>
              <scopusid>13103571000</scopusid>
              <orcid>0000-0002-0232-7248</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Zegzhda</surname>
              <initials>Dmitry</initials>
              <email>zegzhda_dp@spbstu.ru</email>
              <address>Russia, 195251, St. Petersburg, Polytechnicheskaya str., 29</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Approach to creating personalised LLM agents based on MBTI personality traits</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article describes an approach to creating target characters based on LLM agents. Agents use personal memory to access biographical and personal data assigned to them. In order to increase the integrity of the characters being created, a short life biography is generated based on the initial target data, corresponding to the original set and enriching the reactions of the agents. The personal traits inherited by agents are formulated on the basis of descriptive information of MBTI types, and the paper presents a study of the correspondence of characters to their target personality type</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/4pum-m1b1-96kh</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>LLM</keyword>
            <keyword>social simulation</keyword>
            <keyword>personalization</keyword>
            <keyword>social modeling</keyword>
            <keyword>cyberpsychology</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.11/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>142-154</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0623-9891</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Gololobov</surname>
              <initials>Nikita</initials>
              <email>gololobov_nv@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis and forecasting the states of industrial networks with adaptive topology based on network motives</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The most vulnerable nodes of any information system are those that depend on the human factor. Such nodes, for example, include user electronic computers (PCs), which are susceptible to attacks using malicious software (malware). Modern malware detection tools can effectively identify known instances, but their effectiveness for zero-day threats is at a suboptimal level. One of the potential ways to identify malware is a method based on behavioral analysis and analysis of their activity on a personal computer, but its creation requires systematization of known information about the activity of various types of malwares. This scientific work systematizes malicious software to determine the types of activity they exhibit to use the resulting system to create a method for identifying malware based on behavioral analysis</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/npp7-45tr-em48</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security</keyword>
            <keyword>malicious software</keyword>
            <keyword>systematization</keyword>
            <keyword>malware activity</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2024.18.12/</furl>
          <file>2024_3-5-6.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
