No. 5 (2023)

One of the main challenges faced by researchers in the field of quantum computing is the problem
of noise in quantum systems. Noise can significantly limit the performance of quantum algorithms.
It is in this context that our research, aimed at the development and optimization of quantum
algorithms with a focus on depth, is updated. The depth of quantum circuits is one of the critical parameters
in the development of quantum algorithms. Optimized circuits with improved depth have the potential to significantly reduce the impact of noise, which in turn should lead to improved efficiency.
We aim to provide solutions that not only address technical constraints, but also provide practical
results for quantum computing in the context of optimization problems. This study analyzes the use of
a quantum approximate optimization algorithm for solving complex combinatorial optimization
problems. However, in the process of using this algorithm we encounter a serious limitation – noise
in the quantum system, which significantly reduces its efficiency. To overcome the influence of noise
and improve the efficiency of quantum algorithms, several methods have been proposed. This paper
presents a greedy heuristic algorithm aimed at reducing the impact of noise. The main goal of this
algorithm is to find a spanning tree of minimum height. This, in turn, reduces the overall depth of
quantum circuits and minimizes the number of CNOT gates, which is key to optimizing quantum
computing. Through numerical analysis, it was demonstrated that the proposed greedy heuristic
algorithm is capable of significantly increasing the probability of successful completion of each iteration
in the problem of finding the maximum cut in a graph by 10 times. Moreover, the study confirms
that the average depth of the quantum circuit generated by the proposed heuristic algorithm is still
linearly dependent on the size of the input data, but the slope of this linear dependence is reduced
from 1 to 0.11 by using the proposed method.

The use of devices with wireless data transmission has long become commonplace in today's
world. Such devices include smart watches, wireless headphones and headsets. Such devices provide
mobility and convenience with the absence of wires and high functionality. One of the significant
disadvantages of using wireless devices is a decrease in the efficiency of human perception of
the surrounding world, in particular it concerns the auditory channel of information. Especially acute such a problem arises when pedestrians crossing railroad tracks wearing headphones.
In this paper a solution to such a problem is proposed, a system of selective suppression of wireless
communication, namely Bluethooth and Wi-Fi signals is considered. Such a system based on
unique algorithms has the ability to detect the approach of pedestrians to railroad crossings using
video cameras, and based on scanning and analyzing the airwaves of surrounding wireless networks
can selectively suppress Bluetooth and Wi-Fi signals in the area of the installation. Thus,
the system disables pedestrians' wireless devices near railroad crossings, thereby drawing their
attention to the prohibited traffic signal, light and noise signaling, and approaching train. The
system is based on a master control microcontroller, which controls, via relays, the power supply
to turn on the suppressor only when wireless signals to be suppressed are detected in range or
when pedestrians are in the field of view of video cameras. In addition, the system involves a
method for estimating patterns of pedestrian behavior during wireless suppression based on neural
network-based pattern recognition, followed by interpretation of the resulting data. This will
make it possible to collect statistical information in order to analyze the reaction of people to the
operation of the system near railway crossings.

An urgent problem of developing algorithms for automatic path planning is the increase in
computational costs with an increase in the complexity of the operating environment. Graphic
planning methods, in particular the method of visibility diagrams, are not without this drawback.
As the number of obstacles increases, the complexity of a visibility graph increases, and this
growth is very fast. Therefore, techniques for reducing the complexity of the visibility graph become
the most important task. This article proposes a hybrid algorithm based on the method of
visibility diagrams and Bug algorithms. The method of path planning proposed in this article
combines a graph algorithm with Bug algorithms, which allows you to build a special graph with
nodes in the form of characteristic obstacle points. In this case, the Bug algorithm is a step in the
iterative optimization process on the graph, which allows for a finite number of steps to come to
an optimal solution on a class of piecewise polyline curves. The proposed method solves the problem
of global path search. Unlike the classical methods of line-of-sight diagrams, it significantly
reduces the dimension of the graph due to a special selection of a limited number of characteristic
points of the corresponding obstacles. The article develops and theoretically substantiates the
proposed method. The calculated relations of the algorithm are given. The optimality of the obtained
trajectory is justified. The analytical relations are confirmed by the results of numerical
modeling in various environments filled with polygonal obstacles. It is shown that in order to pave
the way for maze-type scenes with one common type of obstacles, the algorithm under consideration
is 10% superior to the optimal Dijkstra algorithm.

