<?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>4</number>
    <altNumber> </altNumber>
    <dateUni>2022</dateUni>
    <pages>1-110</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-19</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">
            <individInfo lang="ENG">
              <surname>Saurenko</surname>
              <initials>Tatyana</initials>
            </individInfo>
          </author>
          <author num="003">
            <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>
          <author num="004">
            <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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">EVALUATION OF THE EFFECTIVENESS OF THE INFORMATION SECURITY SYSTEM</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses a methodological approach to building models for evaluating the&#13;
effectiveness of programs (projects) for creating or upgrading an information security system inorder to ensure the stability and competitiveness of a company in the face of increasing threats to violate the integrity, confidentiality, availability and reliability of information that is essential for its&#13;
activities. At the same time, the effectiveness of programs (projects) is understood as the degree of&#13;
use of the opportunities allocated for their implementation of material, intangible and temporary&#13;
resources to achieve the goals. In the mathematical formalization of the generalized performance&#13;
indicator, it is taken into account that the implementation of technical, technological, organizational&#13;
and other elements (activities) included in this program (project) is accompanied by the impact of&#13;
many random factors affecting the achievement of their particular goals. The proposed generalized&#13;
indicator provides a dominant assessment of the effectiveness of programs (projects), taking into&#13;
account the risks in their implementation.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/9n2h-n5x8-2nfn</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information security system of the company</keyword>
            <keyword>modernization</keyword>
            <keyword>program (project)</keyword>
            <keyword>performance indicator.</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.1/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>20-27</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-2393-9603</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Samara State Technical University</orgName>
              <surname>SHAKURSKIY</surname>
              <initials>Maxim</initials>
              <email>vigorsilentium@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes/>
            <individInfo lang="ENG">
              <orgName>Povolzhskiy State University of Telecommunications and Informatics</orgName>
              <surname>KARAULOVA</surname>
              <initials>Olga</initials>
              <email>olya4369@yandex.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>State University of Telecommunications and Informatics</orgName>
              <surname>KARTASHEVSKAYA</surname>
              <initials>Eugenia</initials>
              <email>ka-es@bk.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">SECURITY OF A TWO-COMPONENT STEGANOGRAPHIC SYSTEM TO UNAUTHORIZED INFORMATION EXTRACTION</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In the classical sense, steganography does not aim to protect information from extraction,&#13;
however, the use of a two-component steganographic system provides not only information&#13;
masking, but also cryptographic strength. The article considers the stability of the steganographic&#13;
system for embedding a two-component container to information extraction.</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/n1dr-97bk-fzx2</doi>
          <udk>621.372.552</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>two-component steganographic system</keyword>
            <keyword>masking of information</keyword>
            <keyword>information extraction security</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.2/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>28-34</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>Glibovsky</surname>
              <initials>Pavel</initials>
              <email>vka@mil.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>Timashov</surname>
              <initials>Pavel</initials>
              <email>vka@mil.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>KOTENOK</surname>
              <initials>Igor</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">METHODOLOGY OF EARLY DETECTION OF DDOS ATTACKS TO PROTECT INFORMATION INFRASTRUCTURE OBJECTS</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The approach of detecting the beginning of a DDoS attack by statistical methods, taking&#13;
into account seasonality, is considered. The standard setting of limits on the number of requests associated&#13;
with the occurrence of random triggers and various load of the web resource, depending&#13;
on the time of day and days of the week, has a number of disadvantages. To optimize the process,&#13;
it is proposed to use a floating estimate characterizing the current network activity based on the&#13;
standard deviation (RMS), as well as taking into account seasonal fluctuations. A k-means clustering&#13;
method for distributing client requests is proposed. The algorithm selects two clusters from&#13;
mixed traffic. The first is a set of legitimate requests, the second is a set of malicious requests. The&#13;
introduction of the proposed technique into the protection system, which takes into account the seasonality of DDoS attacks for various types of infrastructure objects, can increase the efficiency of&#13;
detecting such attacks without increasing resource intensity</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/6ed5-9p6x-uuf6</doi>
          <udk>004.021</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>DDoS attack</keyword>
            <keyword>standard deviation</keyword>
            <keyword>seasonal fluctuations</keyword>
            <keyword>k-means</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.3/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>35-42</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Eremenko</surname>
              <initials>Ilya</initials>
              <email>eremenko.is@edu.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Fatin</surname>
              <initials>Aleksander</initials>
              <email>sasha-fatin@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <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">CLUSTERING OF COMPUTER NETWORKS BASED ON THE BEE COLONY ALGORITHM</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper proposes a modification of the bee colony based network clustering method.&#13;
