<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid/>
  <issn>2687-0517</issn>
  <journalInfo lang="ENG">
    <title>Computing, Telecommunication and Control</title>
  </journalInfo>
  <issue>
    <volume>17</volume>
    <number>3</number>
    <altNumber> </altNumber>
    <dateUni>2024</dateUni>
    <pages>1-152</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-21</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Vladimir</surname>
              <initials>S.</initials>
              <email>vlad@neva.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <researcherid>F-6480-2013</researcherid>
              <scopusid>7004013271</scopusid>
              <orcid>0000-0002-5637-1420</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Lev</surname>
              <initials>V.</initials>
              <email>lev.utkin@mail.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, Russia, 195251</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Muliukha</surname>
              <initials>V.A.</initials>
              <email>mva@rtc.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Exo-intelligent hybrid supercomputer platforms for shared-use centers</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses the possibilities of increasing the real performance of hybrid supercomputer platforms consisting of different types of processor nodes (CPU, GPU, FPGA) operating in the mode of shared-use computational resources. The conceptual difference of the proposed approach from widespread supercomputing cluster platforms can be metaphorically expressed as “Less Moore, more brain.” The considered approach shifts the focus of technology development from classical methods of increasing the performance of HPC platforms by adding new hardware multi-core computing components to more complex exo-intelligent solutions that use inductive (internal) and conceptual (external) data to implement machine learning methods for the purpose of optimally distributing available hardware resources between different classes of user applications. The proposed three-level architecture of hybrid computing platforms opens up new opportunities both for efficient scaling of user program execution processes, and for reification of descriptions of new algorithms by generating corresponding texts of computer programs, as well as interpreting the results obtained based on the use of statistical information, the carrier of which is censored data characterizing the experience of executing user applications in the mode of shared use of hybrid computational resources.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17301</doi>
          <udk>004</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>high performance hybrid computing systems</keyword>
            <keyword>machine learning</keyword>
            <keyword>scheduler</keyword>
            <keyword>survival function</keyword>
            <keyword>explainable artificial intelligence</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.1/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>22-31</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <researcherid>F-6480-2013</researcherid>
              <scopusid>7004013271</scopusid>
              <orcid>0000-0002-5637-1420</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Lev</surname>
              <initials>V.</initials>
              <email>lev.utkin@mail.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, Russia, 195251</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Konstantinov </surname>
              <initials>Andrei </initials>
              <email>andrue.konst@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0002-1115-7543</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Eremenko </surname>
              <initials>Danila </initials>
              <email>eremenko.dyu@edu.spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Vladimir</surname>
              <initials>S.</initials>
              <email>vlad@neva.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <surname>Muliukha</surname>
              <initials>V.A.</initials>
              <email>mva@rtc.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Interpretation methods for machine learning models in the framework of survival analysis with censored data: a brief overview</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Methods of interpretation, or explanation, of predictions are an integral part of modern black-box machine learning models. They have become widespread due to the need for the user to understand what the machine learning model is predicting. This is especially important for survival analysis models, as they are used in medicine, system reliability, safety, and also have features that make them difficult to explain and interpret. The paper discusses the main methods for interpreting survival models that deal with censored data and determine the characteristics of the time until a certain event. A feature of such models is that their predictions are presented not as a point value, but as a probabilistic function of time, for example, a survival function or a risk function. This requires the development of special interpretation methods. The most well-known methods SurvLIME, SurvLIME-KS, SurvNAM and SurvBeX, SurvSHAP(t) are considered, which are based on the use of LIME and SHAP interpretation methods, the Cox model and its modifications, as well as the Beran estimator.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17302</doi>
          <udk>004.85</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>machine learning</keyword>
            <keyword>survival model</keyword>
            <keyword>explainable artificial intelligence</keyword>
            <keyword>censored data</keyword>
            <keyword>Cox model</keyword>
            <keyword>Beran estimator</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.2/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>32-41</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Muliukha</surname>
              <initials>V.A.</initials>
              <email>mva@rtc.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Vostrov</surname>
              <initials>Alexey</initials>
              <email>alex.sinkriver@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Motorin</surname>
              <initials>Dmitrii</initials>
              <email>d.e.motorin@gmail.com</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Glazunov</surname>
              <initials>Vadim</initials>
              <email>neweagle@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Supercomputer resources management using machine learning methods under constraints</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Artificial intelligence and machine learning technologies are among the most promising in the field of computer science. They make it possible to obtain solutions to problems that until recently were the exclusive prerogative of humans. However, when solving practical problems, it is necessary to implement machine learning models taking into account the restrictions on available resources. Such resources can be both computational and temporary (i.e. the problem must be solved in a certain time and using certain hardware, most often it is about various mobile platforms), and informational, when it comes to small, censored, incomplete or noisy data. The paper examines machine learning methods used to solve practical problems in application areas, such as comparing the shape of three-dimensional objects and intellectualizing resource dispatching, within the framework of the concept of “Supercomputer for AI and AI for a Supercomputer”. In the field of solving problems with limited data volume, a method is proposed that allows training a multilayer neural network using an ultra-small training sample to solve the problem of quantitatively assessing the proximity of the shape of arbitrary three-dimensional objects. In the field of applying machine learning models with limited resources, a method has been developed that ensures asynchronous operation of the machine learning model and the executable process, which allows for the effective use of machine learning methods under constraints.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17303</doi>
          <udk>004.8:[62-5+004.382.2]</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>machine learning</keyword>
            <keyword>resource management</keyword>
            <keyword>supercomputer</keyword>
            <keyword>constraints</keyword>
            <keyword>neural networks</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.3/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>42-53</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0093-6506</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Malov </surname>
              <initials>Sergey </initials>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Lukashin</surname>
              <initials>Aleksey</initials>
              <email>lukash@neva.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Count time series analysis of jobs scheduling in the hybrid supercomputer center</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Increasing the efficiency of supercomputer centers is an extremely important task, especially in the context of growing demand for high-performance computing and a shortage of supercomputer resources. Statistical analysis of the results of various indicators of supercomputer performance is aimed at creating models of computing resource management and forming a basis for using artificial intelligence methods. The purpose of this research is to study the incoming flow of user requests (jobs), which largely determines the load on supercomputer resources. To analyze the incoming flow of user jobs, generalized linear models and generalized estimating equations, as well as the autoregressive conditional Poisson model, were used. It allowed taking&#13;