Hierarchical field-programmable gate arrays (FPGAs) consist of an array of programmable
logic blocks arranged into groups. Successful routing requires optimal placement of logic elements
within the groups, considering the architectural features of the local interconnections. Classical
algorithms are not able to consider these features. That’s why, the development of new algorithms
is required. In this paper, we present a detailed placement algorithm with a new metric that
allows us to estimate the number of available local interconnections inside the groups of logic
blocks, considering the architectural features of the local interconnections. The detailed placement
algorithm consists of several stages. At the first stage, the group of logic elements is transformed
into a directed graph. Then, the placement order of logic elements in the group is determined using
the breadth-first search algorithm. At the final stage, for each element, according to the obtained
order, the optimal placement in the group is determined, considering the new metric.
If there is no optimal position in the group among the free ones, the occupied positions are
checked. The current element is placed in the occupied position, and a new position is searched
for the replaced element. Such replacements can be performed repeatedly, increasing the probability
of finding the optimal placement configuration. The proposed algorithm was verified on a set
of benchmark circuits ISCAS’85, ISCAS’89, Cpu8080 and VGA. Experimental results show that
the developed algorithm reduces the number of global interconnections used for global routing by
10% on average and increases the number of local interconnections used for detailed routing by
30% on average compared to the sequential placement algorithm. The average routing time remained
unchanged.

The paper considers one of the important combinatorial optimization problems, namely the
two-dimensional packing problem for geometric figures of complex shapes. It belongs to the class
of NP-complex and difficult optimization problems. In this paper, the formulation of the twodimensional
packing problem is given and described, and a combinatorial objective function that
takes into account all constraints is introduced. Due to the complexity of this problem, a multilevel
approach is proposed, which consists in dividing the two-dimensional packing problem into 4
subproblems and solving each subproblem sequentially in a strict order. At the same time, for each
of the subtasks a unique set of objects that are not repeated in the other subtasks is defined. To
implement the multilevel approach, the authors developed a combined bioinspired algorithm
based on the methods of genetic search and bioinspired optimization. This approach allows to
significantly reduce the time of obtaining the result, partially solve the problem of preliminary
convergence of algorithms and obtain sets of quasi-optimal solutions in polynomial time. A software
package has been developed and algorithms for automated two-dimensional packing based
on the combined bioinspired algorithm have been implemented. A computational experiment on
test cases (benchmarks) has been carried out. The packing quality obtained on the basis of the
developed combined bioinspired algorithm, on average, by 2% exceeds the packing results obtained
using known algorithms at comparable solution time, which indicates the effectiveness of the proposed approach. The conducted series of tests and experiments allowed us to refine the
theoretical estimates of the time complexity of the packing algorithms. In the best case the time
complexity of the algorithms is O(n2), in the worst case - O(n3).

For dynamically changing management objects, new tasks arise in the task of information
security management, such as changing approaches to data collection and analysis, developing
dynamic scenarios for responding to information security threats. They should be solved through
the creation of algorithms, models, methods and approaches of security management applicable to
this task, including at the level of organizing processes, working with data and forming the organization's
information security architecture. In addition, for the development and formation of continuous
detection and response tools, it is necessary to propose new ways of integrating these algorithms
into the structure of the control object. At the same time, the creation of response systems
based on the new concept also involves changing the security management algorithms of such
systems in special cases, such as decentralized management, stability testing, cloud security services
and others that require separate research. At the same time, responding to information security
incidents should take into account the continuously changing threat landscape and reconfiguration
of the organization's infrastructure. Also, the development of the new concept presented in
the article was influenced by the concept of object-oriented programming in terms of the main
provisions. This work contains a description of the control concept based on a continuous detection
and response cycle, provides some algorithms and processes that distinguish the implementation
of the concept shown, as well as examples of their implementation. The practical examples
given in the article relate to issues such as the formation of the incident neighborhood, and allow
you to form the context of information security management. In addition, an approach to automation
of information security management processes is shown. The results of the work can be used
both for simulation models and for implementation as a set of information security management
processes in practical tasks. In addition, the results obtained can be integrated into orchestration
tools for information security systems, which increases the effectiveness of responding to information
security incidents.