This modification is aimed at reducing the number of community partitions and reducing the&#13;
running time of the algorithm. Experimental studies on synthetic and real networks confirmed the&#13;
validity of the proposed modification of the algorithm</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/pbx4-zm55-zvem</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>community detection</keyword>
            <keyword>network clustering</keyword>
            <keyword>bee colony</keyword>
            <keyword>modular form</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.4/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>43-52</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>Glibovsky</surname>
              <initials>Pavel</initials>
              <email>vka@mil.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>Serebryakov</surname>
              <initials>Petr</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Mozhaisky Military Aerospace Academy</orgName>
              <surname>Timashov</surname>
              <initials>Pavel</initials>
              <email>vka@mil.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">IDENTIFYING AND COUNTERING MALICIOUS INFORMATION IN SOCIAL NETWORKS</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The algorithm of ranking sources by potential used to identify malicious information in&#13;
social networks and the algorithm of ranking countermeasures used to counteract it is considered.&#13;
They allow you to achieve the required level of protection of users in social networks. Resource consumption,&#13;
efficiency and objectivity were selected as indicators of the criteria for the effectiveness&#13;
of the methodology processes. The resource consumption of processes is proposed to evaluate by&#13;
indicators: «The use of the central processor device», «The use of RAM» and «Operator operation&#13;
time». When comparing the processes with each other, we take the time of the measurements of&#13;
the algorithm for ranking sources by potential and sorting the objects of influence</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/7xhd-2nbh-t8hx</doi>
          <udk>004.021</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>ranking</keyword>
            <keyword>potential</keyword>
            <keyword>countermeasure</keyword>
            <keyword>performance criteria</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.5/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>53-63</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Krasnov</surname>
              <initials>A.</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">IMITATIONAL SOFTWARE PACKAGE FOR RESEARCHING HIGHLY DETECTABLE STEGOSYSTEMS – HUGO SYSTEMS</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article describes a simulation software designed to conduct research on highly undetectable&#13;
stegosystems (so-called HUGO systems), the purpose of which is to increase the efficiency&#13;
of the stegosystem with respect to the undetectability of hidden messages, provided they&#13;
are transmitted in communication channels with a high noise level. To achieve this goal, this paper&#13;
solves the problem of developing a software package that performs on the sender’s side discrete&#13;
chaotic transformation of a secret message, then embedding it into a covering object using the&#13;
±1HUGO method and encoding, and on the recipient’s side decoding using a multi–threshold decoder,&#13;
extracting a secret message and reverse discrete chaotic transformation. In addition, the&#13;
software package must calculate performance indicators: the peak signal-to-noise ratio and the&#13;
Pearson correlation coefficient of the covering object and the stego</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/mnp8-pmu1-uxfd</doi>
          <udk>519.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>±1HUGO</keyword>
            <keyword>stegosystem</keyword>
            <keyword>self-orthogonal noise-tolerant code</keyword>
            <keyword>multi-threshold decoder</keyword>
            <keyword>discrete chaotic transformation</keyword>
            <keyword>Arnold Cat Map transform</keyword>
            <keyword>chaotic baker mapping</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.6/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>64-70</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0001-7758-097X</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>ITMO University</orgName>
              <surname>NOSKOV</surname>
              <initials>Ivan</initials>
              <email>vanya170595@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">FINDING ENUMERATORS FOR A GENERALIZED (L, G)-CODE</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article presents an algorithm for finding enumerators of the second degree and&#13;
higher for a generalized (L, G)-code. This algorithm allows you to increase the speed of calculating&#13;
enumerators, in contrast to the exhaustive search algorithm. This algorithm can be used to build&#13;
a modern version of the McEliece cryptosystem. The above solution is based on using the method&#13;
of representing an element of the Galois field through a function containing coefficients from a&#13;
field of smaller size. This article also presents the results of a comparison of the modern McEliece&#13;
cryptosystem built on Goppa codes and generalized (L, G)-codes</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/p8xu-5ut2-zk7z</doi>
          <udk>004.056.55</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>McAleese cryptosystem</keyword>
            <keyword>generalised (L</keyword>
            <keyword>G)-codes</keyword>
            <keyword>second-degree numerators.</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.7/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>71-88</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-0003-1284-0915</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <surname>Fomicheva</surname>
              <initials>Svetlana</initials>
              <email>levikha@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <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">IMPROVING THE EFFICIENCY OF MULTI-AGENT INFORMATION SECURITY SYSTEMS USING POST-QUANTUM CRYPTOGRAPHY</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper analyzes the problems of ensuring information security in open multi-agent&#13;
