Radio Electronics Computer Science Control最新文献

{"title":"POLYNOMIAL ESTIMATION OF DATA MODEL PARAMETERS WITH NEGATIVE KURTOSIS","authors":"V. V. Chepynoha, A. V. Chepynoha, V. V. Palahin","doi":"10.15588/1607-3274-2023-3-7","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-7","url":null,"abstract":"Context. The paper focuses on the problem of estimating the center of distribution of the random component of experimental data for density models with a negative kurtosis.
 Objective. The goal of this research is to develop methods to improve the efficiency of polynomial estimation of parameters of experimental data with a negative kurtosis coefficient.
 Method. The study applies a relatively new approach to obtaining estimates for the center of the probability distribution from the results of experimental data with a stochastic component. This approach is based on polynomial estimation methods that rely on the mathematical apparatus of Kunchenko's stochastic polynomials and the description of random variables by higher-order statistics (moments or cumulants). A number of probability density distributions with a negative kurtosis coefficient are used as models of the random component.
 As a measure of efficiency, the ratio of variance of the estimates for the center of the distribution found using polynomial and classical methods based on the parameter of amount of information obtained is used.
 The relative accuracy of polynomial estimates in comparison with the estimates of the mean, median and quantile estimates (center of curvature) is researched using the Monte Carlo method for multiple tests.
 Results. Polynomial methods for estimating the distribution center parameter for data models of probability distribution density with a negative kurtosis coefficient have been constructed.
 Conclusions. The research carried out in this paper confirms the potentially high efficiency of polynomial estimates of the coordinates of the center of the experimental data, which are adequately described by model distributions with a negative kurtosis. Statistical modeling has confirmed the effectiveness of the obtained estimates in comparison with the known non-parametric estimates based on the statistics of the mean, median, and quantile, even with small sample sizes.","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136038643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"USING ESP32 MICROCONTROLLER FOR PHYSICAL SIMULATION OF THE WIRELESS REMOTE CONTROL MODEM","authors":"T. A. Vakaliuk, O. V. Andreiev, T. M. Nikitchuk, V.V. Osadchyi, O. F. Dubyna","doi":"10.15588/1607-3274-2023-3-20","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-20","url":null,"abstract":"Context. Due to the need for practical implementation of the theoretical provisions of the proposed method of the wireless transmission of the commands for controlling a moving object in conditions of intentional interference.
 Objective of the work is a practical verification of the possibility of using a phase-pulse modulation of the linear-frequencymodulated signal for transmission a control commands through physical modeling using microcontrollers.
 Method. Analytical calculations of the change in time of the voltage at the input and output of the device for optimal processing of the linear frequency-modulated signal were carried out exclusively using the computing capabilities of the microcontroller. The graphs of changes in time of the relevant parameters were built with the help of Excel using the data output to the monitor of the serial port of the Arduino IDE software environment. A digital oscilloscope with a USB host was used to monitor the operation of a wireless modem to transmit control commands to a moving object.
 Results. Analytical calculations and physical modeling using a modern microcontroller proved the operability of the lowfrequency part the wireless remote control modem with using phase-pulse modulation of the linear frequency-modulated signal.
 Conclusions. The possibility of using phase-pulse modulation of the linear-frequency modulated signal for the transmission of control commands is considered. This method of transmitting the information component, unlike the existing methods, does not require changing the parameters of the linear frequency modulated signal. The use in the receiver of optimal processing of a linearfrequency-modulated signal of sufficiently big base will allow of the wireless transmission of the commands for controlling a moving object in conditions of the intentional interference. The use of modern microcontrollers made it possible to conduct a practical test of the functionality of the low-frequency part the wireless remote control modem with phase-pulse modulation of the linear-frequency modulated signal through physical modeling.","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135803327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IMPROVED MULTI-OBJECTIVE OPTIMIZATION IN BUSINESS PROCESS MANAGEMENT USING R-NSGA-II","authors":"V. O. Filatov, M. A. Yerokhin","doi":"10.15588/1607-3274-2023-3-18","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-18","url":null,"abstract":"Context. Business process management is a critical component in contemporary organizations for maintaining efficiency and achieving operational objectives. Optimization of these processes in terms of time and cost can lead to significant improvements in overall business performance. However, traditional optimization techniques often face challenges in handling multi-objective problems with a known time-cost trade-off, necessitating more effective solutions. The integration of a business process model and notation for a stochastic process simulation provides a robust foundation for analyzing these business processes and complies with stateof-the-art business process management. In prior studies, we applied several heuristic algorithms, including the evolutionary NSGAII, to find a Pareto-optimal set of solutions. We defined a solution as a pair of cost and time associated with a specific resource allocation. For one of the selected processes, the performance of NSGA-II was subpar compared to other techniques.
 Objective. The goal of this study is to improve upon the NSGA-II’s performance and, in turn, enhance the efficiency of multiobjective business process optimization. Specifically, we aim to incorporate reference points into NSGA-II. Our goal is to identify an optimized set of solutions that represent a trade-off between process execution time and the associated cost. We expect this set to have a higher spread and other quality metrics, compared to the prior outputs.
 Method. To accomplish our objective, we adopted a two-step approach. Firstly, we modified the original genetic algorithm by selecting and integrating the reference points that served to guide the search towards the Pareto-optimal front. This integration was designed to enhance the exploration and exploitation capabilities of the algorithm. Secondly, we employed the improved algorithm, namely R-NSGA-II, in the stochastic simulations of the business processes. The BPMN provided the input for these simulations, wherein we altered the resource allocation to observe the impact on process time and cost.
 Results. Our experimental results demonstrated that the R-NSGA-II significantly outperformed the original NSGA-II algorithm for the given process model, derived from the event log. The modified algorithm was able to identify a wider and more diverse Pareto-optimal front, thus providing a more comprehensive set of optimal solutions concerning cost and time.
 Conclusions. The study confirmed and underscored the potential of integrating the reference points into NSGA-II for optimizing business processes. The improved performance of R-NSGA-II, evident from the better Pareto-optimal front it identified, highlights its efficacy in multi-objective optimization problems, as well as the simplicity of the reference-based approaches in the scope of BPM. Our research poses the direction for the further exploration of the heuristics to improve the outcomes of the optimization tec","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135803329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"APPLICATION OF BLOW-UP THEORY TO DETERMINE THE SERVICE LIFE OF SMALL-SERIES AND SINGLE ITEMS","authors":"V. V. Nahornyi","doi":"10.15588/1607-3274-2023-3-19","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-19","url":null,"abstract":"Context. The actual task of developing a method for determining the service life of small-series and single items based on the blow-up modes theory has been solved.
 Objective. Application of the blow-up theory in conditions where there are no statistical data on the dynamics of behaviour during the operation of small-series and single items.
 Method. To determine the service life of a particular product manufactured in large series, information obtained for a set of similar products of the same type is used. This information is based on numerous experiments, mathematical statistics and probability theory. When operating small-series and single items, such information is not available. In this case, it is necessary to determine the individual resource of an individual product based on the results of an analysis of its behaviour in the past. The method presented in the article is based on the application for such an analysis of the method used when considering systems operating in blow-up mode. The essence of the technique is to extract the periodic component from the temporal realization of the control parameter. This component is modelled by a Fourier series consisting of log-periodic functions. The main coefficients of these functions are the time equal to the operating time of the product until the end of its service life.
 Results. The method under consideration has been successfully tested in determining the service life of the transport-dumping bridge, related to products that are actually single items.
 Conclusions. An analysis of the experimental data on the behaviour of the load-bearing elements of a transport-dump bridge confirms the assumption about the behaviour of the bridge structure as a system operating in a blow-up mode. This made it possible to determine in advance the service life of the power units of the bridge and obtain the result directly in units of time, without requiring information about the maximum permissible value of the controlled parameter to obtain this information.
 For the first time, the possibility is shown to consider the behaviour of small-series and single items as dynamic systems operating in a blow-up mode.
 Practical significance. A solution to the topical problem of determining the service life of small-series and single items is proposed.","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135803328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"MODIFIED GENETIC ALGORITHM APPROACH FOR SOLVING THE TWO-STAGE LOCATION PROBLEM","authors":"O. S. Serhieiev, S. A. Us","doi":"10.15588/1607-3274-2023-3-16","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-16","url":null,"abstract":"Context. Optimization of logistics processes is one of the important tasks of supply chain management in various fields, including medicine. Effective coordination in medical logistics is essential to ensure public health and prosperity. This is especially essential during global emergencies when the rapid and efficient distribution of medicines is critical. In addition, professional logistics management is critical to delivering humanitarian aid, where the timely transportation of medical supplies and resources can be lifesaving. The most advanced technologies and algorithms are being used to improve medical logistics processes. This paper considers modifying the genetic algorithm for solving the two-stage location problem in supply chain management in the distribution of medicines and medical equipment.
 Objective. The work aims to build a model and develop an algorithm for solving a two-stage location problem in the context of the medical logistics problem with further analysis of their applications and performance.
 Method. We propose to use a genetic algorithm to solve a two-stage logistics problem. The peculiarities of this algorithm are the modification of evaluation procedures and the use of mixed mutation, which allows for solving the problem effectively, considering irregularities in the statement regarding the subject – the limits on the centers’ location at several stages of the logistic process.
 Results. The paper deals with a two-stage location problem with constraints on the maximum number of centers. Considering the specific requirements of medical logistics in the transportation context of medicines and medical equipment, a mathematical model and modification of the genetic algorithm are proposed. The developed algorithm is tested on model tasks and can produce effective solutions for problems ranging in size from 25 to 1000. The solution process takes longer for larger problems with dimensions from 1001 to 2035. Additionally, the influence of increasing the maximum generations number on the time of execution is investigated. When the maximum generation value increases from 50 to 100 and from 100 to 150 generations, the algorithm’s execution time increases by 45.69% and 51.68%, respectively. 73% of the total execution time is dedicated to the evaluation procedure. The algorithm is applied to the medical logistics problem in the Dnipropetrovsk region (Ukraine). An efficient solution is obtained within an acceptable execution time.
 Conclusions. A mathematical model for a two-stage location problem in the context of medical logistics is introduced. It considers the peculiarities of the medical field. A solution algorithm based on a genetic approach is developed and applied to the medical logistics problem. The algorithm has been tested on model tasks of varying sizes, with a comprehensive analysis conducted on the correlation between the problem size and the algorithm’s running time. In addition, it is investig","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135922788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ON THE RECURSIVE ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM ON THE BASIS OF THE DATA FLOW OPTIMIZATION METHOD","authors":"E. V. Ivohin, V. V. Gavrylenko, K. E. Ivohina","doi":"10.15588/1607-3274-2023-3-14","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-14","url":null,"abstract":"Context. The article considers a technique for the sequential application of flow schemes for distributing a homogeneous resource for solving the traveling salesman problem, which is formulated as the problem of finding a route to visit a given number of cities without repetitions with a minimum duration of movement. The task of formalizing the algorithm for solving the traveling salesman problem by the method of streaming resource distribution using the backtracking scheme is posed. The use of Orlin’s method to optimize the flow distribution on the graph is proposed.
 Objective. The goal of the work is to develop an algorithm for solving the traveling salesman problem based on the implementation of the method of streaming resource distribution and the backtracking scheme with the minimum duration of movement along the route.
 Method. This paper proposes a method for solving the traveling salesman problem by the method of streaming resource distribution with the backtracking scheme. A scheme for formalizing the procedure for solving the traveling salesman problem with the minimum duration of movement along the route is described. A variant of accelerating the speed of the developed algorithm is proposed, which consists in using a greedy technique in the procedure for selecting route sections: planning each subsequent stage of movement is determined based on the choice of the fastest direction of movement. The results of the proposed algorithm for calculating solutions to the traveling salesman problem with minimization of the duration of movement are presented, the obtained solutions are compared with the solutions found by other exact and heuristic methods.
 Results. The method for solving the traveling salesman problem using the method of streaming resource allocation and using the backtracking scheme is developed. A variant of accelerating the speed of the developed algorithm is proposed, which consists in using a greedy technique in the procedure for selecting route sections: planning each subsequent stage of movement is determined based on the choice of the fastest direction of movement. The application of the greedy approach makes it possible to obtain a constructive scheme for solving the traveling salesman problem. The results of the proposed algorithm for calculating solutions to the traveling salesman problem with minimization of the duration of movement are presented, the obtained solutions are compared with the solutions found by other exact and heuristic methods.
 Conclusions. The paper considers a method for formalizing the algorithm for solving the traveling salesman problem using the method of streaming resource allocation and the backtracking scheme. The use of Orlin’s method to optimize the flow distribution on the graph is proposed. The scheme of formalization of the procedure for using the method with the implementation of the backtracking scheme for solving the traveling salesman problem with the minimum d","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135923800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"TEST GRAPH-SCHEMES OF THE ALGORITHMS OF FINITE STATE MACHINES WORK FOR ASSESSING THE EFFICIENCY OF AUTOMATED SYNTHESIS IN XILINX VIVADO CAD","authors":"A. A. Barkalov, L. A. Titarenko, R. M. Babakov","doi":"10.15588/1607-3274-2023-3-12","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-12","url":null,"abstract":"Context. The problem of evaluating the effectiveness of the automated design of a microprogram finite state machine with the operational transformation of state codes using Xilinx Vivado CAD is considered. The object of the research was graph-schemes of control algorithms implemented by finite state machine and able to prove the effectiveness of the principle of operational transformation of state codes in comparison with standard synthesis methods built into the CAD, in the context of hardware expenses optimization.
 Objective. Development and research of graph-schemes of control algorithms in order to substantiate the effectiveness of the application of structure of the finite state machine with datapath of transitions in comparison with the built-in methods of synthesizing finite state machines in Xilinx Vivado CAD in the basis of programmable logic devices.
 Method. The research is based on the hypothetical assumption that the Xilinx Vivado CAD has built-in methods of automated design of the circuit of a finite state machine, the effectiveness of which, according to the criterion of hardware expenses, exceeds other known methods of optimizing hardware expenses in the finite state machine circuit. In order to refute this hypothesis, it is proposed to prove that in some cases known methods of hardware expenses optimization in the finite state machine circuit are more effective in comparison with the methods built into CAD. In this work, as a well-known optimization method, the method of operational transformation of state codes, which corresponds to the structure of a finite state machine with datapath of transitions, is chosen. The effectiveness of this method is demonstrated on the example of several test graph-schemes of algorithms, the structure of which is abstract and artificially adapted to the chosen optimization method. The adaptation of the selected graph-schemes of the algorithms consists in the fact that a relatively small number of transition operations is required for their implementation with the help of a finite state machine with datapath of transitions. This contributes to the simplification of the circuit of the finite state machine and the reduction of hardware costs for its implementation. At the same time, the test graph-schemes of the algorithms have the possibility of scaling, which allows to automate the construction of VHDL models of the corresponding finite state machines for graph-schemes of different sizes and to evaluate the optimization of hardware expenses for finite state machines of different complexity.
 Results. Using the example of several graph-schemes of algorithms, it is demonstrated that in some cases none of the finite state machine synthesis methods built into the Xilinx Vivado CAD is able to surpass the method of operational transformation of state codes according to the criterion of hardware expenses for the implementation of a finite state machine circuit. At the same time, a several-","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135923805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"PERFORMANCE ANALYSIS OF WIRELESS COMPUTER NETWORKS IN CONDITIONS OF HIGH INTERFERENCE INTENSITY","authors":"V. S. Khandetskyi, V. V. Gerasimov, N. V. Karpenko","doi":"10.15588/1607-3274-2023-3-15","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-15","url":null,"abstract":"Context. The decrease in the probability of successful frame transmission in the infrastructure domain of IEEE 802.11 DCF wireless network is caused both by the influence of the collision intensity and by the impact of external interference in the radio path. Using the Markov chain approach as a baseline, we explicitly expressed the dependence of the network throughput on the number of operating stations, bit error rate (BER), and the frame fragmentation factor.
 Objective. The purpose of this article is to study the influence of interference intensity on the throughput of a wireless network domain in a wide range of the number of operating stations when transmitting frames of various lengths in the absence and with the use of the fragmentation mechanism.
 Method. The performed mathematical modelling showed, that in the range of increased and high noise intensity (BER = 10–5 – 10–4), a decrease in the length of the frame data field from the standard length of 12000 bits to 3000 bits is accompanied by a decrease in the throughput for all values of the number of competing stations. At the same time, it must be noted that as the amount of the frame data decreases, the throughput becomes less susceptible to an increase in the noise intensity. Qualitatively different results are obtained in the region of very high interference intensity (BER = 2·10–4). A significant increase in the probability of frame transmission in this region observed with a decrease in the standard length of the frame data field by 2–3 times, made it possible to increase the throughput compared to the original one. This effect is especially pronounced when the length is halved.
 Results. The study of the standard frame transmitting process, but with a fragmented data field, showed that if for BER = 5·10–5 and less with an increase in fragmentation factor, the throughput values decrease, in the entire range of the number of stations due to the predominant increase in overhead costs, then in the region of high (BER = 10–4) and very high noise intensity (BER = 2·10–4) we have the opposite effect. To the greatest extent, the throughput increases when the frame data is transmitted in two equal fragments. We have made a comparison of the network throughput determined by simply reducing the length of the frame data field and using fragmentation of a standard frame. The comparison showed that the use of the fragmentation mechanism is more beneficial both when throughput is stabilized under conditions of increased noise intensity and when the throughput is increased under conditions of high and very high noise intensity.
 Conclusions. In this article, a mathematical model has been modified for direct calculation of the wireless network throughput. Using this model, we studied the changes in throughput over a wide range of BER and a number of operation stations for various values of the transmitted frame fragmentation factor. The conditions for increasing the throughput","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135922787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RECOGNITION OF REFERENCE SIGNALS AND DETERMINATION OF THEIR WEIGHTING COEFFICIENTS IF AN ADDITIVE INTERFERENCE PRESENTS","authors":"V. V. Avramenko, M. O. Bondarenko","doi":"10.15588/1607-3274-2023-3-8","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-8","url":null,"abstract":"Context. The subject matter of the article is the recognition of a reference signal in the presence of additive interference.
 Objective. The recognition of the reference signal by the obtained value of its weighting factor in conditions where additive interference is imposed on the spectrum of the reference signal at unknown random frequencies. The task is the development of a method for recognizing a reference signal for the case when the interference consists of an unknown periodic signal that can be represented by a finite sum of basis functions. In addition, interference may also include deterministic signals from a given set with unknown weighting coefficients, which are simultaneously transmitted over the communication channel with the reference signal.
 Method. The method of approximating the unknown periodic component of the interference by the sum of basis functions is used. The current number of values of the signal that enters the recognition system depends on the number of basis functions. This signal is the sum of the basis functions and the reference signal with unknown weighting coefficients. To obtain the values of these coefficients, the method based on the properties of the disproportion functions is used. The recognition process is reduced to the calculation of the weight coefficient of the reference signal. If it is zero, it indicates that the reference signal is not part of the signal being analyzed. The recognition system is multi-level. The number of levels depends on the number of basis functions.
 Results. The obtained results show that, provided that the reference signal differs by at least one component from the given set of basis functions, the recognition is successful. The given examples show that the system recognizes the reference signal even in conditions where the weighting coefficient of the interference is almost 1000 times greater than the coefficient for the reference signal. The recognition system also works successfully in conditions where the interference includes the sum of deterministic signals from a given set, which are simultaneously transmitted over the communication channel.
 Conclusions. The scientific novelty of the obtained results is that a method for recognizing the reference signal has been developed in conditions where only an upper estimate of its maximum frequency is known for the periodic component of the interference. Also, recognition occurs when, in addition to unknown periodic interference, the signals from a given set with unknown weighting coefficients are superimposed on the reference signal. In the process of recognition, in addition to the weighting factor for the reference signal, the factors for the interference components are also obtained.","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135923806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"GROWING TREE METHOD FOR OPTIMISATION OF MULTIFACTORIAL EXPERIMENTS","authors":"M. D. Koshovyi, O. T. Pylypenko, I. V. Ilyina, V. V. Tokarev","doi":"10.15588/1607-3274-2023-3-6","DOIUrl":"https://doi.org/10.15588/1607-3274-2023-3-6","url":null,"abstract":"Context. The task of planning multifactorial experiments is important in science and industrial production. In the context of competition, rising costs, and increasing efficiency, it is necessary to optimize plans for multifactorial experiments in terms of cost and time. To solve this problem, there are a number of approaches and methods, the choice of which for a competitive technical task is an important and difficult task. In this regard, there is a need to develop new methods for optimizing the cost (time) of multifactorial experiment plans, compare them with existing methods, and give recommendations for practical application in the study of real objects.
 Objective. The purpose of the study is to develop and test the method of growing trees, to evaluate its effectiveness in comparison with other methods. The following tasks has been solved to achieve this goal: the proposed method of growing trees has been implemented in the form of software; the method has been used to optimize plans for multifactorial experiments in the study of real objects; its effectiveness has been evaluated in comparison with other methods; recommendations for its use were given.
 Method. The proposed method of growing trees is based on the application of graph theory. The advantage of the method is the reduction of time for solving optimization problems related to the construction of optimal plans for multifactorial experiments in terms of cost (time) expenses. Another characteristic feature is the high accuracy of solving optimization problems.
 Results. The results of experiments and comparisons with other optimization methods confirm the efficiency and effectiveness of the proposed method and allow us to recommend it for the study of objects with the number of significant factors k ≤ 7. It is promising to further expand the range of scientific and industrial objects for their study using this method.
 Conclusions. A growing tree method has been developed for the optimization of multifactorial experimental plans in terms of cost and time expenditures, along with software that implements it using the Angular framework and the TypeScript programming language.
 The effectiveness of the growing tree method is shown in comparison with the following methods: complete and limited enumeration, monkey search, modified Gray code application, and bacterial optimization. The growing tree method is faster than complete enumeration and can be applied to optimize multifactorial experimental plans in terms of cost (time) expenses for objects with a number of factors k ≤ 7. In solving optimization problems, the method of growing trees gives better results compared to monkey search, limited enumeration and bacterial optimization.","PeriodicalId":43783,"journal":{"name":"Radio Electronics Computer Science Control","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135922791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}