One of the important achievements of the theory of error-correcting coding is the discovery
of graph codes and their important subset - low-density parity check codes (LDPC codes). Using
the parity check matrix of the code on the graph, one can obtain a Markov random field. LDPC
code can be embedded in an Ising model (a type of Markov random field) by using a torus topology
with negative curvature. In this case, codewords correspond to saddle points (extrema) in the
model, and trappin sets correspond to local minima. The use of LDPC codes with an increased
code distance allows for maximum separation of saddle points, and thus increases the noise resistance
of the neural network and the representation power. At the same time, the block and
sparse structure, characteristic of a torus of negative curvature, simplifies multiplexing and reduces
the number of trainable parameters of the neural network. The aim of the research is to
reduce the computational complexity and increase the accuracy of neural networks through the
use of a priori structural (quasi-cyclic) sparse graphs for a wide class of machine learning problems
on Markov random fields. The paper presents a new approach that allows the synthesis of
neural network architectures based on graph codes. The proposed approach provides an effective
representation of Markov random fields through the use of QC-LDPC matrices and tensors.
The proposed approach allows us to reduce the number of trainable parameters and logarithmically
reduce the complexity of tensor multiplexing. The proposed approach provided an accuracy
of 94.95% (1.72% to first place) of the binary classification problem “Pathfinder” of the “Long
Range Arena” competition, with more than 5 times fewer parameters (multiplications). Application
of the proposed approach to factorization problems on dense graphs, network problems, surface
meshes, covariance matrices made it possible to increase the accuracy of reconstruction using
the Frobenius metric in individual problems by more than 8 orders of magnitude in combination
with simplifying the structure of the multiplexer.

Currently, dialogue systems (chatbots) are being intensively used in almost all areas of activity,
and it is worth noting that these mechanisms have begun to be used not only in the entertainment
sector, but also in more important areas - business or even medicine. In this regard,
there is a need to develop and improve the communication system of such robots in natural language.
This article proposes a method for determining a person’s emotional state using a chatbot.
The article defines a chatbot, discusses the types of chatbots, and defines the basic principles of
their work. Based on the identified differences in the operation of algorithms for text detection by
chatbots, the most suitable technology for solving the task is described - working with neural networks.
The shortcomings of existing solutions in comparison with the method being developed are
identified and described. It is important to note that the peculiarity of the method is the combination
of technologies of intelligent chatbots and augmented reality. The article describes the general
algorithm of the method for determining the emotional state of a person using a chatbot,
which includes eight main stages. The developed and identified criteria for assessing emotions are
described: valence, intensity and sthenicity. The architecture of the developed solution, which has
a client-server approach, is presented. The server part also includes a text sentiment detection module and a response generation module, while the client includes the chat and the appearance
of the “Avatar” of the developed chatbot. The main implementation steps are described, including
the initial interface, as well as the stages of developing an augmented reality application.
The article lists the tools used for working with augmented reality (Unity 3D and the AR Vuforia
framework). The created 3D models are presented. The results of processing skeletal animation
using Perception Neuron 3 equipment and subsequent processing in Axis Studio are shown. Based
on the results of the work, a conclusion was formulated describing the qualitative difference of the
developed system in relation to the existing analogues considered, and the results of testing the
operation of the system were also presented.

Some well-known sorting algorithms may be more efficient than others according to any of the
main criteria: the number of performed operations, the execution time of elementary operations, the
used memory capacity, the parallelism degree, the functional regularity of connections in the information
graph of algorithm, etc. At the same time, it is possible to choose such sorting algorithm, which
will take up a minimum hardware resource after performance reducing operation of computational
structure. The choice of a particular algorithm directly depends on it parallelization degree, the specified
by the data processing time, the coefficient of reduction and latency of the computational structure
and the number and bit depth of the sorted elements. Sorting algorithms are information-equivalent,
since they perform the same mathematical function. However, each of algorithms is considered as an
autonomous and independent approach to solving the data ordering problem. It is known that the same
sorting network correspond to the "bubble", "inserts" and "selection" sorting algorithms. However, the
transition from one algorithm to another has not yet been described in the form of mathematical transformations.
It can be argued that the mathematical tools for describing various sorting algorithms and
sorting networks is not fully formalized for today. Because of this, there is no methodological basis for
the transition from one algorithm to another. Another method to describe the algorithm for solving the
problem is its representation in the form of an information graph. In it, the performed operations are
vertices that are combined by arcs reflecting the information dependence between operations. Transformation
of the information graph can lead to obtaining other information and equivalent algorithms.
The advantage of similar approach for the algorithm description of is the comparative simplicity of the
used conceptual tools. In this paper, the transformation rules of sorting networks are considered, on the
basis of which the transition from one network to another is performed. Each of the resulting sorting
networks can be effective at different parallelization coefficients and data processing rates, on which the
performance reduction coefficient of the implemented computational structure directly depends. Automation
of the proposed transformation methods can allow the use the different sorting algorithms, derived
from a single problem description in the form of an information graph, and depending on the specified
data processing rate.

