http://ric.zntu.edu.ua/issue/feedRadio Electronics, Computer Science, Control2019-01-18T11:14:05+02:00Сергій Олександрович Субботінsubbotin.csit@gmail.comOpen Journal Systems<p dir="ltr" align="justify"><span><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 <span lang="EN">r</span><span lang="RU">eviews (works containing analysis and reasoned assessment </span><span lang="EN">of </span><span lang="RU">the author's original or </span><span lang="EN">published </span><span lang="RU">book)</span> 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" lang="en"><span class="hps"><br /> </span></span><strong>Founder and </strong></span><strong><span>Publisher</span></strong><span><strong>:</strong> <a href="http://zntu.edu.ua/zaporozhye-national-technical-university">Zaporizhzhya National Technical University</a><span lang="uk">.</span> </span><strong><span>Country:</span></strong><span> Ukraine<span lang="uk">.</span><span id="result_box1" lang="en"><span class="hps"><br /> </span></span><strong>ISSN</strong> 1607-3274 (print), ISSN 2313-688X (on-line).<span id="result_box3" lang="en"><span class="hps"><br /> </span></span><strong>Certificate of State Registration:</strong> КВ №6904</span><span lang="uk">. </span><span>The journal was registered by the State Committee for information policy, television and radio broadcasting of Ukraine in 29.01.2003.<span id="result_box4" lang="en"><span class="hps"><br /> </span></span>In accordance with the decision of the <span lang="en-us">P</span>residium of All-Ukrainian Certification Commission (<span lang="uk">№ </span>1-05/4 dated 05.26.2010<span lang="uk">) </span>the journal <span lang="en-us">"Radio Electronics, Computer Science, Control" was included </span>in the <strong>List of the <span lang="en-us">scientific specialized periodicals of </span>Ukrain<span lang="en-us">e</span></strong> where <span lang="en-us">the results of dissertations for PhD and D. Sc. </span>in <span lang="en-us">Technical Sciences</span>, Physics and Mathematics (with specialization in Radiophysics) may be published.</span><span><span id="result_box25" lang="en"><span class="hps"><br /> </span></span><span id="result_box26" lang="en"><span class="hps">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></span><span id="result_box27" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Year of Foundation:</span></strong><span> 1999. </span><strong><span>Frequency :</span></strong><span> 4 times per year (before 2015 - 2 times per year).<span id="result_box6" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Volume</span></strong><span><strong>:</strong> up to 20 conventional printed sheets. </span><strong><span>Format:</span></strong><span> 60x84/8. <span id="result_box7" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Languages:</span></strong><span> English, Russian, Ukrainian.<span id="result_box8" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Fields of Science :</span></strong><span> Physics and Mathematics, Technical Sciences.<span id="result_box9" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Aim: </span></strong><span>serve to the academic community principally at publishing topical articles resulting from original research whether theoretical or applied in various aspects of academic endeavour<span lang="ru">.</span></span><span><strong><br /> </strong></span><strong> <span>Focus:</span></strong><span> 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 /> <span> <strong>Scope:</strong></span> radio physics, micro-, nano- and radio electronics, computer hardware and software, computer networks and telecommunications, algorithm and programming theory, optimization and operations research, machine-machine and man-machine interfacing, mathematical modeling and computer simulation, data and signal processing, control in technical systems, artificial intelligence, including knowledge-based and expert systems, data mining, pattern recognition, artificial neural and neuro-fuzzy networks, fuzzy logics, swarm intelligence and multiagent systems, hybrid systems.</span><span><strong><br /> </strong></span> <span> <strong><span> Journal sections:</span></strong><span><span id="result_box10" lang="en"><span class="hps"><br /> </span></span></span></span> <span> - radiophysics;<span id="result_box11" lang="en"><span class="hps"><br /> </span></span>- radio electronics and telecommunications;<span id="result_box12" lang="en"><span class="hps"><br /> </span></span>- mathematical and computer modelling;<span id="result_box13" lang="en"><span class="hps"><br /> </span></span>- neuroinformatics and intelligent systems;<span id="result_box14" lang="en"><span class="hps"><br /> </span></span>- progressive information technologies;<span id="result_box15" lang="en"><span class="hps"><br /> </span></span>- theory and methods of automatic control;<span id="result_box16" lang="en"><span class="hps"><br /> </span></span>- control in technical systems.</span><span><span><span id="result_box17" lang="en"><span class="hps"><br /> </span></span><strong>Abstracting and Indexing:</strong> <strong>The journal is indexed in <a href="http://science.thomsonreuters.com/cgi-bin/jrnlst/jlresults.cgi?PC=MASTER&Full=Radio%20Electronics%20Computer%20Science%20Control" target="_blank">Thomson Reuters Web of Science</a></strong><span> (WoS) scientometric database</span><span>. </span> </span></span>The articles, published in the journal<span lang="en-us">,</span> are abstracted in leading international <span lang="en-us">and </span>national <strong>abstract<span lang="en-us">ig</span> journals</strong> and <strong>scientometric databases</strong>, and also are placed <span lang="en-us">to</span> the <strong>digital archives</strong> and <strong>libraries</strong> with free on-line<span lang="en-us"> access: Academic Keys, ACNP, ADAT, Akademik Dizin, ARDI, BASE, CiteFactor, CNKI, COPAC, CrossRref, DIIF, DOAJ, DOI, DRJI, EBSCO, eLibrary.ru, ETOC, Exlibris, EZB, GBV/GVK, GENERAL IMPACT FACTOR, GetInfo, GIF, Google Scholar, Impactfactor.pl, Index Copernicus, INSPEC, ISRA JIF, ISSN, JIFACTOR, Jour Informatics, Journalindex.net, JournalTOCs, Konferencii.ru, MIAR, OAIster, OAJI, Open Science Directory, Openaccessarticles, Openaire, Perechen-izdaniy.ru, PUBGET, Research Bible, ROAD, Scholar Steer, Sciary, SHERPA/RoMEO, SIS, SJIF, SJournals, SSM, UIF, WorldCat, WorldWideScience, ZDB, VINITI, Djerelo, UINC, Ukraininca Naukova, Ulrich’s Periodical Directory, Universia, URAN, V. I. Vernadsky National Library of Ukraine, and others which are listed and described <a href="/about/editorialPolicies#custom-0">here</a>.</span></p><p dir="ltr" align="justify"><span><span><strong>Editorial board: </strong><em>Editor in chief</em> - <span><span>S. A. Subbotin</span></span> , 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="/about/editorialTeam">here</a>.<span id="result_box19" lang="en"><span class="hps"><br /> </span></span><strong>Publishing and processing fee:</strong> Articles are published and peer-reviewed <strong>free of charge</strong>.<span id="result_box20" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Authors Copyright: </span></strong><span>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.<span id="result_box21" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Authors Responsibility:</span></strong><span> 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 submited 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" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Readership: </span></strong><span>scientists, university faculties, postgraduate and graduate students, practical specialists.<span id="result_box23" lang="en"><span class="hps"><br /> </span></span></span><strong> <span>Publicity and Accessing Method :</span></strong><span> <strong>Open Access</strong> on-line for full-text publications<span id="result_box24" lang="en"><span class="hps">.</span></span></span></span></p><p dir="ltr" align="justify"><span><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></span></p>http://ric.zntu.edu.ua/article/view/154464PRINCIPLES AND METHODS OF THE CALCULATION OF TRANSFER CHARACTERISTICS OF DISK PIEZOELECTRIC TRANSFORMERS2019-01-18T11:00:26+02:00C. V. BaziloBazilo@gmail.com<p>Context. Thanks to its unique properties piezoceramics has applications in various fields of engineering and technology. Disk piezoelectric devices are widely used in the elements of information systems. Research has shown that piezoelectric transformers can compete with traditional electromagnetic transformers on both efficiency and power density. The final goal of mathematical modeling of the vibrating piezoelectric elements physical condition is a qualitative and quantitative description of characteristics and<br />parameters of existing electrical and elastic fields.<br />Objective. The purpose of this paper is to set out the principles of mathematical models construction that are sufficiently adequate to real devices and occurring physical processes using the simplest example of axially symmetric radial oscillations of the piezoelectric disk.<br />Method. Mathematical models of piezoelectric transformers working with axially symmetric radial oscillations of piezoceramic disks are constructed with a minimal number of assumptions simplifying the real situation. This allows us to state that the proposed construction scheme delivers mathematical models that are sufficiently adequate to the real objects and physical processes that exist in them.<br />Results. Main results of this work can be formulated as follows: mathematical model of piezoelectric transformer with ring electrode in the primary electrical circuit is constructed; high sensitivity of frequency characteristic of piezoelectric transformer to the values of the output impedance of the electrical signal source in the primary electrical circuit is demonstrated.<br />Conclusions. As a result of research of real device’s mathematical model a set of geometrical, physical and mechanical and electrical parameters of a real object can be determined which provides realization of technical parameters of piezoelectric functional element specified in technical specifications. The cost of the saved resources is the commercial price of the mathematical model. Prospects for further research can be to build a mathematical model of a piezoelectric transformer with sector electrodes.</p>Copyright (c) 2019 C. V. Bazilohttp://ric.zntu.edu.ua/article/view/154468PATTERN ANALYSIS OF THE RECEIVING-TRANSMITTING CIRCULAR ARRAY WITH LOW SIDE LOBE LEVEL2019-01-18T11:00:30+02:00V. A. TiutiunnykTiutiunnyk@gmail.comA. S. DudushDudush@gmail.comA. D. FlorovFlorov@gmail.comI. N. TrofymovTrofymov@gmail.com<p>Context. A particular advantage of uniform circular arrays is the possibility of scanning the beam within 360° in azimuth without<br />distorting the characteristics of the directivity pattern only by changing the amplitude-phase distribution of the current on its elements.<br />This feature, combined with modern beamforming techniques and digital methods of beamforming opens the prospect of using<br />circular arrays in surveillance radars for military and civil purposes instead of antenna systems with mechanical rotation.<br />Objective. Investigation of the possibility of reducing the sidelobe level of a uniform circular transmit-receive array using known amplitude distributions used for linear arrays.<br />Methods. For the study, a phase-mode excitation technique is used in which an arbitrary excitation function of a uniform circular array is represented as a sum of phase excitation components (modes), and the circular array antenna pattern is a superposition of patterns produced by individual phase excitation modes. This technique makes it possible to apply for circular arrays the methods used to pattern synthesis and reduce the side lobe level in linear arrays due to the use of a special transformation matrix.<br />Results. An imitation mathematical model of a discrete uniform circular array has been developed that provides an opportunity to study the efficiency of using amplitude distributions, known for linear arrays, to reduce its side lobe level.<br />Conclusions. The computational experiments have confirmed the possibility of using the phase-mode excitation technique for a pattern synthesis with low sidelobe level in the uniform circular transmits-receive array. A variant of the practical application of the Dolph-Chebyshev amplitude distribution for the synthesis of a circular array pattern is shown.</p>Copyright (c) 2019 V. A. Tiutiunnyk, A. S. Dudush, A. D. Florov, I. N. Trofymovhttp://ric.zntu.edu.ua/article/view/154478VERIFICATION OF THE TRIANGULAR COMMUNICATION GRIDS PROTOCOLS BY INFINITE PETRI NETS2019-01-18T11:00:39+02:00T. R. ShmelevaShmeleva@gmail.com<p>Context. Computing and communication grids are a powerful means of increasing the performance and quality of service of modern networks. In two-dimensional grids the basic cell forms are a triangle, a square, and a hexagon. Triangular grids are used in<br />solving boundary value problems with triangular finite elements, in broadcasting systems and in television. The simplest and most efficient implementations of grids can possess hidden defects and vulnerabilities in terms of secure information exchange. Thus, the<br />verification of grids is an urgent task.<br />Objective. The goal of the paper is to construct the models of triangular communication grids in the form of infinite Petri nets and to investigate their properties for proving the protocols (verification) correctness.<br />Method. Research methods are based on the basics of graph theory, linear algebra, the theoretical foundations of Petri nets, mathematical modeling and simulation. Results. A parametric description of the triangular communication grid on the plane, in a direct and a dual form, is constructed. The switching node implements full-duplex transmission and buffering of packets with a limited capacity of the internal buffer. Analytic expressions are obtained for estimating the number of model components. Solving infinite systems of linear equations in parametric form allowed us to prove the invariance of a model of arbitrary size. Invariance is one of the basic properties of the ideal protocol model which determines the safety of the network. The practical significance of the results obtained lies in the construction of safe grid schemes for further software and hardware implementation, which is officially confirmed by the inclusion of triangular grid models in the archive of Petri net models of the University Paris 6 Informatics Laboratory. Conclusions. For the first time, a mathematical model of triangular communication grids with a regular structure and an arbitrary size in the form of infinite Petri nets was constructed for verification of information transmit protocols in grids. The application of the technique for verification of triangular communication structures allows the further development of the infinite Petri nets theory for constructing and investigating models of arbitrary grids with a regular structure.</p>Copyright (c) 2019 T. R. Shmelevahttp://ric.zntu.edu.ua/article/view/154480ON THE ANALYTICAL SOLUTION OF A VOLTERRA INTEGRAL EQUATION FOR INVESTIGATION OF FRACTAL PROCESSES2019-01-18T11:09:11+02:00V. N. GorevGorev@gmail.comA. Yu. GusevGusev@gmail.comV. I. KorniienkoKorniienko@gmail.com<p>Context. We consider a Volterra integral equation of the first kind which may be applied to the data filtration and forecast of fractal random processes, for example, in information-telecommunication systems and in control of complex technological processes.<br />Objective. The aim of the work is to obtain an exact analytical solution to a Volterra integral equation of the first kind. The kernel of the corresponding integral equation is the correlation function of a fractal random process with a power-law structure function.<br />Method. The Volterra integral equation of the first kind is solved with the help of the standard Laplace transform method. The inverse Laplace transform leads to the calculation of the line integral of the function of complex variable. This integral is calculated<br />as a sum of a residue part and integrals over the banks of cut. The corresponding integrals are obtained on the basis of the known expansions of special functions.<br />Results. We obtained an exact analytical solution of the Volterra integral equation the kernel of which is the correlation function of a fractal random process. The paper is based on a model where the structure function of the corresponding process is a power-law function. It is shown that the part of the solution that does not contain delta-function is convergent at any point if the Hurst exponent is larger than 0.5, i.e. if the process has fractal properties. It is shown that the obtained solution is a real-valued function. The<br />obtained solution is verified numerically; it is also shown that our solution gives the correct asymptotic behavior. Although the solution contains an exponentially growing function of time, at large times the integral of the obtained solution asymptotically behaves as a power-law function. <br />Conclusions. It is important to stress that we obtained an exact solution of the Volterra integral equation under consideration rather than an approximate one. The obtained solution may be applied to the data filtration and forecast of fractal random processes. As is known, fractal processes take place in a huge variety of different systems, so the results of this paper may have a wide field of application.</p>Copyright (c) 2019 V. N. Gorev, A. Yu. Gusev, V. I. Korniienkohttp://ric.zntu.edu.ua/article/view/154546MODELS OF TRAINING PROCEDURES2019-01-18T11:00:52+02:00V. Ye. KhodakovKhodakov@gmail.comA. Ye. SokolovSokolov@gmail.comG. V. VeselovskayaVeselovskaya@gmail.com<p>Context. The problem of justifying methods for constructing models of optimization procedures as dynamic objects, taking into account the features of the training procedures, is considered. The object of the study were models of the dynamics of training procedures.<br />Objective. The goal of the work is to solve the tasks of formalizing the training procedures, developing methods for constructing mathematical models of the learning processes, the processes of searching for the optimum of the learning tasks, and for evaluating dynamic training procedures.<br />Method. The learning process is a totality of sequential and interrelated actions of a teacher and learners, aimed at providing a conscious and durable assimilation of knowledge, abilities, and skills. As a result of systematic analysis, main, basic patterns of training procedures are defined. The notion of “information flow” is justified as the sequence of messages carrying information for building models of interactions in information systems. The important property of the information flow is determined – the direction<br />from the source to the receiver. Two possible variants of information interaction of objects are singled out – information transfer and information compensation. The use of optimality principle for information processes of learning is offered. It is shown that the dynamics of learning processes is determined by the characteristics of the used optimization procedure. The gradient procedure for finding the extremum of the goal function is described by the autonomous motion of the dynamic system. For a strictly convex goal<br />function, according to sufficient optimality conditions, the optimization procedure is described by the dynamics of the autonomous motion of a stationary linear unbound dynamic object. The choice of the multiplier for the gradient significantly affects the dynamics of the process, and for a strictly convex goal function the multiplier is equal to the increment vector. The use of a dynamic model determines the number of steps required to achieve the given accuracy.<br />Results. The created models received software implementation and were investigated in practice when solving the tasks of modeling the dynamics of training procedures in the teaching process of the Information Technologies Department of Kherson National Technical University.<br />Conclusions. The carried out experimental researches have allowed to confirm practically operability of the created mathematical apparatus and to consider it expedient for application with the purpose of increase of efficiency of modeling and realization of training procedures. Further perspectives of the research are seen in the coverage of more types of dynamic training procedures, optimizing approaches to their software implementations, and increasing the scale of their coverage with confirmatory experiments.</p>Copyright (c) 2019 V. Ye. Khodakov, A. Ye. Sokolov, G. V. Veselovskayahttp://ric.zntu.edu.ua/article/view/154553ANALYSIS AND COMPARISON OF TWO QUEUEING SYSTEMS WITH HYPERERLANGIAN INPUT DISTRIBUTIONS2019-01-18T11:00:57+02:00V. N. TarasovTarasov@gmail.com<p>Context. The problem of finding the solution for the mean waiting time in a closed form for a conventional system with hyperarlangian<br />input distributions of second order and for system with shifted hypererlangian input distributions is considered.<br />Objective is obtaining a solution for the main characteristic of the system-the average waiting time for queuing requirements for<br />a queuing system of the type G/G/1 with normal and with shifted hypererlangian input distributions of the second order.<br />Method. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral<br />equation, which allows one to obtain a solution for the mean waiting time for of the systems under consideration in closed form. The<br />method of spectral decomposition of the solution of the Lindley integral equation occupies an important part of the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used.<br />Results. For the first time, spectral decompositions of the solution of the Lindley integral equation for both systems were obtained, with the help of which the calculated expressions for the average waiting time in the queue for the above-mentioned systems<br />in closed form were derived. This approach allows us to calculate the average latency for these systems in mathematical packages for a wide range of traffic parameters. All other characteristics of the systems are the derived from the average waiting time.<br />Conclusions. It is shown that the hypererlangian distribution law of the second order, like the hyperexponential, which is threeparameter, can be determined by both the first two moments and the first three moments. The choice of such a law of probability distribution is due to the fact that its coefficient of variation covers a wider range than the hyperexponential distribution. For the shifted hypererlangian distribution law, the coefficient of variation covers an even wider range. The introduction of shifted distributions extends the scope of the QS with considering the well-known fact from queuing theory, that the average waiting time is related<br />to the coefficients of variations in the intervals of receipts and the time of service by a quadratic dependence. The method of spectral decomposition of the solution of the Lindley integral equation for a queuing system with hypererlangian input distributions of the<br />second order makes it possible to obtain a solution in closed form and this solution is published for the first time. The solution obtained supplements and extends the well-known queuing theory formula for the average waiting time in the queue for a queuing system<br />of type G/G/1.</p>Copyright (c) 2019 V. N. Tarasovhttp://ric.zntu.edu.ua/article/view/154559ANALYSIS OF THE AUTOMATED SPEAKER RECOGNITION SYSTEM OF CRITICAL USE OPERATION RESULTS2019-01-18T11:01:06+02:00O. V. BisikaloBisikalo@gmail.comV. V. KovtunKovtun@gmail.comM. S. YukhimchukYukhimchuk@gmail.comI. F. VoytyukVoytyuk@gmail.com<p>Context. The article summarizes the statistical learning theory to evaluate the long-term operation results of the automated speaker recognition system of critical use (ASRSCU) taking into account the features of the system’s operation object and the<br />structural specificity of such a class of recognition systems.<br />Objective. The goal of the represented work is the development of a complex set of methods for the ASRSCU’s quality parameters stabilization during its long-term operation.<br />Method. The article formulated set of methods for the ASRSCU’s operational risks estimation of its long-term operation. In particular, the dependence of the risk of an incorrect speaker recognition on the features space dimension is described. Based on the<br />formulated measure of informativity, obtained a set of methods to analyze the training sample to identify examples that lead to increased risk. The influence of the phenomenon of the drift of the speech signal parameters on the quality indicators of the ASRSCU is described analytically. An estimation of the operation duration of the ASRSCU, during which it is impractical to re-train its the classifier, is carried out. Recommendations for choosing an optimal ASRSCU’s classifier are formulated from the position of its complexity minimization, taking into account the risks of the ASRSCU’s long-term operation and the possibility of re-training.<br />Results. Represented in the article theoretical results are verified by the DET-curves experiments data, which summarize the information from long-term experiments with the ASRSCU, in which, during the features space configuration were taken into<br />account the features based on the power normalized cepstral coefficients based and the features based on the spectral-temporal receptive fields theory. Within the framework of the created theoretical concept, an estimation of the influence of the features space<br />configuration and the type and complexity of the classifier on the stability of the ASRSCU’s quality parameters during its long-term operation has been carried out.<br />Conclusions. For the first time the theoretically analyzed the problem of average risk minimization by empirical operation results of a ASRSCU, where, unlike existing approaches, non-stationary input data with the drift of individual speech signals features and<br />the characteristic parameters of the recognition system classifier were taken into account, which allowed to estimate the risk’s confidence interval for conditions for re-training sessions.</p>Copyright (c) 2019 O. V. Bisikalo, V. V. Kovtun, M. S. Yukhimchuk, I. F. Voytyukhttp://ric.zntu.edu.ua/article/view/154562INFORMATION MODELING FUZZY KNOWLEDGE2019-01-18T11:01:11+02:00O. F. VoloshynVoloshyn@gmail.comN. N. MalyarMalyar@gmail.comV. V. PolishchukPolishchuk@gmail.comM. N. SharkadiSharkadi@gmail.com<p>Context. The research of the actual problem of the development of information models for the presentation of fuzzy knowledge for information technologies has been carried out on the example of various applied problems that occur during the functioning of socioeconomic<br />systems with the use of fuzzy sets, fuzzy logic and system approach.<br />The purpose of this work is the development of information models for the presentation of fuzzy knowledge for the adoption of managerial decisions in the functioning of socio-economic systems in the conditions of uncertainty for incoming expert assessments.<br />Objective. The object of the research is the process of modeling fuzzy knowledge based on membership functions for incoming expert evaluations according to the criteria.<br />The subject of the research is the methods and models of presentation of fuzzy knowledge for making decisions in conditions of uncertainty.<br />Method. For the first time a representation information modeling fuzzy knowledge based functions of assessments on the criteria and their possible use for different applications. The model representation of fuzzy knowledge for evaluating the solvency of enterprises and<br />investment projects, forming a set of evaluation criteria and examples of constructions membership functions for comparing input. For the first time a representation of the information model of fuzzy knowledge input to expert estimates, the example of a startup evaluation of<br />projects that will provide linguistic value and reliability assessment of alternatives.<br />Results. The result of the study is the information modeling of the presentation of fuzzy knowledge on examples of construction of models for assessing the solvency of enterprises, investment and startup projects on incoming expert assessments. The developed model gives an opportunity for the recruited expert points of a weakly structured or unstructured task to receive interpretations, revealing the subjectivity of experts and having a quantitative assessment in non-formalized problems. The rationality of the assessment proves the advantages of the developed models.<br />Conclusions. The scientific and applied task of developing informational models of presentation of fuzzy knowledge for information technology is solved in the work on examples of construction of models of solvency assessment of enterprises, investment projects and startup<br />of projects according to incoming expert assessments. The development of models of fuzzy knowledge will provide an opportunity to adequately approach the evaluation of alternative solutions, while increasing the degree of validity of decision-making. The proposed information<br />models of fuzzy knowledge of the assessment of enterprises’ solvency, investment and startup projects can be implemented into the work of investment institutions.</p>Copyright (c) 2019 O. F. Voloshyn, N. N. Malyar, V. V. Polishchuk, M. N. Sharkadihttp://ric.zntu.edu.ua/article/view/154566THE CRITERION FOR FEATURE INFORMATIVENESS ESTIMATION IN MULTI ROBOT TEAMS CONTROL2019-01-18T11:01:22+02:00M. O. HumeniukHumeniuk@gmail.comI. M. SashchukSashchuk@gmail.comYu. V. ZhuravskyZhuravsky@gmail.com<p>Context. The task of automation of feature set informativeness estimation process in multi robot teams control is solved. The object of the research is the process of multi robot teams control. The subject of the research is the criterion of feature set informativeness estimation.<br />Objective. The research objective is to develop the criterion for feature set informativeness estimation in multi robot teams control.<br />Method. The criterion for feature set informativeness estimation is proposed. The developed criterion is based on the idea that feature set informativeness is computed according to values of the prior probabilitіes of finding features in the descriptions of the environment states. The use of the proposed criterion allows to efficiently solve the problem of feature set informativeness estimation, leading to effective solution of the multi robots control task. The developed criterion is based on the maximizing mutual information criterion and can be applicable when measurements are interdepended and environment has a variable number of states. The criterion doesn’t require to construct models based on the estimated feature combinations, in such a way considerably reducing time and computing costs for multi robot teams control. Application of the proposed criterion for feature set informativeness estimation allows to make a decision how much a new observation will increase the certainty of the robots’ beliefs about the environment state which is observed. Results. The software which implements the proposed criterion for feature set informativeness estimation and allows to manage multi robot teams has been developed.<br />Conclusions. The conducted experiments have confirmed operability of the proposed criterion for feature set informativeness estimation and allow to recommend it for multi robot teams control in practice. The prospects for further researches may include the modification of the known multi robot teams control methods and the development of new ones based on the proposed criterion for feature set informativeness estimation.</p>Copyright (c) 2019 M. O. Humeniuk, I. M. Sashchuk, Yu. V. Zhuravskyhttp://ric.zntu.edu.ua/article/view/154571A MODIFIED CASE-BASED REASONING METHOD BASED ON THE ROUGH SET THEORY2019-01-18T11:01:26+02:00I. I. KovalenkoKovalenko@gmail.comA. V. ShvedShved@gmail.comN. V. KovalKoval@gmail.com<p>Context. Knowledge bases are the main element of artificial intelligence systems. They are formed on the basis of two generally accepted approaches: the object-oriented approach and object-structural approach. Knowledge structuring through its ordering,<br />classification and typing of selected classes is the main operation that is implemented in both approaches. Quite often there are situations when data or knowledge is not exact and it is impossible to perform their exact classification. These features necessitate the<br />development of new approaches aimed at solving problems of extracting knowledge from large arrays of unordered data, structuring, presenting and analytical processing of inexact knowledge in automated construction of knowledge bases.<br />Objective. The objective of this paper is a research of new approaches for solving problems of representation of knowledge about cases in intellectual decision support systems.<br />Method. An approach aimed at modifying Case-Based Reasoning method on the basis of Rough Set Approach has been proposed in this paper. The proposed method forms a partition of cases to determine the degree of their belonging to the goal classes<br />using upper and lower approximations of goal classes, considering the relative importance of classification attributes and formed equivalence classes.<br />Results. The proposed modification of Case-Based Reasoning method allows extracting knowledge about cases from arrays of unordered data with the purpose of the case base construction, and handling the inconsistent (in cases where for the same values of<br />attributes cases belong to different classes), and incomplete (in cases where the values of some attributes or information of the case belonging to the given class is missing or unreliable) information about cases.<br />Conclusions. The proposed method of representation knowledge about cases, their adaptation and subsequent search in the case base formed under uncertainty and existence of inexact, rough, inconsistent initial data constitutes a theoretical basis for constructing<br />intellectual decision support systems. </p>Copyright (c) 2019 I. I. Kovalenko, A. V. Shved, N. V. Kovalhttp://ric.zntu.edu.ua/article/view/154577METHODS OF LARGE-SCALE SIGNALS TRANSFORMATION FOR DIAGNOSIS IN NEURAL NETWORK MODELS2019-01-18T11:01:30+02:00I. O. LymarievLymariev@gmail.comS. A. SubbotinSubbotin@zntu.edu.uaA. A. OliinykOliinyk@zntu.edu.uaI. V. DrokinDrokin@gmail.com<p>Context. The problem of dimensionality reduction of diagnosis signals for their use in neural network models is considered. The object of the study was the process of transformation of diagnosis input signals for their subsequent use in the synthesis of predictive<br />models.<br />Objective. The goal of the work is the creation of the methods for the conversion of diagnosis signals as a result of the application of which new signals will be obtained, which in turn will be used in the construction of neural network predictive models and will significantly reduce the synthesis time of the model by reducing their dimension and the allocation of the necessary components that characterize the state of the individual elements of the object of diagnosis.<br />Method. The methods of reducing the dimension of the input signals of diagnosis and isolation of their components, which characterize the state of the individual elements of the object of diagnosis on the basis of expert knowledge about the process of diagnosis<br />are proposed. The developed methods are based on the methods of digital signal processing. Based on the expert knowledge of the object and the process of diagnosis, the necessary signal conversion procedures and their parameters are selected. In accordance with<br />the requirements for the desired accuracy and detail of the forecast, the optimal degree of averaging of the signal is selected, which directly affects the speed of constructing the predictive model. The proposed methods can be used in the transformation of diagnosis<br />signals of various diagnostic processes where there is a need to build neural network predictive models based on high-dimensional signals. The developed methods were investigated for the conversion of diagnostic signals obtained on a complex object of technical<br />diagnostics, namely, on the transmission of the helicopter. On the basis of the received signals, a neural network model was synthesized, the training of which requires much less computational resources, while the prediction accuracy remains optimal.<br />Results. The developed methods are implemented programmatically and investigated in solving the problem of predicting the future state of the helicopter transmission during the diagnosis process.<br />Conclusions. The experiments have confirmed the effectiveness of the developed methods and allow us to recommend them for use in practice in solving diagnostic problems. The conducted experiments have confirmed the proposed software operability and allow recommending it for use in practice for solving the problems of diagnosis and automatic classification on the features. The prospects for further research may include the search for the best parameters of the developed methods, optimization of their software implementations, as well as experimental study of the proposed methods on a large set of practical problems of diagnosing complex objects of different nature by their diagnostic signals.</p>Copyright (c) 2019 I. O. Lymariev, S. A. Subbotin, A. A. Oliinyk, I. V. Drokinhttp://ric.zntu.edu.ua/article/view/154579INVESTIGATION OF METHODS OF INTELLECTUAL ANALYSIS OF BIBLIOGRAPHIC DESCRIPTIONS AND DEVELOPMENT OF PROGRAM SYSTEM FOR ANALYSIS OF LITERATURE LIST2019-01-18T11:14:05+02:00O. Y. MelnykovMelnykov@gmail.comK. M. KomissarovKomissarov@gmail.com<p>Context. The problem of analyzing a bibliographic list is examined with the purpose of automating the verification of the correctness of its compilation. The object of the study was the process of creating bibliographic descriptions based on existing standards.<br />The subject of the study is models and methods of intellectual analysis for checking and correcting bibliographic descriptions. Objective. The goal of the work is to increase the effectiveness of scientific and pedagogical activity through the use of an intellectual system to check the list of literary sources in the students’ course and diploma papers.<br />Method. The standard is analyzed and the elements composing the bibliographic description are listed. Existing tools for forming and checking the list of literature sources are considered, their shortcomings are revealed, the necessity of creating a software tool for<br />checking bibliographic descriptions is grounded. The research of methods of intellectual analysis is given: methods of regular expressions, fuzzy search with application of fuzzy regular expressions, finite automaton and neural network of Hamming are considered. A previously existing model for checking the bibliographic description for compliance with existing standards was created, based on the methods of regular expressions, fuzzy search, the finite automaton and the neural network of Hamming. An object-oriented model of the projected computer system in the language of visual modeling of UML is presented. The work of computer implementation of the software system implemented in the C # visual programming environment is described. Results. A software system was developed – an intelligent decision-making system – to check the bibliographic description and partially automated correction with user instructions generated based on the knowledge base. Conclusions. The developed intellectual system allows to reveal and correct mistakes of registration of the bibliographic description. The basis of the program is the knowledge base, which can be supplemented if there are any unforeseen situations. In addition, this system makes it possible to accumulate a database of already verified lists of literature. The developed system can be improved without interfering with the source code of the program. At the same time, the level of its capabilities and correctness of corrections, the issuance of comments directly depends on the completeness and correctness of the compiled knowledge base. The prospects for further research include the use of other styles for the design of a list of literature other than DSTU 7.1: 2006, such as the IEEE.</p>Copyright (c) 2019 O. Y. Melnykov, K. M. Komissarovhttp://ric.zntu.edu.ua/article/view/154581THE CALCULATION METHOD FOR INDICATORS PROJECT ESTIMATION IN THE IMPLEMENTATION OF SOFTWARE SYSTEMS RE-ENGINEERING2019-01-18T11:01:43+02:00S. S. VelykodniyVelykodniy@gmail.comO. S. TymofieievaTymofieieva@gmail.comS. S. Zaitseva-VelykodnaZaitseva-Velykodna@gmail.com<p>Essentials. Today’s software systems have become so tightly integrated into our lives that it is virtually impossible to imagine the existence and development of mankind without them. But this progress also means that software systems currently in use have<br />quickly become outdated and obsolete due to the pace technical evolution. It is here that end to end process review comes down with the inheritance of the positive qualities of the software system and the phasing out of the negative one, that is, re-engineering. All<br />similar processes that begin with re-design, require a mandatory analytical assessment of the project’s key indicators since there are cases where re-engineering might be unprofitable for a particular software system. In the article below, the author takes a look at the<br />complex tool of evaluating the software project redesign, which could predict labor costs for reprogramming of the objects in conjunction with other indicators of the projects that determines the complexity of software system under review.<br />Objective. The object of this paper is to outline the method by which one can estimate and evaluate key aspects for software system reengineering with the help of complex tools for appraisal of the project under review.<br />Method. The technology described in the article is based on use of the Karner’s Point method with the introduction of significant additions and extensions. The establishment of coefficients and the selection of the constants are based on the Jacobson’s method and<br />tested on numerous statistics of the most similar projects.<br />Outcome. After analyzing the completed project and examining the report of crucial factors, it’s possible to provide quite accurate estimation for the actual man-hours of re-engineering for the particular project, given its key factors can be accurately adjusted.<br />Subsequently, you can use this data as the base line for the project life cycle. Evaluation factors used for project cost calculation will be combined in a report that will be included in the source design documentation, which is part of the organizational support of the<br />systems for the automation design of software systems.<br />Conclusions. The method of calculating Karner’s project points with the introduction of significant extensions to the process of software system re-engineering has been further developed. Each variable is determined and calculated separately, using measurements,<br />weighting factors and constrains. Measurements are performed by a team of experienced QA-analysts based on their ideas about the technical complexity of the project and the capabilities of the software developers. The coefficients and constants are based on data collected from 3–5 projects already completed by analysts with a big degree of similarity.</p>Copyright (c) 2019 S. S. Velykodniy, O. S. Tymofieieva, S. S. Zaitseva-Velykodnahttp://ric.zntu.edu.ua/article/view/154584PLANNING THE ACTIVITIES OF INTELLECTUAL AGENTS IN THE ELECTRONIC COMMERCE SYSTEMS2019-01-18T11:01:53+02:00A. Y. BerkoBerko@gmail.comV. A. VysotskaVysotska@gmail.comV. V. LytvynLytvyn@gmail.comO. M. NaumNaum@gmail.com<p>Context. Today, e-commerce is one of the most active and promising segments of the global economy, characterized by steady growth of volumes and active improvement of tools and technologies. Intellectualization of e-commerce systems today is one of the<br />main trends in their development and effective functioning in a competitive environment. One of the most promising means of solving this task category is the use of intellectual agents (IAs). The modern approach to modeling the decision support process, in<br />particular, in e-commerce, uses the Boyd’s loop principle, which involves repeated cycle repetition of four successive interrelated processes (stages): observation – orientation – decision-making – action. According to Boyd’s hypothesis, the higher speed of the<br />cycle and the accuracy of the evaluation of the stages of the cycle provide an advantage over the competitor. Objective of the research is to develop tools for effective planning of actions of intellectual agents of e-commerce systems in a competitive environment based on ontologies, and to set the task of planning the actions of intellectual agents to the problem of<br />dynamic programming.<br />Method. The mathematical support and method of action planning of IA based on adaptive ontologies are developed. This method can be used to effectively operate IA in a competitive environment of the SEC, which is modeled by Boyd’s loop. Adaptive<br />ontology is used to plan IA actions. To this end, we have added two scalar quantities (the importance of concepts and relationships) that are used to find an effective way to implement the IA plan in a generally accepted three-element tuple that defines ontology (a<br />set of concepts, relationships, and their interpretation). Such an assessment of the ontology elements allows reducing the task of planning IA actions in a competitive environment to the task of dynamic programming.<br />Results. In the article the model of planning of actions of intellectual agents of electronic commerce systems using an ontological approach is constructed. The method of evaluation of actions of intellectual agents on the basis of adaptive ontologies is developed.<br />Such an assessment makes it possible to reduce the task of scheduling actions to the task of dynamic programming.<br />Conclusions. Analysis of the results of IA actions can determine the causes of the formation of the target audience by a set of characteristics of the functioning of the SEC. By regulating the content, its uniqueness, the efficiency of its formation and its<br />adequate management according to the individual needs of a regular user, one can model the boundaries of the target social audience and the number of unique visitors from search engines. In fig. 5–6 the results of the work of the developed systems in the form of<br />charts are presented, from which it follows that in the presence of all types of IA significantly increases the volume of visits and unique users.</p>Copyright (c) 2019 A. Y. Berko, V. A. Vysotska, V. V. Lytvyn, O. M. Naumhttp://ric.zntu.edu.ua/article/view/154595COMPARISON OF BLOCK EXPECTATION TIME FOR VARIOUS CONSENSUS ALGORITHMS2019-01-18T11:01:57+02:00D. S. KaidalovKaidalov@gmail.comL. V. KovalchukKovalchuk@gmail.comA. O. NastenkoNastenko@gmail.comM. Yu. RodinkoRodinko@gmail.comO. V. ShevtsovShevtsov@gmail.comR. V. OliynykovOliynykov@gmail.comContext. We consider security properties of decentralized blockchain-based consensus protocols. The object of research is block<br />confirmation time for users to get assurance that their transaction will not be reverted.<br />Objective. The goal of the paper is to analyze double-spend attacks on the different blockchain-based systems and compare<br />resulting probabilities of attacker’s success.<br />Method. We presented two models for two types of attacks on the Ouroboros protocol (for the general and covert adversaries).<br />The models allow calculating the exact number of slots needed to achieve the required level of security. It was shown that the<br />Ouroboros protocol allows achieving the required security level with significantly shorter confirmation period in comparison with<br />Bitcoin. We estimated minimal number of confirmation blocks and compare estimation time for Bitcoin, GHOST and Ouroboros<br />protocols. As a measure of comparison, we considered transaction confirmation time for which the probability of a double-spend<br />attack is less than 0.1%. We use different standard probability distribution and different properties of Markov chains and Random<br />Walks to get comparison of estimated security properties of Bitcoin blockchain against three different models of Bitcoin double<br />spend attack. The splitting attack based on the model where resources of honest participants are divided to compete different chains<br />is applied to Bitcoin and GHOST consensus protocols. Properties of Markov chains and Random Walks are also applied to obtain<br />security estimations for the Ouroboros protocol.<br />Results. We developed methods to get specific numbers for average block confirmation time for Ouroboros protocol. We<br />compared minimal number of confirmation blocks needed to ensure a high security for considered protocols: Bitcoin, GHOST and<br />Ouroboros.<br />Conclusions. The obtained results allow determination of security bounds for the Bitcoin, GHOST and Ouroboros consensus<br />protocols. Users of the practically deployed blockchain systems may get specific parameters for a given assurance level.Copyright (c) 2019 D. S. Kaidalov, L. V. Kovalchuk, A. O. Nastenko, M. Yu. Rodinko, O. V. Shevtsov, R. V. Oliynykovhttp://ric.zntu.edu.ua/article/view/154598PRACTICAL CONSIDERATIONS OF GREEDY COMPRESSED SAMPLING METHODS APPLICATION FOR OFDM CHANNEL ESTIMATION2019-01-18T11:02:02+02:00V. V. KotlyarovKotlyarov@gmail.comA. A. ShpylkaShpylka@gmail.comContext. Traditionally a large number of pilot carriers are utilized to acquire channel state information in OFDM based systems.<br />A larger number of pilot carriers gives better channel state estimation but leads to lower spectrum efficiency of the system.<br />Objective. Primary objective of this paper is to look at the practical aspects of the application of novel CS-based channel<br />estimation technique, that can achieve estimation quality on reduced training data, in context of real pilot aided OFDM systems.<br />Method. A novel technique CS enables representation of sparse signals using fewer samples as compared to its original size.<br />Exploiting the sparse nature of channel impulse response of multipath channels, we apply the CS technique for channel estimation in<br />pilot aided OFDM system based on ISDB-T standard.<br />Results. In this paper, we consider two the most popular CS-based recovery algorithms – OMP and CoSaMP. The MSE<br />performance metrics are given for both CS-based channel estimation algorithms. Simulations results demonstrate that CoSaMP<br />provides more stable results while requires more pilot carriers than OMP to achieve good estimation quality. Both algorithms require<br />a priori knowledge of channel sparsity level but CoSaMP is much more sensitive to a correctness of this information.<br />Conclusions. The compressed sampling approach shows the impressive capability of channel impulse response recovery from a<br />significantly smaller amount of pilot carriers than traditional linear methods require. However, the need of sparsity knowledge by the<br />most popular CS recovery methods seriously limits the applicability of these algorithms in real OFDM receivers. Nevertheless, CSbased<br />channel estimation is a promising technique which worth further investigation to overcome this limitation.Copyright (c) 2019 V. V. Kotlyarov, A. A. Shpylkahttp://ric.zntu.edu.ua/article/view/154605COMPARATIVE ANALYSIS OF OPTIMIZATION METHODS IN THE INVESTIGATION OF A WEIGHMEASURING SYSTEM AND THERMOREGULATOR2019-01-18T11:02:06+02:00N. D. KoshevoyKoshevoy@gmail.comE. M. KostenkoKostenko@gmail.comA. A. BeliaievaBeliaieva@gmail.comContext. For the first time, the use of taboo-search methods, random search, a swarm of particles for the construction of costeffective<br />experiment plans for the study of a weighing system and a temperature regulator was proposed.<br />Objective – to carry out a comparative analysis of the developed optimization methods, such as taboo search, random search,<br />particle swarm when searching for the optimal plans for the experiment during the study of the weighing system and thermostat.<br />Method. Methods for constructing the experimentally optimal implementation matrix for the experiment using algorithms of a<br />swarm of particles, taboo search and random search are proposed. In the beginning, the number of factors and cost of transitions for<br />each level of factors is introduced. Then, taking into account the input data, the initial experimental design matrix is formed. When<br />using the taboo search algorithm at each iteration step, the best solution in the neighborhood of the current solution is chosen as the<br />new current solution and the check is made whether it is in the taboo list. Thus, calculations occur until the algorithm reaches the<br />specified number of iterations. The list of taboos is formed from decisions that have a minimum cost. The random search method is<br />based on permuting the columns of the planning matrix. The number of iterations of the algorithm is specified by the user. The<br />method of the particle swarm is based on modeling the behavior of the particle population. At each point where the particle visited,<br />the value of the experiment is calculated. In this case, each particle remembers which (and where) the best value of the cost of the<br />experiment, she personally found and where the point is located, which is the best among all the points that explored the particles. At<br />each iteration, the particles correct their velocity (modulus and direction). After a certain number of iterations, the particles are collected<br />near the best point. Then, among all the new points, we check whether we have found a new globally better point, and if<br />found, remember its coordinates and the value of the cost of conducting the experiment in it. Then the gain is calculated in comparison<br />with the initial cost of the experiment.<br />Results. The software that implements the proposed methods was developed, which was used to conduct computational experiments<br />to study the properties of these methods in the study of a weighing system and a temperature regulator. Optimized for the cost<br />of implementation of the experiment plans were synthesized, as well as the gains in optimization results as compared to the initial<br />and maximum costs of the experiment.<br />Conclusions. The conducted experiments confirmed the efficiency of the proposed methods and the software that implements<br />them, and also allow them to be recommended for application in practice when constructing optimal experimental design matrices.Copyright (c) 2019 N. D. Koshevoy, E. M. Kostenko, A. A. Beliaievahttp://ric.zntu.edu.ua/article/view/154614ADAPTIVE MATRIX MODELS IN THE VIDEO STREAMS CONTROL PROBLEM2019-01-18T11:02:15+02:00S.V. MashtalirMashtalir@gmail.comM.I. StolbovyiStolbovyi@gmail.comContext. At present, the multidimensional data analysis is one of the priority scientific research areas. This is due to the almost<br />uncontrollable growth in the information size and the need to obtain/search for various kinds of useful data from it. At the same time,<br />video data analysis is one of the most difficult from a computational point of view, not only because of BigData being processed, but<br />also due to the video unstructuredness, and also the fact that in a bunch of video processing applications exist limitations on the<br />processing time. One of the ways to solve these video analysis problems is to pre-process the initial data in order to get them split<br />into homogeneous segments (shots), which significantly reduces the time and computational costs for further content-based video<br />analysis in video database. And, despite the existing results in this direction, the video sequences clustering/segmentation problem<br />remains extremely relevant.<br />Objective. The paper considers the problem of clustering multidimensional streaming data as example of temporal video<br />segmentation.<br />Method. A method for controlling changes in streaming data is proposed, which allows you to detect the moments of a<br />significant change in the input multidimensional data characteristics, based on adaptive matrix models with the specialized tuning<br />algorithm for the predictive model introduction.<br />Results. The conducted experiment on an arbitrary video sequences demonstrated the video shot detection possibility. It should<br />be noted that the proposed approach essentially depends on the input data spatial segmentation results, which is necessary to obtain a<br />characteristics set describing each frame of the video sequence.<br />Conclusions. The proposed method allows multidimensional input data clustering/segmentation by adaptive matrix models. As<br />initial data in the experimental part, video sequences were used.Copyright (c) 2019 S.V. Mashtalir, M.I. Stolbovyihttp://ric.zntu.edu.ua/article/view/154621ANALYSIS OF WAYS FOR EXCHANGING DATA IN NETWORKS WITH PACKAGE COMMUTATION2019-01-18T11:02:21+02:00S. V. MinukhinMinukhin@gmail.comM. U. LosevLosev@gmail.comD. E. SitnikovSitnikov@gmail.comContext. The important problem of increasing the effectiveness of functioning telecommunication networks with package<br />commutation is considered. Some ways are suggested for improving algorithmic tools for information exchange based on using<br />methods and means of diagnosing errors in packages with data transferred. The object of this investigation is the process of data<br />transfer and determining spoilt packages in messages.<br />Objective. The objective of this paper is to decrease the average relative time of package delivery and also to increase the<br />probability of faultless information transfer to user on the basis of modelling various data exchange protocols.<br />Method. A method is suggested for the synthesis of universal, fast-acting multi-channel devices designated for controlling and<br />diagnosing messages in data exchange networks with package commutation. Determining faulty packages is carried out based on<br />using cyclic codes and the signature analysis method, which allows creating simple and sufficiently effective devices for data control.<br />A comparative analysis of data exchange protocols is carried out based on using the method of probability-time graphs.<br />Results. There have been obtained recommendations as to effective using protocols for information exchange with respect to<br />usage conditions and characteristics of networks with package commutation.<br />Conclusions. In this research the formalization of information processing based on the signature analysis has been accomplished<br />and the method for the synthesis of multi-channel control devices with localizing errors in message packages has been improved. At<br />that, the approach to data exchange in networks with package commutation has been improved. A comparative analysis of the three<br />main scientific approaches that use cyclic error detecting codes has been carried out with the help of probability-time graphs.Copyright (c) 2019 S. V. Minukhin, M. U. Losev, D. E. Sitnikovhttp://ric.zntu.edu.ua/article/view/154637IDENTIFICATION OF “HUMAN ERROR” NEGATIVE MANIFESTATION IN MARITIME TRANSPORT2019-01-18T11:02:24+02:00P. S. NosovNosov@gmail.comA. P. BenBen@gmail.comV. N. MatejchukMatejchuk@gmail.comM. S. SafonovSafonov@gmail.comContext. There is a problem of identifying the subjective entropy of the navigator as an indication of negative human error in maritime transport. The aim of the study is to develop the data system to identify the negative manifestations of the human error for ensuring safety in maritime transport. Objective. The objective of the work is to design the data system consisting of two levels. Levels are targeted at<br />detection of primary factors and secondary factors of subjective entropy of the navigator increase.<br />Method. Within the scope of this work, the phases of the navigator’s activity are determined, in which negative manifestations of the human error arise. This most often occurs during emergency situations. It is determined that the navigator’s loss of focus leads to inadequate actions in relevant situations. Stressful situations are the second reason that affects self-control level. The factors’ expanses influencing the navigator’s subjective entropy increase as well as the vector affecting the subjective entropy at the first level of the formal system are determined. The arrangement of sets of factors was carried out. The arrangement result represents the formal system’s first level description. Multi-objective optimization problem is vital for optimal solutions identification. The patterning’s target is error evaluation on finding a vector, which is an essential stage. The lower limit of the system identification level is determined. The formal description of actions at the second level of the system is carried out and vector is specified at this level. The dependences of second-level vectors’ impacts on navigator subjective entropy increase are specified with maximum accuracy. Time input estimation for system actuation allows us to determine three operating modes of the system. The<br />input data for operating modes specification is indicated. The matrix-based framework algorithm of navigator’s<br />behavior during emergency situations is given.<br />Results. Formal approaches were confirmed by simulation patterning using the navigation simulator NTPRO 5000.<br />The data obtained allowed to build an algorithm in navigator’s shaping of in various situations.<br />Conclusions. The proposed formal approaches, patterns and algorithms will provide a basis for navigator’s behavior analysis during emergency situations. The search of the best practice of human error data mining based on real data and simulator training data can be the direction for future research. This will allow to determine the mathematical<br />expectation of navigator’s behavior in emergency situations, as well as when performing operations with a low coefficient of experience.Copyright (c) 2019 P. S. Nosov, A. P. Ben, V. N. Matejchuk, M. S. Safonovhttp://ric.zntu.edu.ua/article/view/154644THE AUTOMATED CONTROL SYSTEM OPERATING ANALYSIS AND MODELING FOR AERATED CONCRETE PRODUCTION2019-01-18T11:02:28+02:00Zh. К. КaminskaKaminska@gmail.comE. М. KulynychKulynych@gmail.comS. N. SerdiukSerdiuk@gmail.comContext. The problem of increasing the efficiency and quality of functioning of the Automated Control System (ACS) for aerated<br />concrete production is considered. The relevance of the problem is determined by the need to take into account the human factor<br />in the development of systems of this type. Methods and means of control processes automation with the help of complex technological<br />processes (TP) are the research object. The subject of the research is models, methods and means of increasing the efficiency<br />and quality of control process automation of technological complexes in aerated concrete production.<br />Objective. The complex mathematical model is to be developed to bring automated control of technological processes for aerated<br />concrete production to the advanced level of its efficiency and quality. The complex mathematical model formalizes humanoperator<br />activity and technological process on the physical level including characteristics of actuators and their control modes. Practically<br />the complex mathematical model is implemented as a certain imitation model (IM), which represents control process for dosing<br />the components for aerated concrete mixtures at JSC “Motor Sich” (Zaporizhzhia, Ukraine).<br />Method. The solution of the considered problem in the form of the IM operating process of the ACS for aerated concrete preparation<br />is proposed. It is based on a complex mathematical model of dosing and mixing aerated concrete components and the interactive<br />work of the operator with the human-machine interface (HMI) of the ACS when solving the TP control tasks. In the IM, the<br />human-machine system “operator-ACS” is presented in the form of a queuing system. To formalize the operator’s activity algorithm,<br />the generalized structural method offered by A.I. Gubinsky is used. The peculiarity of this IM is that it can be used to evaluate and<br />debug the ACS and HMI algorithms.<br />Results. The software and IM of the technological process for aerated concrete production at JSC "Motor Sich" was developed.<br />That implements the proposed complex model based on a transact technique of organizing quasi-parallelism in IM.<br />Conclusions. The research proposes a combined (analytical-imitation) model of the automated control process for the aerated<br />concrete preparation technology. Unlike other well-known control models which include dosing and mixing processes, this one suggests<br />the approach that allows formalizing the activity of the ACS operator, quantifying the indicators of his information load and<br />taking into account the influence of the dynamical changing of the components set weight in the dispenser hoppers and the components<br />flow velocity from the consumable containers in the dosing process. The conducted experiments proved the operability of the<br />software proposed; such software may be recommended for practical use in solving the problems of justifying the structure optimal<br />choice, control methods, HMI variants, clarifying the ACS parameters for the specified technological processes, and also for development<br />of intelligent simulators to be used for operator training.Copyright (c) 2019 Zh. К. Кaminska, E. М. Kulynych, S. N. Serdiukhttp://ric.zntu.edu.ua/article/view/154675METHODS AND ALGORITHMS OF SOFT DECODING FOR SIGNALS WITHIN INFORMATION TRANSMISSION CHANNELS BETWEEN CONTROL SYSTEMS ELEMENTS2019-01-18T11:02:35+02:00V. I. FreymanFreyman@gmail.comContext. The problems of increasing the reliability of information transmission in the channels of control systems against the<br />background of the impact of a set a different nature and type interference are solved. The object of research is receiving device<br />(channel symbols decoder), the subjects of research are models, methods and algorithms of proceeding and decision making for elementary signals (channels symbols). The goal is creation and research of methods and algorithms of elementary signals «soft» decoding for providing of information transmission reliability in the build-in and dedicated channels of control systems.<br />Method. The math methods of fuzzy sets for description of errors within information transmission channels between control systems<br />elements is used. The methods and algorithms of «soft» decoding within first decision device of control systems elements are realized (this<br />methods allows get more information for decision making then «hard» method of decision making). The program simulation of proposed<br />method of decision making based on fuzzy logic is executed.<br />Results. The structure scheme and functioning algorithm of quasi-optimal receiver of elementary signal with original using methods of fuzzy logic for decision making are created. The algorithm of decision making is researched with using the simulation tool MathWorks Fuzzy Logic Toolbox.<br />Conclusions. The research results allows to make the next conclusions that proposed «soft» decoding method provides greater<br />«flexibility» for decision making that positively affects the reliability of information transmission; don’t require the introduction and<br />use of multi-valued logic (for example, the symbol «x» for the model of the channel 2×3, the symbols «1b» and «0b» for the model<br />of the channel 2×4, the symbols «0» ... «7» for the model of the channel 2×8) that facilitates the implementation of the decoding algorithm; allows to execute arithmetic (not logical) calculation for decreasing a computational difficult of decision making algorithm.Copyright (c) 2019 V. I. Freyman