into account the dependence of observations and the effect of overdispersion. Based on the results of supercomputer operation observations, estimates of the time trend were obtained, as well as indicators of changes in the intensity of the job flow within weekly and annual cycles with classification by areas of expertise and computing clusters. Indicators of statistical significance of changes within the weekly and annual cycles were established. As a result of an advanced statistical analysis using multiple comparison methods, statistically significant orders of the main effects of the weekly and annual factors were obtained.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17304</doi>
          <udk>519.25</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>count time series</keyword>
            <keyword>generalized estimating equations</keyword>
            <keyword>autoregressive conditional Poisson model</keyword>
            <keyword>multiple comparisons</keyword>
            <keyword>supercomputer cluster</keyword>
            <keyword>job scheduling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.4/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>SCO</artType>
        <langPubl>RUS</langPubl>
        <pages>54-60</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Konstantinov </surname>
              <initials>Andrei </initials>
              <email>andrue.konst@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Predictive models and dynamics of estimates of applied tasks characteristics using machine learning methods</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper considers the machine learning problem of simultaneous estimation of the conditional survival distribution and dynamic characteristics of computational tasks. The problem arises in cluster workload management and is extremely relevant for optimal scheduling. To solve the problem, a new method is proposed, based on the combination of the attention mechanism and the random survival forest. The key feature is the use of a tree structure derived from a random survival forest. The forest construction algorithm uses only the survival dataset. Each leaf uses the unconditional Kaplan-Meier estimate, which is a serious limitation of the forest, especially for rare events in some parts of the feature space. Moreover, the random survival forest does not allow estimating the dynamic parameters of the task. The proposed method solves these problems by extending the already constructed random survival forest with the attention mechanism inside each leaf of the tree. The Beran estimator is used to model survival distribution, and the Nadaraya-Watson regression with the same parameters is used to predict the dynamic characteristics of tasks. To do this, subsets of training data corresponding to the same leaf as the input vector are used. As a result, the joint model is obtained that allows us to estimate the survival function more accurately and at the same time to predict the dynamic characteristics of the task. The developed model combines the advantages of smooth models based on the attention mechanism and stepwise decision trees.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17305</doi>
          <udk>004.855.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>machine learning</keyword>
            <keyword>survival analysis</keyword>
            <keyword>attention mechanism</keyword>
            <keyword>random survival forest</keyword>
            <keyword>Beran estimator</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.5/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>61-70</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Mezheneva </surname>
              <initials>Irina </initials>
              <email>Mezheneva-I@gaz-is.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Lukashin</surname>
              <initials>Aleksey</initials>
              <email>lukash@neva.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Chatoyan </surname>
              <initials>Sergey </initials>
              <email>Chatoyan-S@gaz-is.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Reconstruction of attractors of super-computer user's activity and identification of critical deviations in their behavior</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The modern job scheduling system in supercomputer platforms is based on the estimates of the request for computing resources provided by users (often based on subjective considerations). However, it has been found that such estimates can be significantly inaccurate. In this regard, a practically important task arises: building a behavior model of user tasks executed in a supercomputer, identifying and evaluating critical deviations from the predicted behavior profile (based on an assessment of user confidence). Methods of nonlinear dynamics and topological data analysis are used to solve this problem. The article presents the results of experimental studies for various data sets obtained at the “Polytechnic Supercomputer Center” of Peter the Great St. Petersburg Polytechnic University. The Betti curves of the supercomputer user profile are calculated. The results of the evaluation of the comparison of several user profiles with the reference profile are presented. A desirability scale and numerical intervals for the proposed classes are proposed.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17306</doi>
          <udk>004.8</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>high performance systems</keyword>
            <keyword>hybrid computing systems</keyword>
            <keyword>topological data analysis</keyword>
            <keyword>scalar time series</keyword>
            <keyword>job scheduling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.6/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>71-83</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Zayats</surname>
              <initials>Oleg</initials>
              <email>zay.oleg@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Baksheev </surname>
              <initials>Vitaliy </initials>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Vladimir</surname>
              <initials>S.</initials>
              <email>vlad@neva.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Muliukha</surname>
              <initials>V.A.</initials>
              <email>mva@rtc.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Model of a supercomputer cluster in the form of a queueing system with a random limit on the execution time of applied tasks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">It is well known that the efficiency of task dispatching in any supercomputer system is determined, first of all, by the adequacy of the system model used, as well as the accuracy of the estimation of the parameters of the model itself. The article proposes a new version of the supercomputer cluster model, based on a standard model of the M/M/∞ class queueing system, which is supplemented with two fundamental clarifications that reflect the features of the supercomputer operation. First, the processing time of each task is limited by the dispatcher using a random variable distributed according to the exponential law. Second, it is considered that each new task requires the allocation of a random number of service channels (processors) for its execution. The  parameters of the proposed queueing model are estimated based on statistical processing of data obtained during calculations previously performed on a supercomputer. A number of examples of using the developed model are given. To calculate the parameters of the queueing system, it is proposed to use the method of generating functions.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17307</doi>
          <udk>519.872.4:004.451.44</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>queueing system</keyword>
            <keyword>task dispatching</keyword>
            <keyword>supercomputer</keyword>
            <keyword>random execution time</keyword>
            <keyword>random number of service channels</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.7/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>84-92</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Antonenko </surname>
              <initials>Maksim </initials>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Budanov</surname>
              <initials>Dmitriy</initials>
              <email>dmitriy.budanov@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <orcid>0000-0003-0334-2770</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Institute for Analytical Instrumentation of the Russian Academy of Sciences</orgName>
              <surname>Zaitceva </surname>
              <initials>Anna </initials>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Non-invasive heart rate measurement system based on video stream analysis</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper is devoted to the development and testing of a remote biomonitoring system based on the phenomenon of plethysmography. This phenomenon allows not only to measure a person’s pulse rate non-invasively, but also to assess physiological state of the person. At the first stage of the system operation, it is necessary to detect regions of interest. This operation can be effectively implemented using neural networks. The task of face recognition was performed by the YOLOv7-tiny architecture, due to its speed and the ability to run on embedded systems. For the detected face, a rectangle was created, whose coordinates indicated the boundaries of the face. Next, the average brightness of the selected areas is calculated and stored in the dataset. By performing fast Fourier transform (FFT) for a given set, it is possible to obtain a signal spectrum. Using methods of digital signal processing, it is possible to filter the signal and select the part of the spectrum of interest in the region of 0.7–3 Hz. The maximum amplitude of the harmonic will correspond to the current pulse.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17308</doi>
          <udk>004.89</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>remote biomonitoring</keyword>
            <keyword>telehealth</keyword>
            <keyword>heart rate</keyword>
            <keyword>photoplethysmography</keyword>
            <keyword>Fourier transform</keyword>
            <keyword>neural network</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.8/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>93-102</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Lapin </surname>
              <initials>Igor </initials>
              <email>lapin_ia@spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Sabinin</surname>
              <initials> Oleg </initials>
              <email>olegsabinin@mail.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Development of the system of automatic generation of database model on the basis of the task text in natural language</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper describes an approach to the implementation of a system that would allow automatic database model generation from a natural language description given by the user. Different machine learning technique, such as transformer, named entity recognition and relation extraction are considered and applied. The implementation of the neural network model uses the capabilities of the spaCy framework to organize a generic pipeline for training. Off-the-shelf implementations of some individual components from spaCy are also used, while the rest are custom. Moreover, we describe the process of gathering and preparing raw data for training a neural network model, and generating a proper corpus from them. For this purpose, a specialized annotating tool, Doccano, is used, which satisfies all requirements and is freely available. Finally, the paper presents the model parameters used in training and the performance metrics obtained. We’ve been able to achieve great results for the named entity recognition component, while the performance metrics of the relation extraction component can still be improved. The paper concludes with possible directions for further work on the implementation of the described system, including the relation extraction component improvements and new features implementation.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17309</doi>
          <udk>004.652:004.912</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>natural language processing</keyword>
            <keyword>named entity recognition</keyword>
            <keyword>relation extraction</keyword>
            <keyword>text analysis</keyword>
            <keyword>classification</keyword>
            <keyword>relational databases</keyword>
            <keyword>model building</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.9/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>103-113</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <orcid>0000-0003-0885-1355</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>LLC “Predict space”</orgName>
              <surname>Aksenova </surname>
              <initials>Lyubov </initials>
              <address>Novorossiysk, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <orcid>0000-0001-5391-5229</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>LLC “Predict space”</orgName>
              <surname>Aksenov </surname>
              <initials>Kirill </initials>
              <address>Novorossiysk, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>LLC “Predict space”</orgName>
              <surname>Prysyazhnyuk </surname>
              <initials>Anton </initials>
              <address>Novorossiysk, Russian Federation</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <orgName>Maykop State Technological University</orgName>
              <surname>Myasnikova </surname>
              <initials>Viktoria </initials>
              <address>Maykop, Russian Federation</address>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <orgName>Bonch-Bruevich St. Petersburg State University of Telecommunications</orgName>
              <surname>Krasov </surname>
              <initials>Andrei </initials>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Development of an OCT data classification model for determining the presence and type of ophthalmic diseases</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Optical Coherence Tomography (OCT) is an important tool in the diagnosis of common ophthalmological diseases, such as age-related macular degeneration and diabetic retinopathy. However, the processes of analyzing and interpreting OCT data are highly complex due to the need to process a large amount of data and the time spent on research, as well as the ophthalmologist's failure to recognize minor or early signs of the disease or rare pathologies. This paper proposes a comprehensive approach to the development of an OCT image analysis system based on deep neural networks. In particular, the performance of models based on four neural network architectures – ResNet50, VGG16, InceptionV4, and ResNet101 – was evaluated. The results show that the model based on the ResNet50 architecture achieves the highest proportion of correctly classified images. Furthermore, the integration of the developed model into a chatbot significantly reduces the time needed to interpret OCT images, which can contribute to increased availability of preliminary diagnostics and improved quality of medical services.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17310</doi>
          <udk>303.732</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>artificial intelligence</keyword>
            <keyword>ophthalmology</keyword>
            <keyword>machine learning models</keyword>
            <keyword>neural network architectures</keyword>
            <keyword>convolutional neural networks</keyword>
            <keyword>optical coherence tomography</keyword>
            <keyword>chatbot</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.10/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>114-123</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Special Technological Center Ltd.</orgName>
              <surname>Klimenko </surname>
              <initials>Denis </initials>
              <email>d.klimenk0@yandex.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Nikitin</surname>
              <initials>Aleksandr</initials>
              <email>nikitin@mail.spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Stroganov </surname>
              <initials>Alexander </initials>
              <email>lemyr103@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Monolithic integrated circuit of a four-channel switched filter bank for the centimeter band based on GaAs pНЕМТ technology</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article presents the results of the design of a four-channel switched filter bank for the centimeter band manufactured as a monolithic microwave integrated circuit based on domestic GaAs pHEMT technology. The switched filter bank includes a set of bandpass filters operating in four sub-bands of most of the C-, X- and Ku-bands, as well as broadband SP4T switches. The bandpass filters of the lower sub-bands are designed using lumped elements, and higher sub-bands filters are designed using microstrip hairpin resonators. The SP4T switch is based on SPST switches, each of which contains one series- and three parallel-connected field-effect transistors. The switched filter bank has following parameters: insertion losses of no more than 10.8 dB, stopband suppression of at least 43 dB at 30% offset or more from the passband center frequency, and a voltage standing wave ratio of no more than 1.8 in the passband.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17311</doi>
          <udk>621.372.543</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>MMIC</keyword>
            <keyword>switched filter bank</keyword>
            <keyword>bandpass filter</keyword>
            <keyword>SP4T</keyword>
            <keyword>GaAs pHEMT</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.11/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>124-130</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Tran </surname>
              <initials>Thanh Dat</initials>
              <email>thanhdat140495@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Enhanced frequency band wideband receiver using N-path Miller bandpass filter</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper presents the design and modelling result of the wideband receiver topology with an enhanced frequency band using Miller N-path bandpass filter and harmonic-rejection mixing technique. The wideband receiver has the form of monolithic microwave integrated circuits (MMIC) based on domestic GaAs pHEMT technology. The receiver consists of low noise amplifier (LNA), commutated network and harmonic recombination circuit. When using inductors to compensate the parasitic capacitances, the bandwidth of the LNA significantly increases from 0–2.3 GHz to 0–5 GHz, thereby increasing the receiver frequency band to 0.3–3 GHz. The receiver achieves a gain of 15 dB, a noise figure of &lt; 4 dB, an out-of-band IIP3 of +8 dBm, and a harmonic-rejection ratio at the third- and fifth-order local oscillator harmonics of &gt; 50 dB.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17312</doi>
          <udk>621.3.049.774.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>wideband receiver</keyword>
            <keyword>multi-band receiver</keyword>
            <keyword>wideband LNA</keyword>
            <keyword>harmonic-rejection mixer</keyword>
            <keyword>Miller N-path bandpass filter</keyword>
            <keyword>MMIC</keyword>
            <keyword>GaAs pHEMT</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.12/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>131-139</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Yenuchenko</surname>
              <initials>Mikhail</initials>
              <email>post@mixeme.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Kvashina</surname>
              <initials>Natalya </initials>
              <email> kvashina.nv@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Piatak</surname>
              <initials>Ivan</initials>
              <email>i.m.piatak@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Influence analysis of comparator parameters spread on decision accuracy in DAC self-calibration circuit</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article presents an analysis of the influence of the comparator parameter spread in the digital-to-analog converter (DAC) self-calibration circuit on the reduction of the conversion nonlinearity. DAC on sources with a switching-based self-calibration circuit is considered. The comparator response threshold value due to the spread of component parameters for 0.18 µm CMOS technology (HCMOS8D by “Mikron”) is estimated. The comparator response threshold values are obtained for three sizes of comparator components. Functional modeling of the switching calibration taking into account the finite threshold of element comparison showed that the choice of the sorting algorithm affects the reduction of the conversion nonlinearity. It should be noted that for the smallest comparator option, only quick sort can provide an improvement in the integral nonlinearity for all considered conditions. The optimal size of the comparator components is determined in terms of the efficiency of nonlinearity reduction. The quick sort algorithm shows the best results both in nonlinearity reduction and in the influence of the comparator switching threshold sign.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17313</doi>
          <udk>621.3.049.774.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>digital-to-analog converter</keyword>
            <keyword>current source</keyword>
            <keyword>switching-based calibration</keyword>
            <keyword>mismatch</keyword>
            <keyword>comparator threshold</keyword>
            <keyword>elements sorting</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.13/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>140-152</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Udalov </surname>
              <initials>Pavel </initials>
              <email>pp_udalov@mail.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Lukin </surname>
              <initials>Aleksei </initials>
              <email>lukin@compmechlab.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Popov </surname>
              <initials>Ivan </initials>
              <email>popov_ia@spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="004">
            <authorCodes>
              <orcid>0000-0003-3103-7060</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Loboda</surname>
              <initials>Vera</initials>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <orgName>JSC “Institute of Nuclear Materials”</orgName>
              <surname>Varivcev </surname>
              <initials>Artem </initials>
              <address>Zarechny, Russian Federation</address>
            </individInfo>
          </author>
          <author num="006">
            <individInfo lang="ENG">
              <orgName>JSC “Institute of Nuclear Materials”</orgName>
              <surname>Butakov </surname>
              <initials>Denis </initials>
              <address>Zarechny, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Application of the perturbation method to construct a refined compact model of a thermoelectric element with temperature-dependent parameters</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper presents an asymptotically substantiated compact model of the Peltier element. The problem of stationary temperature distribution in a one-dimensional thermoelectric medium with temperature-dependent physical parameters is considered. A direct asymptotic approximation is constructed under the assumption that the ratio of the temperature difference at the boundaries of the Peltier element to the mean absolute temperature of the module is a small value. Expressions for heat fluxes on the absorbing and radiating sides with a nonlinear dependence on the applied current and boundary temperatures are obtained. A method of synthesis based on the obtained solution of a compact system model of a thermoelectric module is proposed. A numerical example is used to compare the obtained model with the classical model with averaged material parameters. It is shown that the heat fluxes of the two models take different values at sufficiently large electric currents. Promising areas of using the proposed new analytical model of the Peltier element in industrial problems are discussed.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.17314</doi>
          <udk>537.322</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Peltier battery</keyword>
            <keyword>Matlab</keyword>
            <keyword>Simscape</keyword>
            <keyword>direct asymptotic expansion method</keyword>
            <keyword>system-level modeling</keyword>
            <keyword>reduced order modelling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2024.82.14/</furl>
          <file/>
        </files>
      </article>
    </articles>
  </issue>
</journal>