Monitoring equipment wear is an important and urgent task that requires constant attention
and monitoring. This is due to the fact that wear and tear on equipment can lead to a decrease in
its operating efficiency, an increased likelihood of accidents or breakdown. The task of replacing
equipment is a systemic production task, in solving which it is necessary to take into account many factors that influence the efficiency of the enterprise. This paper proposes a concept for solving the
problem of timely replacement of equipment using periodic fuzzy graphs. Periodic fuzzy graph
models make it possible to adequately reflect types of uncertainty, reflect the specifics of relationships
between modeled objects, and optimization constraints; solve various cyclic problems, network
planning and management problems. In this work, the use of the mathematical apparatus of
periodic fuzzy graphs allowed a problem of a dynamic nature, which depended on two time variables,
to be reduced to a problem that depended only on the operating time of the equipment. At the
same time, it is proposed to take into account the age of equipment when determining the wear
coefficient, determined by the degree of belonging to a particular wear class. This aspect made it
possible to reduce the task to study the wear of all equipment involved in the technological process
and consider the purchase of used (not new) equipment. When determining the membership function,
it is possible to consider factors that may influence the solution of the optimization production
problem. Setting the problem in a fuzzy form makes it possible to forecast and plan the activities
of an enterprise for future recurring periods. The article contains a literature review, justifying
the relevance of the problem considered. The problem of replacing equipment considering
dynamic components is considered. Temporal graphs have been proposed to reflect the dynamics
of the production process. The use of a graph model provides a clear display of the state of equipment
during its operation. The use of periodic fuzzy graphs allows the problem of replacing
equipment to be simplified by reducing one time component and to scale the classical dynamic
problem considering uncertain initial data.

The rapid development of telemedicine in the healthcare sector facilitates the active implementation
of various methods and models for remote monitoring of human health indicators. In
this regard, significant attention is paid to the development of mobile applications capable of
providing accurate and timely monitoring of key health indicators in real-time. The aim of this
research is to evaluate the applicability of the proposed method and model for remote monitoring
of human health indicators, and to analyze the effectiveness of the developed mobile application
HelpMeTracker in identifying deviations in human body temperature indicators. To assess the
functionality of the proposed health monitoring method, a comprehensive experiment was conducted,
which included participants from different age categories and social groups. During the
experiment, the application was to analyze and track the dynamics of changes in human body temperature
indicators using sensors integrated into smartwatches or fitness trackers, and timely
notify about detected anomalies for the possibility of rapid response to changes in health status. The results obtained during the conducted research demonstrate that the proposed model and
method for remote monitoring of human health indicators have a high degree of effectiveness for
observing the current health status. During the experiment, the HelpMeTracker application reliably
detected all deviations in body temperature indicators obtained from sensors of wearable devices
and successfully informed all participants of the process. Based on the obtained results, it
can be concluded that the application of the proposed approach for remote monitoring is sufficient
to capture deviations in body temperature indicators, track the dynamics of changes, and form a
substantiated comprehensive assessment of human health based on the information received from
the device sensors.

This paper considers the problem of automatic text annotation. The formulation of the problem
is considered. The relevance and importance of developing effective methods and software
systems for solving the problem of automatic text summarization in modern information systems is
substantiated. Definitions of the concepts “data” and knowledge are given.” A list of tasks related
to the Data Mining direction is described. The Text Mining problem and existing methods for solving
it are described in detail. The problem of summarizing texts is considered. The main stages of
solving the summation problem are highlighted. The main methods of automatic text processing
are described, their advantages and disadvantages are highlighted. Abstractive summarization
and extractive summarization methods are discussed in detail. A comparative analysis of the effectiveness
of various abstracting and quasi-abstracting methods has been carried out, their key advantages
and disadvantages have been highlighted. A brief description of the encoder-decoder
architecture is given from the point of view of using this architecture in the developed algorithm for automatic text summarization. A description of the model of recurrent neural networks is given,
the advantages and disadvantages of such models are noted. The architecture of a recurrent
neural network is considered in relation to solving the problem of automatic text summarization. A
description of the modified model of a recurrent neural network – a neural network with long
short-term memory – is given. A description of the proposed automatic abstracting algorithm and
the settings of its main parameters are given. A description of the developed automatic abstracting
software subsystem is given. Computer modeling is performed and the results obtained during
computational experiments are presented. The quality of the solutions obtained was assessed. The
optimal parameters of the developed software system are determined. Directions for continuing
research are formulated.