systems that use access control schemes based on RSA algorithms. It is shown that when using such&#13;
schemes, a significant part of the agents ‘ lifetime is spent on authentication processes. To increase&#13;
the efficiency of multi-agent systems by reducing the number of agent authentication processes, a&#13;
method of access differentiation based on Goppa codes is justified and proposed. For the proposed&#13;
methodology, an assessment of the level of security of agent information is given</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/75dp-p3ed-hrmk</doi>
          <udk>519.71; 621.391; 004.89</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Cyber-Physical systems</keyword>
            <keyword>Mobile agents</keyword>
            <keyword>Access control mechanisms</keyword>
            <keyword>Efficiency of multiagent systems</keyword>
            <keyword>Goppa codes.</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.8/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>89-100</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0002-7485-4848</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Aleksandrova </surname>
              <initials>Elena</initials>
              <email>aleksandrova_eb@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0002-2141-6780</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great Saint-Petersburg Polytechnic University</orgName>
              <surname>Shtyrkina</surname>
              <initials>Anna</initials>
              <email>anna_sh@ibks.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">ADAPTIVE NEUTRALIZATION OF CYBERPHYSICAL SYSTEMS STRUCTURAL BREACH BASE ON GRAPH ARTOFOCAL NEURAL NETWORKS</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper proposed a threat model of cyber-physical systems (CPS), with examples of&#13;
attacks and consequences for systems for various purposes. It is concluded that the most critical&#13;
consequences of attacks are related to the disruption of information exchange within the system&#13;
&#13;
Thus, the task of ensuring the security of the CPS is reduced to restoring the efficiency of information&#13;
exchange. To neutralize the negative consequences for information exchange, it is proposed&#13;
to use graph artificial neural networks (ANNs). A review of modern architectures of graph ANNs has&#13;
been carried out. To generate a synthetic training dataset, an algorithm was developed and implemented&#13;
that simulates the intensity of the network flow and the workload of devices in the system&#13;
based on graph centrality metrics. A graph ANN was trained for the task of reconfiguring the graph&#13;
of the CFS network</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/ekxn-g747-kb13</doi>
          <udk>004.056</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>cyberphysical systems</keyword>
            <keyword>graph theory spectral graph theory</keyword>
            <keyword>graph artificial neural network</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.9/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>101-109</pages>
        <authors>
          <author num="001">
            <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="002">
            <authorCodes>
              <orcid>0000-0001-7601-2874</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Profinfotech LLC</orgName>
              <surname>Chestnov</surname>
              <initials>Arsenii</initials>
              <email>arsenij430@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0003-0554-5790</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Admiral Makarov State University of Maritime and Inland Shipping</orgName>
              <surname>Abramov</surname>
              <initials>Valery</initials>
              <email>val.abramov@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">ASPECTS OF THE DEVELOPMENT AND FUTURE PROSPECTS OF THE PROGRAM FOR AUTOMATIC PROCESSING OF SATELLITE ARCHIVES OF HYDROCHEMICAL DATA IN THE PYTHON PROGRAMMING LANGUAGE</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article describes in detail the process of creating a program written in the interpreted&#13;
Python programming language. The function of this program is to automate the processing of satellite&#13;
data archives on the content of chlorophyll, nitrates and phosphates to save time and prevent&#13;
manual processing errors due to the human factor. The article describes in detail the program code,&#13;
its segments and algorithms</abstract>
        </abstracts>
        <codes>
          <doi>10.48612/jisp/7747-zanp-m6dr</doi>
          <udk>2.3.3</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>automation</keyword>
            <keyword>program</keyword>
            <keyword>Python</keyword>
            <keyword>hydrochemistry</keyword>
            <keyword>data processing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://jisp.spbstu.ru/article/2022.9.10/</furl>
          <file>2022_4_short.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
