http://ric.zntu.edu.ua/issue/feed Radio Electronics, Computer Science, Control 2021-10-12T14:12:09+03:00 Sergey A. Subbotin subbotin.csit@gmail.com Open Journal Systems <p dir="ltr" align="justify"><strong>Description:</strong> The scientific journal «Radio Electronics, Computer Science, Control» is an international academic peer-reviewed publication. It publishes scientific articles (works that extensively cover a specific topic, idea, question and contain elements of their analysis) and reviews (works containing analysis and reasoned assessment of the author's original or published book) that receive an objective review of leading specialists that evaluate substantially without regard to race, sex, religion, ethnic origin, nationality, or political philosophy of the author(s).<span id="result_box2"><br /></span><strong>Founder and </strong><strong>Publisher</strong><strong>:</strong> <a href="http://zntu.edu.ua/zaporozhye-national-technical-university" aria-invalid="true">National University "Zaporizhzhia Polytechnic"</a>. <strong>Country:</strong> Ukraine.<span id="result_box1"><br /></span><strong>ISSN</strong> 1607-3274 (print), ISSN 2313-688X (on-line).<span id="result_box3"><br /></span><strong>Certificate of State Registration:</strong> КВ №24220-14060ПР dated 19.11.2019. The journal is registered by the Ministry of Justice of Ukraine.<br /><span id="result_box4">By the Order of the Ministry of Education and Science of Ukraine from 17.03.2020 № 409 “On approval of the decision of the Certifying Collegium of the Ministry on the activities of the specialized scientific councils dated 06<br />March 2020”<strong> journal is included to the list of scientific specialized periodicals of Ukraine in category “А” (highest level), where the results of dissertations for Doctor of Science and Doctor of Philosophy may be published</strong>. <span id="result_box26">By the Order of the Ministry of Education and Science of Ukraine from 12.21.2015 № 1328 "On approval of the decision of the Certifying Collegium of the Ministry on the activities of the specialized scientific councils dated 15 December 2015" journal is included in the <strong>List of scientific specialized periodicals of Ukraine</strong>, where the results of dissertations for Doctor of Science and Doctor of Philosophy in Mathematics and Technical Sciences may be published.</span><br />The <strong>journal is included to the Polish List of scientific journals</strong> and peer-reviewed materials from international conferences with assigned number of points (Annex to the announcement of the Minister of Science and Higher Education of Poland from July 31, 2019: Lp. 16981). </span><span id="result_box27"><br /></span><strong> Year of Foundation:</strong> 1999. <strong>Frequency :</strong> 4 times per year (before 2015 - 2 times per year).<span id="result_box6"><br /></span><strong> Volume</strong><strong>:</strong> up to 20 conventional printed sheets. <strong>Format:</strong> 60x84/8. <span id="result_box7"><br /></span><strong> Languages:</strong> English, Russian, Ukrainian.<span id="result_box8"><br /></span><strong> Fields of Science :</strong> Physics and Mathematics, Technical Sciences.<span id="result_box9"><br /></span><strong> Aim: </strong>serve to the academic community principally at publishing topical articles resulting from original research whether theoretical or applied in various aspects of academic endeavor.<strong><br /></strong><strong> Focus:</strong> fresh formulations of problems and new methods of investigation, help for professionals, graduates, engineers, academics and researchers disseminate information on state-of-the-art techniques according to the journal scope.<br /><strong>Scope:</strong> telecommunications and radio electronics, software engineering (including algorithm and programming theory), computer science (mathematical modeling and computer simulation, optimization and operations research, control in technical systems, machine-machine and man-machine interfacing, artificial intelligence, including data mining, pattern recognition, artificial neural and neuro-fuzzy networks, fuzzy logic, swarm intelligence and multiagent systems, hybrid systems), computer engineering (computer hardware, computer networks), information systems and technologies (data structures and bases, knowledge-based and expert systems, data and signal processing methods).<strong><br /></strong> <strong> Journal sections:</strong><span id="result_box10"><br /></span>- radio electronics and telecommunications;<span id="result_box12"><br /></span>- mathematical and computer modelling;<span id="result_box13"><br /></span>- neuroinformatics and intelligent systems;<span id="result_box14"><br /></span>- progressive information technologies;<span id="result_box15"><br /></span>- control in technical systems. <span id="result_box17"><br /></span><strong>Abstracting and Indexing:</strong> <strong>The journal is indexed in <a href="https://mjl.clarivate.com/search-results" target="_blank" rel="noopener">Web of Science</a></strong> (WoS) scientometric database. The articles, published in the journal, are abstracted in leading international and national <strong>abstractig journals</strong> and <strong>scientometric databases</strong>, and also are placed to the <strong>digital archives</strong> and <strong>libraries</strong> with free on-line access. <span id="result_box21"><br /></span><strong>Editorial board: </strong><em>Editor in chief</em> - S. A. Subbotin, D. Sc., Professor; <em>Deputy Editor in Chief</em> - D. M. Piza, D. Sc., Professor. The <em>members</em> of Editorial Board are listed <a href="http://ric.zntu.edu.ua/about/editorialTeam" aria-invalid="true">here</a>.<span id="result_box19"><br /></span><strong>Publishing and processing fee:</strong> Articles are published and peer-reviewed <strong>free of charge</strong>.<span id="result_box20"><br /></span><strong> Authors Copyright: </strong>The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions. The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles. The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.<span id="result_box21"><br /></span><strong> Authors Responsibility:</strong> Submitting the article to the journal, authors hereby assume full responsibility for the copyright compliance of other individuals and organizations, the accuracy of citations, data and illustrations, nondisclosure of state and industrial secrets, express their consent to transfer for free to the publisher the right to publish, to translate into foreign languages, to store and to distribute the article materials in any form. Authors who have scientific degrees, submitting the article in the journal, thereby giving their consent to free act as reviewers of other authors articles at the request of the journal editor within the established deadlines. The articles submitted to the journal must be original, new and interesting to the reader audience of the journal, have reasonable motivation and aim, be previously unpublished and not be considered for publication in other journals. Articles should not contain trivial and obvious results, make unwarranted conclusions and repeat conclusions of already published studies.<span id="result_box22"><br /></span><strong> Readership: </strong>scientists, university faculties, postgraduate and graduate students, practical specialists.<span id="result_box23"><br /></span><strong> Publicity and Accessing Method :</strong> <strong>Open Access</strong> on-line for full-text publications<span id="result_box24">.</span></p> <p dir="ltr" align="justify"><strong><span style="font-size: small;"> <img src="http://journals.uran.ua/public/site/images/grechko/1OA1.png" alt="" /> <img src="http://i.creativecommons.org/l/by-sa/4.0/88x31.png" alt="" /></span></strong></p> http://ric.zntu.edu.ua/article/view/242015 OPTIMIZATION OF TIMETABLE AT THE UNIVERSITY 2021-10-09T17:04:47+03:00 A. I. Kosolap rvv@zntu.edu.ua T. M. Dubovik rvv@zntu.edu.ua <p>Context. In this paper, we consider a well-known university scheduling problem. Such tasks are solved several times a year in every educational institution. The problem of constructing an optimal schedule remains open despite numerous studies in this area. This is due to the complexity of the corresponding optimization problem, in particular, its significant dimension. This complicates its numerical solution with existing optimization methods. Scheduling models also need improvement. Thus, schedule optimization is a complex computational problem and requires the development of new methods for solving it.&nbsp;</p> <p>Objective. Improvement of optimization models for timetabling at the university and the use of new effective methods to solve them.</p> <p>Method. We use the exact quadratic regularization method to solve timetabling optimization problems. Exact quadratic regularization allows transforming complex optimization models with Boolean variables into the problem of maximizing the vector norm on a convex set. We use the efficient direct dual interior point method and dichotomy method to solve this problem. This method has shown significantly better results in solving many complex multimodal problems. This is confirmed by many comparative computational experiments. The exact quadratic regularization method is even more effective in solving timetabling problems. This optimization method is used for the first time for this class of problems, so it required the development of adequate algorithmic support.</p> <p>Results. We propose a new, simpler timetabling optimization model that can be easily implemented software in Excel with the OpenSolver, RoskSolver, and others. We give a small example of building a schedule and describe step-by-step instructions for obtaining the optimal solution.&nbsp;</p> <p>Conclusions. An efficient new technology developed for university timetable, which is simple to implement and does not require the development of special software. The efficiency of the technology is ensured by the use of a new method of exact quadratic regularization.&nbsp;</p> 2021-10-09T00:00:00+03:00 Copyright (c) 2021 А. І. Косолап, Т. М. Дубовик http://ric.zntu.edu.ua/article/view/241691 TWO-SIDED APPROXIMATIONS METHOD BASED ON THE GREEN’S FUNCTIONS USE FOR CONSTRUCTION OF A POSITIVE SOLUTION OF THE DIRICHLE PROBLEM FOR A SEMILINEAR ELLIPTIC EQUATION 2021-10-06T11:28:25+03:00 N. V. Gybkina rvv@zntu.edu.ua S. M. Lamtyugova rvv@zntu.edu.ua M. V. Sidorov rvv@zntu.edu.ua <p>Context. The question of constructing a method of two-sided approximations for finding a positive solution of the Dirichlet problem for a semilinear elliptic equation based on the use of the Green’s functions method is considered. The object of research is the first boundary value problem (the Dirichlet problem) for a second-order semilinear elliptic equation.&nbsp;</p> <p>Objective. The purpose of the research is to develop a method of two-sided approximations for solving the Dirichlet problem for second-order semilinear elliptic equations based on the use of the Green’s functions method and to study its work in solving test problems.</p> <p>Method. Using the Green’s functions method, the initial first boundary value problem for a semilinear elliptic equation is replaced by the equivalent Hammerstein integral equation. The integral equation is represented in the form of a nonlinear operator equation with a heterotone operator and is considered in the space of continuous functions, which is semi-ordered using the cone of nonnegative functions. As a solution (generalized) of the boundary value problem, it was taken the solution of the equivalent integral equation. For a heterotone operator, a strongly invariant cone segment is found, the ends of which are the initial approximations for two iteration sequences. The first of these iterative sequences is monotonically increasing and approximates the desired solution to the boundary value problem from below, and the second is monotonically decreasing and approximates it from above. Conditions for the existence of a unique positive solution of the considered Dirichlet problem and two-sided convergence of successive approximations to it are given. General guidelines for constructing a strongly invariant cone segment are also given. The method developed has a simple computational implementation and a posteriori error estimate that is convenient for use in practice.&nbsp;</p> <p>Results. The method developed was programmed and studied when solving test problems. The results of the computational experiment are illustrated with graphical and tabular informations.</p> <p>Conclusions. The experiments carried out have confirmed the efficiency and effectiveness of the developed method and make it possible to recommend it for practical use in solving problems of mathematical modeling of nonlinear processes. Prospects for further research may consist the development of two-sided methods for solving problems for systems of partial differential equations, partial differential equations of higher orders and nonstationary multidimensional problems, using semi-discrete methods (for example, the Rothe’s method of lines).</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 Н. В. Гибкіна, С. М. Ламтюгова, М. В. Сидоров http://ric.zntu.edu.ua/article/view/241727 THE RUNTIME ANALYSIS OF COMPUTATION OF MODULAR EXPONENTIATION 2021-10-06T13:25:29+03:00 I. Prots’ko rvv@zntu.edu.ua N. Kryvinska rvv@zntu.edu.ua O. Gryshchuk rvv@zntu.edu.ua <p>Context. Providing the problem of fast calculation of the modular exponentiation requires the development of effective algorithmic methods using the latest information technologies. Fast computations of the modular exponentiation are extremely necessary for efficient computations in theoretical-numerical transforms, for provide high crypto capability of information data and in many other applications.</p> <p>Objective – the runtime analysis of software functions for computation of modular exponentiation of the developed programs based on parallel organization of computation with using multithreading.</p> <p>Method. Modular exponentiation is implemented using a 2k-ary sliding window algorithm, where k is chosen according to the size of the exponent. Parallelization of computation consists in using the calculation of the remainders of numbers raised to the power of 2i modulo, and their further parallel multiplications modulo.</p> <p>Results. Comparison of the runtimes of three variants of functions for computing the modular exponentiation is performed. In the algorithm of parallel organization of computation with using multithreading provide faster computation of modular exponentiation for exponent values larger than 1K binary digits compared to the function of modular exponentiation of the MPIR library. The MPIR library with an integer data type with the number of binary digits from 256 to 2048 bits is used to develop an algorithm for computing the modular exponentiation with using multithreading.</p> <p>Conclusions. In the work has been considered and analysed the developed software implementation of the computation of modular exponentiation on universal computer systems. One of the ways to implement the speedup of computing modular exponentiation is developing algorithms that can use multithreading technology on multi-cores microprocessors. The multithreading software implementation of modular exponentiation with increasing from 1024 the number of binary digit of exponent shows an improvement of computation time with comparison with the function of modular exponentiation of the MPIR library.</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 І. Процько, Н. Кривінська, О. Грищук http://ric.zntu.edu.ua/article/view/241738 COMPARISON OF TWO FORMS OF ERLANGIAN DISTRIBUTION LAW IN QUEUING THEORY 2021-10-06T14:01:51+03:00 V. N. Tarasov rvv@zntu.edu.ua <p>Context. For modeling various data transmission systems, queuing systems G/G/1 are in demand, this is especially important because there is no final solution for them in the general case. The problem of the derivation in closed form of the solution for the average waiting time in the queue for ordinary system with erlangian input distributions of the second order and for the same system with shifted to the right distributions is considered.</p> <p>Objective. Obtaining a solution for the main system characteristic – the average waiting time for queue requirements for three types of queuing systems of type G/G/1 with usual and shifted erlangian input distributions.</p> <p>Method. To solve this problem, we used the classical method of spectral decomposition of the solution of Lindley integral equation, which allows one to obtain a solution for average the waiting time for systems under consideration in a closed form. For the practical application of the results obtained, the well-known method of moments of the theory of probability was used.</p> <p>Results. For the first time, spectral expansions of the solution of the Lindley integral equation for systems with ordinary and shifted Erlang distributions are obtained, with the help of which the calculation formulas for the average waiting time in the queue for the above systems in closed form are derived.</p> <p>Conclusions. The difference between the usual and normalized distribution is that the normalized distribution has a mathematical expectation independent of the order of the distribution k, therefore, the normalized and normal Erlang distributions differ in numerical characteristics. The introduction of the time shift parameter in the laws of input flow distribution and service time for the systems under consideration turns them into systems with a delay with a shorter waiting time. This is because the time shift operation reduces the coefficient of variation in the intervals between the receipts of the requirements and their service time, and as is known from queuing theory, the average wait time of requirements is related to these coefficients of variation by a quadratic dependence. The system with usual erlangian input distributions of the second order is applicable only at a certain point value of the coefficients of variation of the intervals between the receipts of the requirements and their service time. The same system with shifted distributions allows us to operate with interval values of coefficients of variations, which expands the scope of these systems. This approach allows us to calculate the average delay for these systems in mathematical packages for a wide range of traffic parameters.</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 V. N. Tarasov http://ric.zntu.edu.ua/article/view/241744 MODELING OF ASYMPTOTICALLY OPTIMAL PIECEWISE LINEAR INTERPOLATION OF PLANE PARAMETRIC CURVES 2021-10-06T14:26:30+03:00 О. V. Frolov rvv@zntu.edu.ua M. U. Losev rvv@zntu.edu.ua <p>Context. Piecewise linear approximation of curves has a large number of applications in computer algorithms, as the reconstruction of objects of complex shapes on monitors, CNC machines and 3D printers. In many cases, it is required to have the smallest number of segments for a given accuracy.</p> <p>Objective. The objective of this paper is to improve the method of asymptotically optimal piecewise linear interpolation of plane parametric curves. This improvement is based to research influence of the method parameters and algorithms to distributions of approximation errors.</p> <p>Method. An asymptotically optimal method of curves interpolation is satisfied to the condition of minimum number of approximation units. Algorithms for obtaining the values of the sequence of approximation nodes are suggested. This algorithm is based on numerical integration of the nodes regulator function with linear and spline interpolation of its values. The method of estimating the results of the curve approximation based on statistical processing of line segments sequence of relative errors is substantiated. Modeling of real curves approximation is carried out and influence of the sampling degree of integral function – the nodes regulator on distribution parameters of errors is studied. The influence is depending on a method of integral function interpolation.</p> <p>Results. Research allows to define necessary the number of discretization nodes of the integral function in practical applications. There have been established that with enough sampling points the variance of the error’s distribution stabilizes and further increasing this number does not significantly increase the accuracy of the curve approximation. In the case of spline interpolation of the integral function, the values of the distribution parameters stabilized much faster, which allows to reduce the number of initial sampling nodes by 5–6 times having similar accuracy.</p> <p>Conclusions. Modelling of convex planar parametric curves reconstruction by an asymptotically optimal linear interpolation algorithm showed acceptable results without exceeding the maximum errors limit in cases of a sufficient discretization of the integral function. The prospect of further research is to reduce the computational complexity when calculating the values of the integral distribution function by numerical methods, and to use discrete analogues of derivatives in the expression of this function.</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 О. В. Фролов, М. Ю. Лосєв http://ric.zntu.edu.ua/article/view/241754 VECTOR-DRIVEN LOGIC AND STRUCTURE FOR TESTING AND DEDUCTIVE FAULT SIMULATION 2021-10-06T14:57:25+03:00 A. Hahanova rvv@zntu.edu.ua V. Hahanov rvv@zntu.edu.ua S. Chumachenko rvv@zntu.edu.ua E. Litvinova rvv@zntu.edu.ua D. Rakhlis rvv@zntu.edu.ua <p>Context. It is known that data structures are decisive for the creation of efficient parallel algorithms and high-performance computing devices. Therefore, the development of mathematically perfect and technologically simple data structures takes about 80 percent of the design time, when about 20 percent of time and material resources are spent on algorithms and their hardware-software coding. This lead to search for such primitives of data structures that will significantly simplify the parallel high-performance algorithms which are working on them. Models and methods for testing and simulation of digital systems are proposed, which containing certain advantages of quantum computing in terms of implementation of vector qubit data structures in technology of classical computational processes.</p> <p>Objective. The goal of the work is development of an innovative technology for qubit-vector synthesis and deductive analysis of tests for their verification based on vector data structures that greatly simplify algorithms that can be embedded as BIST components in digital systems on chips.</p> <p>Method. The deductive faults simulation is used to obtain analytical expressions focused on transporting fault lists through a functional or logical element based on the xor-operation, which serves as a measure of similarity-difference between a test, a function and faults which is specified in the same way in one of the formats − a table, graph, equation. A binary vector is proposed as the most technologically advanced primitive of data structures for setting logical functionality for the purpose of parallel synthesis and analysis of digital systems. The parallelism of solving combinatorial problems is a physical property of quantum computing, which in classical computing, for parallel simulation and faults diagnostics, is provided by unitary-coded data structures due to excess memory.</p> <p>Results. 1) A method of analytical synthesis of deductive logic for functional elements on the gate level and register transfer level has been developed. 2) A deductive processor for faults simulation based on transporting input lists or faults vectors to external outputs of digital circuits was proposed. 3) The qubit-vector form of logic setting and methods of qubit synthesis of deductive equations for faults simulation were described. 4) A qubit-vector method for the tests’ synthesis which is using derivatives calculated by vector coverage of logic has been developed. 5) Models and methods verification is performed on test examples in the software implementation of structures and algorithms.</p> <p>Conclusions. The scientific novelty lies in the new paradigm of the technology for the synthesis of deductive RTL logic based on metric test equation, which forms the. A vector form for structures description is introduced, which makes it possible to apply wellknown technologies for the synthesis and analysis of logical circuits tests to effectively solve the problems of graph structures testing and state machine models of digital devices. The practical significance is reflected in the examples of analytical synthesis of deductive logic for functional elements on gate level and register transfer level. A deductive processor for faults simulation which is focused on implementation as a BIST tool, which is used in online testing, simulation and fault diagnosis for digital systems on chips is proposed. A qubit-vector form of the digital systems description is proposed, which surpasses the existing methods of computing devices development in terms of the metric: manufacturability, compactness, speed and quality. A software application has been developed that implements the main testing, simulation and diagnostics services which are used in the educational process to study the advantages of qubit-vector data structures and algorithms. The computational complexity of synthesis processes and deductive formulas for logic and their usage in fault simulation are given.</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 А. В. Хаханова, В. І. Хаханов, С. В. Чумаченко, Є. І. Литвинова, Д. Ю. Рахліс http://ric.zntu.edu.ua/article/view/241582 ANALYSIS OF INDICATORS OF ELECTROMAGNETIC COMPATIBILITY OF COMMUNICATION NETWORKS 5 G 2021-10-05T11:36:39+03:00 Yu. Yu. Kolyadenko rvv@zntu.edu.ua N. A. Chursanov rvv@zntu.edu.ua <p>Context. The next generation 5G / IMT-2020 technology, like any new technology, brings its own specific features to all aspects of the practice of its application. One of these particularly important aspects is electromagnetic compatibility. At the stage of preparation for the introduction of 5G radio networks, it is necessary to take early measures to effectively assess the EMC conditions for these networks based on a thorough analysis of the features of 5G technology, and by correctly and accurately assessing these conditions, successfully ensure the electromagnetic compatibility of radio equipment of new networks.</p> <p>Objective. The purpose of this work is to analyze the electromagnetic compatibility of the 5G communication network.</p> <p>Method. An analysis of the main features of the 5G radio interface provides an indication of the expected features of the EMC assessment procedures for these networks. These features mainly relate to taking into account the total interference from the network with its special architecture and dynamics of changes, the choice of new loss models (channel models) for spatially distributed radiation of multidimensional MIMO antennas and a heterogeneous signal propagation medium, as well as taking into account the spectral properties of new signal shapes and character radiation with new non-orthogonal radio access methods.<br />For EMC analysis, a model of signal attenuation in millimeter-wave radio channels was used, taking into account attenuation of radio waves in free space; loss of energy of radio waves when propagating through rains; attenuation of a millimeter wave signal when propagating through the leaves of trees; attenuation of signals when passing through dense obstacles (buildings, structures, etc.).</p> <p>Results. The analysis of attenuation of the millimeter-wave signal in free space from the intensity of precipitation is carried out at various values of optical visibility. The analysis of the attenuation of the millimeter-wave signal from the distance when the signal propagates through obstacles in the form of walls at various values of the wall thickness is carried out. The analysis of the attenuation of the millimeter-wave signal from the depth of the leaf layer is carried out; it covers the signal propagation at different values of the carrier frequency. The analysis of the value of the power of the millimeter-wave signal at the input of the receiver on the intensity of precipitation is carried out at various values of optical visibility. The analysis of the value of the power of the millimeter-wave signal at the input of the receiver versus the distance when the signal propagates through obstacles in the form of walls at various values of the wall thickness is carried out. The analysis of the power value of the millimeter-wave signal at the receiver input from the depth of the leaf layer is carried out, overlaps the signal propagation at various values of the carrier frequency.</p> <p>Conclusions. The conducted studies of EMC indicators allow us to give recommendations on the application of 5G technology in specific practical situations.</p> 2021-10-05T00:00:00+03:00 Copyright (c) 2021 Ю. Ю. Коляденко, М. О. Чурсанов http://ric.zntu.edu.ua/article/view/241604 USE OF ADAPTIVE ANTENNA ARRAYS FOR INCREASE THE THROUGHPUT IN LTE-A 2021-10-05T14:32:30+03:00 D. O. Makoveenko rvv@zntu.edu.ua S. V. Siden rvv@zntu.edu.ua V. V. Pyliavskyi rvv@zntu.edu.ua <p>Context. The aim of the article is to analyze the throughput of the LTE-A mobile network on the uplink using an adaptive linear equidistant antenna array.</p> <p>Objective. Suggestions have been made for the possibility of using adaptive antenna arrays to increase bandwidth in LTE-A mobile networks and analyze the benefits of its use compared to the standard type of base station antenna</p> <p>Method. To achieve this result, a computer model of noise analysis of the mobile network in the form of a flat regular hexagonal antenna array consisting of 7 three-sector cells was developed. To estimate the benefit from the use of adaptive antenna arrays, two options were analyzed: when using a standard antenna array of the LTE-A network, and an adaptive linear equidistant antenna array. During the simulation, 100 random placements of subscribers of useful and interference signals were performed and the minimum, maximum and average gain from the use of adaptive antenna arrays was calculated. The average value of the gain for the adaptive antenna array in the direction of the subscriber station, which generates a useful signal of 5.69 dB more than the standard antenna array of the LTE-A network. At the same time, there is a significant reduction in the gain of the adaptive antenna in the direction of the interference subscriber stations, namely, for those with the highest interference level, the gain is 32.84 dB and 28.33 dB, respectively. To clearly show the gain in the qualitative characteristics of the network, a bandwidth analysis was performed for different types of antennas. The bandwidth distribution (transport block size) for 50 resource blocks using an adaptive equidistant linear antenna array compared to a standard antenna array is presented.</p> <p>Results. It is shown that due to the use of adaptive antenna systems, the average bandwidth increases from 11 Mbit/s to 35 Mbit / s for all types of distribution considered channels.</p> <p>Conclusions. The article proposes the use of adaptive antenna arrays to increase the bandwidth of the LTE-A network. The simulation of bandwidth for 50 resource blocks showed that in the presence of internal system interference when using standard antennas of base stations, the average bandwidth is from 11.2 Mbps to 12.3 Mbps. At the same time, due to the use of adaptive antenna systems, the average bandwidth increases from 11 Mbit/s to 35 Mbit/s for all types of multipath channels considered.</p> 2021-10-06T00:00:00+03:00 Copyright (c) 2021 D. O. Makoveenko, S. V. Siden, V. V. Pyliavskyi http://ric.zntu.edu.ua/article/view/241887 INFORMATION TECHNOLOGY FOR INTERNET RESOURCES PROMOTION IN SEARCH SYSTEMS BASED ON CONTENT ANALYSIS OF WEB-PAGE KEYWORDS 2021-10-07T18:52:10+03:00 V. Vysotska rvv@zntu.edu.ua <p>Context. Timely and correct analysis of the process of visiting Internet resources, which led to the overall conversion of e-business, is fundamental and relevant for successfully managing the website. Appropriate, accurate traffic analysis, which brings both successful and unsuccessful conversions, will identify the cause of the impact on conversion metrics and criteria and will measure the effectiveness of changes made to the site to increase traffic conversions. It is necessary to collect information on the activities of system users on the website and determine specific performance indicators of the website to improve e-business strategy further to solve these problems and achieve the relevant goals of e-commerce. Thus, it is necessary to develop and implement an analytical method of text content support for e-commerce Internet resources based on the analysis of key performance indicators of the website, paying particular attention to determining the set of relevant and relevant keywords used by regular users and led to an increase in e-business conversions.</p> <p>Objective of the study is to develop a technology for promoting Internet resources of e-commerce based on the results of Web-analytics of critical indicators of pages as KPI and KSI through forming a relevant set of keywords as feedback activity of a regular audience.</p> <p>Method. An analytical method for promoting Internet resources based on the analysis of key performance indicators of the website, which is based on three main algorithms аlgorithm for identifying problem areas of the site structure for further optimization, аlgorithm for optimizing search engine marketing activities (SEM), аlgorithm for site promotion and calculation of its efficiency.</p> <p>General recommendations for the design of information resources processing systems have been developed, different from the existing ones, by the presence of additional modules that significantly affect promoting the website on the Internet to further the success of ecommerce or improve the values of these indicators. Among them is the module of online shopping, marketing, module-copywriter and Web-master. For each of them, calculate their own KRI. It will allow you to effectively implement the processing of information resources at the level of system developers (reducing resources and time for development, improving the quality of information processing systems).</p> <p>Results. The paper develops and describes in detail, based on the results of Web-analytics, the parameters and criteria for assessing the level of success of e-business. Software tools for monitoring the textual content of Internet resources based on the analysis of key performance indicators of the website have also been developed. For a detailed analysis of the functioning and promotion of Internet ecommerce systems such as Internet newspaper and Internet magazine, 12 different methods have been developed and implemented, respectively, with support for each of them with a different number of stages of the content life cycle. A computer experiment of analysis of key performance indicators of the website was conducted. The service of keeping statistics of visits to the Web resource allows you to estimate the increase in sales of textual content in direct proportion to the rise in the number of visits to the Web resource, the number of regular users, the prospects of marketing activities.</p> <p>Conclusions. It was found that the presence of appropriate modules in the systems of information resources processing increases the sales of textual content to the regular user by 9%, active involvement of unique visitors, potential users and expanding the target and regional audience by 11%, viewed pages by 12%, resources by 7%.</p> 2021-10-07T00:00:00+03:00 Copyright (c) 2021 В. А. Висоцька http://ric.zntu.edu.ua/article/view/241959 AUTOMATIC DETERMINATION OF THE NAVIGATORS MOTIVATION MODEL WHEN OPERATING WATER TRANSPORT 2021-10-08T15:03:55+03:00 P. S. Nosov rvv@zntu.edu.ua I. S. Popovych rvv@zntu.edu.ua S. M. Zinchenko rvv@zntu.edu.ua V. M. Kobets rvv@zntu.edu.ua A. F. Safonova rvv@zntu.edu.ua E. S. Appazov rvv@zntu.edu.ua <p>Context. The article proposes an approach for automated identification of the&nbsp; navigators motivational model in the control of water transport. Algorithms for data extraction as a result of the man-machine interaction of navigator with the electronic control systems of the vessel during performing navigation operations of increased complexity are proposed.</p> <p>Objective. The purpose of research is to apply formal and algorithmic approaches to extracting data on the motivational model of navigator to prevent accidents in water transport.&nbsp;</p> <p>Method. The identification of manifestation determination of navigators’ mental activity by means of the visual concept of the geometric group theory is proposed. This approach delivered the visual systematic-logical combining of diagnostic methods aimed at determining navigators motivational centers and the processes of professional activity like maneuver performing. The key indicator of identification is said to be the parameter of the navigator’s activity as “rpm_port” having an impact on the vessel speed being a marker of intensification of the navigator’s physiological activity. Such an approach is beneficial in time phase identification while maneuvering indicating explicitly at the stepping up of the navigator’s physiological motivational state. It was proven to be correct based on the results due to Ward’s dendrogram, several statistical methods and applied software. The obtained research results encourage the prediction of the navigator’ motivational states in critical situations.</p> <p>Results. In order to confirm the proposed formal-algorithmic approach, an experiment was carried out using the navigation simulator Navi Trainer 5000. Automated analysis of experimental ones made it possible to form a motivational map of the navigator and determine the decision-making model affecting in the processes of&nbsp; control vessel in difficult situations.</p> <p>Conclusions. The proposed research approaches made it possible to automate the processes of extracting data indicating the principles of decision-making by navigator. The effectiveness of proposed approach was substantiated by the results of experimental data automated processing and the constructed tree-like decision-making spaces.</p> 2021-10-08T00:00:00+03:00 Copyright (c) 2021 P. S. Nosov, I. S. Popovych, S. M. Zinchenko, V. M. Kobets, A. F. Safonova, E. S. Appazov http://ric.zntu.edu.ua/article/view/241994 MULTI-AGENT LATENT SEMANTIC INTERNET TECHNOLOGY FOR THE FORMATION OF A SUBJECT-ORIENTED KNOWLEDGE MODEL 2021-10-09T10:37:08+03:00 A. A. Stenin rvv@zntu.edu.ua V. P. Pasko rvv@zntu.edu.ua M. A. Soldatova rvv@zntu.edu.ua I. G. Drozdovich rvv@zntu.edu.ua <p>Context. The article proposes a latent-semantic technology for extracting information from Internet resources, which allows processing information in natural language, as well as a multi-agent search algorithm based on it. The relevance of this approach to the search for subject-oriented information determined by the fact that currently a direct lexical comparison of queries with document indexes does not fully satisfy the developer. The object of the study is a multi-agent latent-semantic algorithm for searching for subject-oriented information.&nbsp;</p> <p>Objective.&nbsp; The work is to increase the efficiency of forming a knowledge model that is adequate for this subject area.</p> <p>Method. A latent semantic technology based on the weighted descriptor method developed by the authors is proposed. The main difference from the existing methods is that the analysis of words occurring in the text both in frequency and taking into account semantics carried out by selecting the appropriate descriptors, which improves the quality of the information found.</p> <p>Results. The developed latent-semantic technology of information search tested in the task of constructing a knowledge model of automated decision support systems for operational and dispatching control of urban engineering networks. The conducted modeling of the search for subject-oriented information in this subject area showed the effectiveness of the developed approach.</p> <p>Conclusions. Improving the efficiency of search and semantic content of subject-oriented information of the knowledge model of this subject area achieved by using the weighted descriptor method based on Zipf’s laws in this technology. The prospects for further research are to build evolutionary models of knowledge and improve the quality of updated information. </p> 2021-10-09T00:00:00+03:00 Copyright (c) 2021 A. A. Stenin, V. P. Pasko, M. A. Soldatova, I. G. Drozdovich http://ric.zntu.edu.ua/article/view/241784 THE METHOD OF STRUCTURAL ADJUSTMENT OF NEURAL NETWORK MODELS TO ENSURE INTERPRETATION 2021-10-07T09:10:36+03:00 S. D. Leoshchenko rvv@zntu.edu.ua A. O. Oliinyk rvv@zntu.edu.ua S. A. Subbotin rvv@zntu.edu.ua Ye. O. Gofman rvv@zntu.edu.ua O. V. Korniienko rvv@zntu.edu.ua <p>Context. The problem of structural modification of pre-synthesized models based on artificial neural networks to ensure the property of interpretation when working with big data is considered. The object of the study is the process of structural modification of artificial neural networks using adaptive mechanisms.</p> <p>Objective of the work is to develop a method for structural modification of neural networks to increase their speed and reduce resource consumption when processing big data.</p> <p>Method. A method of structural adjustment of neural networks based on adaptive mechanisms borrowed from neuroevolutionary synthesis methods is proposed. At the beginning, the method uses a system of indicators to evaluate the existing structure of an artificial neural network. The assessment is based on the structural features of neuromodels. Then the obtained indicator estimates are compared with the criteria values for choosing the type of structural changes. Variants of mutational changes from the group of methods of neuroevolutionary modification of the topology and weights of the neural network are used as variants of structural change. The method allows to reduce the resource intensity during the operation of neuromodels, by accelerating the processing of big data, which expands the field of practical application of artificial neural networks.</p> <p>Results. The developed method is implemented and investigated by the example of using a recurrent artificial network of the long short-term memory type when solving the classification problem. The use of the developed method allowed speed up of the neuromodel with a test sample by 25.05%, depending on the computing resources used.</p> <p>Conclusions. The conducted experiments confirmed the operability of the proposed mathematical software and allow us to recommend it for use in practice in the structural adjustment of pre-synthesized neuromodels for further solving problems of diagnosis, forecasting, evaluation and pattern recognition using big data. The prospects for further research may consist in a more fine-tuning of the indicator system to determine the connections encoding noisy data in order to further improve the accuracy of models based on neural networks.</p> 2021-10-07T00:00:00+03:00 Copyright (c) 2021 S. D. Leoshchenko, A. O. Oliinyk, S. A. Subbotin, Ye. O. Gofman, O. V. Korniienko http://ric.zntu.edu.ua/article/view/241815 A MODEL AND TRAINING METHOD FOR CONTEXT CLASSIFICATION IN CCTV SEWER INSPECTION VIDEO FRAMES 2021-10-07T11:31:14+03:00 V. V. Moskalenko rvv@zntu.edu.ua M. O. Zaretsky rvv@zntu.edu.ua A. S. Moskalenko rvv@zntu.edu.ua A. O. Panych rvv@zntu.edu.ua V. V. Lysyuk rvv@zntu.edu.ua <p>Context. A model and training method for observational context classification in CCTV sewer inspection vide frames was developed and researched. The object of research is the process of detection of temporal-spatial context during CCTV sewer inspections. The subjects of the research are machine learning model and training method for classification analysis of CCTV video sequences under the limited and imbalanced training dataset constraint.</p> <p>Objective. Stated research goal is to develop an efficient context classifier model and training algorithm for CCTV sewer inspection video frames under the constraint of the limited and imbalanced labeled training set.</p> <p>Methods. The four-stage training algorithm of the classifier is proposed. The first stage involves training with soft triplet loss and regularisation component which penalises the network’s binary output code rounding error. The next stage is needed to determine the binary code for each class according to the principles of error-correcting output codes with accounting for intra- and interclass relationship. The resulting reference vector for each class is then used as a sample label for the future training with Joint Binary Cross Entropy Loss. The last machine learning stage is related to decision rule parameter optimization according to the information criteria to determine the boundaries of deviation of binary representation of observations for each class from the corresponding reference vector. A 2D convolutional frame feature extractor combined with the temporal network for inter-frame dependency analysis is considered. Variants with 1D Dilated Regular Convolutional Network, 1D Dilated Causal Convolutional Network, LSTM Network, GRU Network are considered. Model efficiency comparison is made on the basis of micro averaged F1 score calculated on the test dataset.</p> <p>Results. Results obtained on the dataset provided by Ace Pipe Cleaning, Inc confirm the suitability of the model and method for practical use, the resulting accuracy equals 92%. Comparison of the training outcome with the proposed method against the conventional methods indicated a 4% advantage in micro averaged F1 score. Further analysis of the confusion matrix had shown that the most significant increase in accuracy in comparison with the conventional methods is achieved for complex classes which combine both camera orientation and the sewer pipe construction features.</p> <p>Conclusions. The scientific novelty of the work lies in the new models and methods of classification analysis of the temporalspatial context when automating CCTV sewer inspections under imbalanced and limited training dataset conditions. Training results obtained with the proposed method were compared with the results obtained with the conventional method. The proposed method showed 4% advantage in micro averaged F1 score.</p> <p>It had been empirically proven that the use of the regular convolutional temporal network architecture is the most efficient in utilizing inter-frame dependencies. Resulting accuracy is suitable for practical use, as the additional error correction can be made by using the odometer data.</p> 2021-10-07T00:00:00+03:00 Copyright (c) 2021 V. V. Moskalenko, M. O. Zaretsky, A. S. Moskalenko, A. O. Panych, V. V. Lysyuk http://ric.zntu.edu.ua/article/view/241829 PROBLEM OF A DISCRETE DATA ARRAY APPROXIMATION BY A SET OF ELEMENTARY GEOMETRIC ALGORITHMS 2021-10-07T13:42:34+03:00 I. F. Povkhan rvv@zntu.edu.ua O. V. Mitsa rvv@zntu.edu.ua O. Y. Mulesa rvv@zntu.edu.ua O. O. Melnyk rvv@zntu.edu.ua <p>Context. In this paper, a problem of a discrete data array approximation by a set of elementary geometric algorithms and a recognition model representation in a form of algorithmic classification tree has been solved. The object of the present study is a concept of a classification tree in a form of an algorithm trees. The subject of this study are the relevant models, methods, algorithms and schemes of different classification tree construction.&nbsp;</p> <p>Objective. The goal of this work is to create a simple and efficient method and algorithmic scheme of building the tree-like recognition and classification models on the basis of the algorithm trees for training selections of large-volume discrete information characterized by a modular structure of independent recognition algorithms assessed in accordance with the initial training selection data for a wide class of applied tasks.&nbsp;</p> <p>Method. A scheme of classification tree (algorithm tree) synthesis has been suggested being based on the data array approximation by a set of elementary geometric algorithms that constructs a tree-like structure (the ACT model) for a preset initial training selection of arbitrary size. The latter consists of a set of autonomous classification/recognition algorithms assessed at each step of the ACT construction according to the initial selection. A method of the algorithmic classification tree construction has been developed with the basic idea of step-by-step arbitrary-volume and structure initial selection approximation by a set of elementary geometric classification algorithms. When forming a current algorithm tree vertex, node and generalized attribute, this method provides alignment of the most effective and high-quality elementary classification algorithms from the initial set and complete construction of only those paths in the ACT structure, where the most of classification errors occur. The scheme of synthesizing the resulting classification tree and the ACT model developed allows one to reduce considerably the tree size and complexity. The ACT construction structural complexity is being assessed on the basis of a number of transitions, vertices and tiers of the ACT structure that allows the quality of its further analysis to be increased, the efficient decomposition mechanism to be provided and the ACT structure to be built in conditions of fixed limitation sets. The algorithm tree synthesis method allows one to construct different-type tree-like recognition models with various sets of elementary classifiers at the preset accuracy for a wide class of artificial intelligence theory problems.&nbsp;</p> <p>Results. The method of discrete training selection approximation by a set of elementary geometric algorithms developed and presented in this work has received program realization and was studied and compared with those of logical tree classification on the basis of elementary attribute selection for solving the real geological data recognition problem.&nbsp;</p> <p>Conclusions. Both general analysis and experiments carried out in this work confirmed capability of developed mechanism of constructing the algorithm tree structures and demonstrate possibility of its promising use for solving a wide spectrum of applied recognition and classification problems. The outlooks of the further studies and approbations might be related to creating the othertype algorithmic classification tree methods with other initial sets of elementary classifiers, optimizing its program realizations, as well experimental studying this method for a wider circle of applied problems.</p> 2021-10-07T00:00:00+03:00 Copyright (c) 2021 I. F. Povkhan, O. V. Mitsa, O. Y. Mulesa, O. O. Melnyk http://ric.zntu.edu.ua/article/view/241880 AN INTELLIGENT MODEL BASED ON DEEP TRANSFER LEARNING FOR DETECTING ANOMALIES IN CYBER-PHYSICAL SYSTEMS 2021-10-07T17:49:54+03:00 L. V. Sukhostat rvv@zntu.edu.ua <p>Context. The problem of detecting anomalies from signals of cyber-physical systems based on spectrogram and scalogram images is considered. The object of the research is complex industrial equipment with heterogeneous sensory systems of different nature.&nbsp;</p> <p>Objective. The goal of the work is the development of a method for signal anomalies detection based on transfer learning with the extreme gradient boosting algorithm.</p> <p>Method. An approach based on transfer learning and the extreme gradient boosting algorithm, developed for detecting anomalies in acoustic signals of cyber-physical systems, is proposed. Little research has been done in this area, and therefore various pre-trained deep neural model architectures have been studied to improve anomaly detection. Transfer learning uses weights from a deep neural model, pre-trained on a large dataset, and can be applied to a small dataset to provide convergence without overfitting. The classic approach to this problem usually involves signal processing techniques that extract valuable information from sensor data. This paper performs an anomaly detection task using a deep learning architecture to work with acoustic signals that are preprocessed to produce a spectrogram and scalogram. The SPOCU activation function was considered to improve the accuracy of the proposed approach. The extreme gradient boosting algorithm was used because it has high performance and requires little computational resources during the training phase. This algorithm can significantly improve the detection of anomalies in industrial equipment signals.</p> <p>Results. The developed approach is implemented in software and evaluated for the anomaly detection task in acoustic signals of cyber-physical systems on the MIMII dataset.</p> <p>Conclusions. The conducted experiments have confirmed the efficiency of the proposed approach and allow recommending it for practical use in diagnosing the state of industrial equipment. Prospects for further research may lie in the application of ensemble approaches based on transfer learning to various real datasets to improve the performance and fault-tolerance of cyber-physical systems.</p> 2021-10-07T00:00:00+03:00 Copyright (c) 2021 L. V. Sukhostat