The paper examines the problem of integrating the system of electrodynamic equations of
the atmosphere surface layer for various cases of the electrode effect. The original system of differential
equations of the electrode effect is reduced to the so-called total current equation, which
is a second-order equation of parabolic type, considered in a two-dimensional space-time region.
The total current equation allows us to relate the set of main factors influencing the state of the
electric field in the atmosphere surface layer: conduction current, turbulent current and current
arising as a result of convective processes in the atmosphere with the so-called total current in the
surface layer, reflecting changes in the potential of the ionosphere. The described method provides
significant advantages in the study, since within the framework of one model it allows the formulation
of various problems of the surface layer electrodynamics and a comparative analysis of the
influence of both individual factors and their combinations on the behavior of the electric field in
the surface layer. The purpose of the work is to analyze the mathematical aspects of the models
under consideration from the point of view of approaches to integrating the total current equation.
The study compares the features of physical formulations and their influence on the structure of
mathematical models and their properties from the point of view of mathematical physics. The
various physical formulations considered show that even in a relatively simple mathematical model
consisting of one equation supplemented with initial boundary conditions, a fairly wide range of
both model formulations and approaches to integrating the considered models arises.

The paper considers the problems associated with the organization of the computing process
in monitoring systems with mobile components based on a distributed ledger (DL), including the
task of redistributing the computing load. The requirements for the functioning of modern distributed
monitoring systems include the coordinated operation of nodes of the entire system belonging
to various layers of the computing environment, including foggy and edge layers, which are highly
dynamic. The joint use of DL technologies and mobile components as part of distributed monitoring
systems makes it possible to expand the range of tasks solved by such systems, including due to
the fact that it removes issues related to the synchronization of geographically distributed copies
of data. However, with such an organization of a distributed system, it is necessary to take into account the following features of the computing environment: latency associated with data synchronization
at DL nodes, changes in the geographical location of mobile components, limited
onboard energy resources and high dynamism of the fog and edge layers. Previous studies have
shown that in highly dynamic computing environments, the use of the search space reduction
method based on ontological analysis is effective. For the correct operation of this method, it is
necessary to develop an ontological model reflecting the features of the considered computing and
communication environment, including DL and mobile components. In this paper a new ontological
model of the functioning of a distributed monitoring system has been developed, taking into
account the presence of mobile components and DL nodes. Production rules for placing computational
load in foggy and edge layers have been developed and a software model has been implemented
based on them, which allowed a number of computational experiments to be carried out.
The results of experimental studies have demonstrated the effectiveness of the proposed approach
and the adequacy of the developed ontological model.

The equipment powered by built-in batteries has become widespread: unmanned aerial vehicles,
portable radios, tactical flashlights, electric vehicles, etc. Charging of batteries is often
carried out in a contact way – by connecting a power source by means of a detachable connection.
This requires the presence of technical personnel for maintenance and replacement of batteries;
requires the organization of protection of the battery connection from environmental influences
(moisture, dirt, etc.), as well as protection against electric shock to personnel. The purpose of the
research is to develop technical means of wireless transmission of electrical energy, which will
eliminate the use of detachable connections, improve electrical safety, and, most importantly, will
make it possible to make the charging process automatic. The results of the work are relevant for
the implementation of automatic cargo delivery systems using unmanned vehicles; for the implementation
of automatic charging systems for urban electric vehicles; for the implementation of automatic charging of unmanned land, floating (including underwater) and aircraft (reconnaissance,
patrol, etc.). The design of a wireless power transmission system with a power of up to
250 W, suitable for charging 6-cell lithium batteries, is described. The system works with coils
with a diameter of 200 mm, full operability is maintained for a distance between the coils centers
up to 100 mm. The efficiency in the entire range of operation modes is not lower than 74%, when
measured from the 220 V mains to the output to the battery. When designing, the goal was to minimize
the weight of the receiving part to facilitate its installation on the UAV and minimize the
impact on its thrust-to-weight ratio.

For the first time, a circuit design solution with an increased maximum output voltage rise
(decay) rate of a family of classic AB class output stages, which are the basis of many integrated
circuits of operational amplifiers (544UD1, 153UD4, A741, etc.), is presented. For this purpose,
special elements of transient process in the large signal mode are introduced into the basic circuits
of the output stages. The circuitry of this class is implemented on both bipolar (BJT) and
CMOS transistors. The results of computer simulation in the LTspice XVII simulation software
show that, in comparison with classical circuits, due to the introduction of an additional differentiating
capacitor and an input emitter repeater, the maximum rate of decay in the output voltage of
the output stages increases by more than 500 times. At the same time, the considered output stage
circuits provide output voltages with maximum amplitude from - 8.5 V to + 10 V with a relatively
low load resistance (up to 2 kOhm) and supply voltages of ± 10 V. It is shown that for small-scale
production of the proposed output stages, their execution on basic matrix crystals MH2XA031 is
recommended (OJSC “Integral”, Minsk, Belarus), which will reduce the cost-effectiveness of
manufacturing microelectronic products. The basic matrix crystal MH2XA031 based on the 3CBiT process technology allows the proposed schemes to operate at low temperatures (up to - 197 °C),
as well as under the influence of penetrating radiation with an absorbed dose of gamma quanta
(up to 1 Mrad) and a neutron flux (up to 1013 n/cm2).

Based on the analysis of domestic and foreign regulatory documents, the features of the use
of the radio frequency spectrum in the Russian Federation for unmanned aircraft systems (UAS)
are considered. The types of radio channels for communication between the UAS and the ground
control station are considered and the frequency ranges allowed for use for communication with
the UAS according to the regulatory framework of the Russian Federation are determined. Licensed
ranges include 117.975–137 MHz; 5030–5091 MHz; 5850–6425 MHz, but it is possible to
use unlicensed bands 137–174 MHz; 395–400 MHz; 430–460 MHz: 433.05–434.79 MHz;
860–880 MHz; 902–928 MHz; 1100–1400 MHz; 2400–2483.5 MHz. It is shown that there is a
problem of using unlicensed frequency ranges due to restrictions on the parameters of radio emission
and ranges of mobile communication systems due to the lack of a regulatory framework.
The regulatory framework defines the requirements for the radiation levels of radio-electronic
means (RES) BASS in licensed ranges that should not exceed 100 MW. Currently, in the Russian
Federation there are no regulatory requirements for the technical parameters of RES BAS for
their radio channels in unlicensed ranges, but there are restrictions on short-range devices using
these ranges. At the same time, there are a number of regulatory documents of other countries that
determine the signal levels in flight control channels. The possibilities of using UAS for radio
monitoring purposes are considered using the example of the trial operation of the Orlan-10 unmanned
aerial vehicle (UAV), taking into account existing restrictions in the field of the regulatory
framework. It is shown that there are a number of restrictions for their effective use for radio monitoring
purposes: in the field of the regulatory framework, technical characteristics of antennas
and the dependence of the results on the flight altitude. Limitations due to climatic factors are also
an important factor. Moreover, it is precisely for hard-to-reach areas with difficult climatic conditions
that this monitoring method is the most promising.

The paper presents a schematic solution and a description of the operation of a bidirectional
DC-AC converter with transformer isolation. The topology is based on the principles used in
resonant LLC converters and dual active bridges (DAB), but the proposed design uses bipolar
inverter topology on the AC voltage side, as well as combined frequency and pulse width control.
This makes it possible to implement a number of functions in a single converter using a small
number of commutations in the power circuit. So, it is possible to implement the following operating
modes: an uninterruptible power supply (conversion of a battery DC voltage to a 220 V 50 Hz
AC); a grid-tie inverter for alternative sources (solar panels); a battery charger (operating both
from the mains and from solar panels); a welding inverter for semi-automatic welding (and welding
can be carried out both from mains, and from the battery); an AC voltage regulator; a DC/DC
voltage converter (for “cranking up” batteries with different voltages or state-of-charge). A device
with the listed set of functions can be used, for example, in the field – for organizing power supply
of various loads, charging batteries, as well as performing minor welding operations. The circuit
topology of the converter allows, when using appropriate control algorithms, to work with a power
factor close to unity on the AC voltage side. This makes it possible to ensure operation in a
"weak" grid – from an autonomous generator, with a large length of the power cord, etc.