<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>V. Mukhin);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Vadym Mukhin, Valerii Zavgorodnii, Anna Zavgorodnya, Oleksandr Yarovyi, Lesia Baranovska and Oleg Mukhin</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"</institution>
          ,
          <addr-line>37, Prospect Beresteiskyi, Kyiv, 03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>mission objectives. Current</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>This paper examines the network-centric approach for enhancing the efficiency of mobile agent control. The primary distinction of this approach is the use of a "wandering center." If communication with the active center is lost, a new center is appointed to continue control, ensuring the system's survivability and improving the overall efficiency of mobile agent management. An experimental study was conducted to evaluate the parameters and effectiveness of network-centric control of mobile agents. The study utilized a developed model of mobile agent interaction based on networkcentric control, along with a simulation model of agent behavior in a dynamic environment. Additionally, a neural network was created that accurately predicts the probability of hitting the target (%) under changing dynamics. The use of this neural network also helped identify input parameters with minimal impact on the outcome.</p>
      </abstract>
      <kwd-group>
        <kwd>Mobile agent</kwd>
        <kwd>network-centric control</kwd>
        <kwd>dynamic environment</kwd>
        <kwd>neural networks</kwd>
        <kwd>simulation model 1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Today, most existing mobile agents are controlled manually using remote controls that operate on
radio channels. However, this manual control poses several challenges, including the need for
specialized operator training, limited operational range, and dependency on weather conditions [1,</p>
      <p>
        In model aviation and professional applications such as the civil sector, agriculture, military, law
enforcement, and other fields, mobile agents are in high demand. Selecting the optimal models and
control systems is crucial for effectively monitoring ground-based targets [
        <xref ref-type="bibr" rid="ref8 ref9">11, 12</xref>
        ].
      </p>
      <p>
        Thus, pilotless mobile agents present a more efficient and economical alternative to manned
aircraft for many tasks [
        <xref ref-type="bibr" rid="ref10 ref11 ref12">13–15</xref>
        ].
      </p>
      <p>
        The main challenge in controlling mobile agents lies in the reliance on centralized control systems,
where the control center serves as a vulnerable element; if communication with it is lost, further
control becomes impossible. In contrast, decentralized control faces issues with coordinating and
circulating large volumes of information, leading to slower response times. A promising alternative
is a network-centric approach, which allows control to be transferred to an alternative center when
needed [
        <xref ref-type="bibr" rid="ref13 ref14 ref15">16–18</xref>
        ].
      </p>
      <p>An analysis of recent scientific literature reveals that, although modern information technologies
have advanced considerably, the network-centric approach to control remains underdeveloped
compared to centralized and decentralized methods.</p>
    </sec>
    <sec id="sec-2">
      <title>2. A network-centric approach to enhancing the efficiency of mobile agent control systems</title>
      <p>Three main approaches to the control of mobile agents can be identified: centralized, decentralized,
and network-centric. In centralized control, a single command center issues control signals to all
mobile agents. If this center is disabled or compromised, all mobile agents lose connectivity and
cannot be controlled.</p>
      <p>
        Decentralized control, while reducing dependence on a single command point, has the drawback
of coordination challenges. For example, if mobile agents need to rapidly reconfigure, a large amount
of information must be transmitted to them, significantly reducing the overall speed of the control
system [
        <xref ref-type="bibr" rid="ref16 ref17">19, 20</xref>
        ].
      </p>
      <p>The network-centric approach is designed to address the limitations of the previous models. This
approach integrates all forces and resources into a single information system, enabling control
objectives to be met even in dynamic, complex environments that are subject to unpredictable
interference. Such interference can be irregular, intermittent, and variable, yet network-centric
control is still effective under these conditions [21, 22].</p>
      <p>Consider a control network that a subset of mobile agents follows. Among the entire group of
mobile agents, approximately 10% are selected as nodes that hold partial control information (Fig. 1).
These nodes, equipped with control functions, form a network, and from them, one is designated as
the primary control center [23, 24].</p>
      <p>Only the node mobile agents (NMA) are coordinated directly by the control center; these nodes,
in turn, control the remaining mobile agents (MA). This setup minimizes communication interference
since individual control of each node could overwhelm communication channels. For example, if the
command is to change direction quickly, adjusting the coordinates for each mobile agent individually
would require significant time. Furthermore, if there is only one primary control agent and it
suddenly stops responding, is damaged, or is compromised, all mobile agents would lose direction,
become vulnerable to interception, or cease to operate [25–27].</p>
      <p>A network-centric system consists of a primary control mobile agent (MMA) that continuously
sends commands to other mobile agents, setting parameters such as movement direction [28, 29].
Alongside commands, it also relays information from the control center to the node mobile agents. If
the primary control agent fails for any reason, copies of all information, including control data for all
mobile agents, are preserved within the node mobile agents. In this way, an adversary would need to
disable every node agent to compromise the entire network – a challenging task since the enemy
cannot readily identify which agents’ function as nodes. This network organization enhances the
resilience of the control system.</p>
      <p>A key feature of a network-centric system is its “wandering center.” If the primary control mobile
agent is identified and disabled by an adversary, the stability of the system remains unaffected, as
control can quickly be reassigned. A new control agent is selected from the remaining active node
agents, allowing for seamless continuity. This flexibility means that control can be handed over to
another node at any moment, ensuring sustained operation. In this network-centric mobile agent
control system, two types of information are managed:
 control: this includes global coordinates transmitted from the control center to the main
control agent.
 command: this includes the coordinates transmitted by the control agent to node agents,
which then relay local coordinates to other agents. Thus, mobile agents navigate based on local
rather than global coordinates, as provided by the node agents.</p>
      <p>In summary, a key strength of the network-centric approach is the use of a roving control center.
If connections to the current center are lost, a new center is assigned to maintain control. This design
ensures system survivability, thereby greatly enhancing the overall effectiveness of mobile agent
control.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Evaluation of the Effectiveness of Network-Centric Control for</title>
    </sec>
    <sec id="sec-4">
      <title>Mobile Agents in a Dynamic Environment</title>
      <p>Based on the network-centric control algorithm model for mobile agents in dynamic environments
and the simulation model of interacting mobile agents, it is essential to conduct experimental studies
to assess parameters and evaluate the effectiveness of network-centric control.</p>
      <p>To validate the scientific and methodological framework developed, we performed mathematical
modeling to analyze the effectiveness of network-centric control for mobile agents in a dynamic
environment.</p>
      <p>The software tools used in this study include:
 Simulations were performed on a personal computer with an Intel® Celeron® processor (3.2 GHz)
and 16 GB of RAM running on Microsoft Windows 10.
 Microsoft SQL Server 2022 was utilized as the database management system.
 Microsoft Visual Studio 2022 Community Edition served as the development environment.
Development was conducted in C# using an object-oriented approach.
 Experiments in the simulation environment included setting initial parameters, performing
intermediate calculations, and visualizing results with Windows Presentation Foundation.</p>
      <p>The minimum required percentage of node mobile agents % (nodePercentage) needed to reach the
target was calculated as follows. A target is considered "hit" if both of the following conditions are
met:
 The percentage of mobile agents that reached the target (targetHitPercentage) must be at least
equal to the required percentage of mobile agents needed to hit the target (targetHitPercentage).
 Among the mobile agents that reached the target, there must be at least one node mobile agent
(targetReachedCount &gt; 0).</p>
      <p>To evaluate these conditions, 100 experimental trials were conducted, using the following
parameters:
 Number of mobile agents (numberOfAgents): 100.
 Minimum percentage of mobile agents required to hit the target (targetHitPercentage): 5%.
 Percentage of node mobile agents (nodePercentage): ranging from 1% to 20% of the total number
of mobile agents.
 Initial (startLatitude, startLongitude) and target (targetLatitude, targetLongitude) geographic
coordinates for node mobile agents.
 Percentage of mobile agents that lost communication (lossPercentage), randomly generated
between 50% and 90%. For each agent that lost communication, the geographic coordinates were set
to NULL.</p>
      <p>The experimental results were used to plot graphs illustrating the relationship between the
percentage of node mobile agents % (nodePercentage) and the probability of hitting the target
(targetHitPercentage) in each experiment (Fig. 2).</p>
      <p>Based on the experimental results, the average effectiveness of target hits with varying numbers
of node mobile agents was analyzed (see Table 1 and Fig. 3).





16% or more node mobile agents: 100% effectiveness.
12–15% node mobile agents: 95% effectiveness.
10–11% node mobile agents: 90% effectiveness.
7–9% node mobile agents: 80% effectiveness.</p>
      <p>0–6% node mobile agents: less than 80% effectiveness.</p>
      <p>From the above, it can be concluded that to achieve effective target damage (80% and above), the
minimum required number of node mobile agents (nodePercentage) is between 7% and 9%. Therefore,
using more than 9% of node mobile agents out of the total number of mobile agents is not advisable.</p>
    </sec>
    <sec id="sec-5">
      <title>4. Evaluation of the Effectiveness of Network-Centric Control for</title>
    </sec>
    <sec id="sec-6">
      <title>Mobile Agents in a Dynamic Environment Using Neural Networks</title>
      <p>Evaluating the effectiveness of network-centric control for mobile agents in a dynamic environment,
using neural networks, plays a crucial role in determining the suitability of this approach for various
tasks. The main stages of this method can be described as follows:
1. Training Data Preparation: collect and prepare a large dataset representing different
scenarios and dynamic environmental conditions.
2. Creating a Dataset for Network Training: split the collected data into training and test sets to
evaluate the network's adaptability to new situations.
3. Designing and Configuring the Neural Network:
 develop a neural network architecture suited for controlling mobile agents in dynamic
environments.</p>
      <p> set the parameters and functions to optimize training.
4. Neural Network Training: use the training set to teach the network to recognize and solve
agent control tasks in various environments.
5. Validation and Performance Evaluation:
 use the test set to assess the network’s accuracy and efficiency under real-world
conditions.</p>
      <p> analyze the results in the context of specific tasks and environmental constraints.
6. Improvement and Adaptation:
 use the results to refine the network architecture and its parameters.</p>
      <p> adapt the network to changes in environmental dynamics and control tasks.</p>
      <p>The process of training and creating the neural network was carried out using the Deductor Studio
Academic analytical platform, which provides highly efficient tools for data analysis and processing.
A critical step in this process was utilizing a specially created and carefully prepared dataset to train
the network.</p>
      <p>The dataset included information from solving 1,000 different problems, which played a key role
in enhancing the adaptability and accuracy of the neural network. This approach to data preparation
contributed significantly to the network’s ability to solve diverse tasks and ensured its high efficiency
across various contexts.</p>
      <p>For the parameters listed in Table 2, a mechanism for estimating the probability of target damage
(%) based on the neural network can be applied.
targetHitPercentage
targetHitCount
nodePercentage
nodeCount
startLatitude
startLongitude
targetLatitude
targetLongitude
lossPercentage
lossCount
targetHitProbability</p>
      <p>The number of mobile agents that will be enough to hit the target, %
The number of mobile agents that will be enough to hit the target, units.</p>
      <p>Number of nodal mobile agents, %
Number of nodal mobile agents, units
Initial geographic coordinates of the mobile agent (latitude), degrees.</p>
      <p>Initial geographic coordinates of the mobile agent (longitude), degrees.</p>
      <p>Final geographical coordinates of the mobile agent (latitude), degrees.</p>
      <p>Final geographic coordinates of the mobile agent (longitude), degrees.</p>
      <p>Number of mobile agents with which communication was lost, %
The number of mobile agents with which communication was lost, units.</p>
      <p>Probability of hitting the target, %</p>
      <p>The parameters from Table 2 were provided as input data for building a neural network (Fig. 4).</p>
      <p>Based on the results of the correlation analysis of the raw data, it was determined that not all fields
should be used for neural network training. Only the fields listed in Table 3 are relevant, as the
remaining fields have an insignificant impact on the resulting value (Fig. 5).</p>
      <p>The obtained dataset was used to train a multilayer perceptron neural network. The following
network structure was established: five layers of neurons, with the first (input) layer containing 7
neurons, three hidden layers containing 7, 3, and 5 neurons respectively, and the fifth (output) layer
containing 1 neuron. The activation function used is sigmoid. The architecture of the network –
defined by the number of layers, their sizes, and the activation function – determines its ability to
solve specific tasks. This framework demonstrates how data moves through the network, from the
input to the output layer, with each layer performing calculations using weights and the activation
function. The backpropagation method was employed for training.</p>
      <p>The schematic representation of the neural network structure is shown in Figure 6, where the line
colors indicate the values of the weighting factors. The output of the neural network is the probability
of a target being hit (%). By applying the parameters of a different task to the input, the network
generates a predictive output for the probability of hitting the target (%).</p>
      <p>During the training of the neural network, the probability values of hitting the target (%) were
obtained. On average, the deviation across 1,000 experiments was 3.8%. This suggests that the neural
network trained using this methodology yields results that closely match the efficiency of the mobile
agent control system (Table 4).</p>
      <p>The structure of the neural network selected for training resulted in the smallest relative
calculation error, while errors for other network configurations exceeded 5%. Therefore, the
constructed neural network can be effectively used to solve similar problems, as it accurately reflects
the results and allows for the estimation of the probability of hitting the target (%) in dynamically
changing environments. Additionally, the use of the neural network helped identify input parameters
with minimal impact on the outcome.</p>
    </sec>
    <sec id="sec-7">
      <title>5. Conclusions</title>
      <p>This study reviews the network-centric approach as a method for enhancing the efficiency of mobile
agent control systems. The key distinction of this approach, compared to others, is the use of a
"wandering center." If communication with the current center is lost, a new center is appointed,
ensuring the continuity of the control process. This structure guarantees the system's survivability
and, as demonstrated, offers significant potential for improvement, ultimately increasing the overall
efficiency of mobile agent control.</p>
      <p>The research highlights the effectiveness of network-centric control when compared to centralized
control (in which no nodal mobile agents are used). It was found that as the number of nodal mobile
agents increases, the effectiveness of hitting the target improves. Notably, effective performance (80%
or higher) is achieved with just 9% of the total number of mobile agents functioning as nodal agents,
suggesting that exceeding this threshold would not provide additional benefits.</p>
      <p>Finally, the results from the mobile agent control system were compared with the output from the
neural network training, which estimates the probability of hitting the target with a relative deviation
of 3.8%. This confirms that the neural network, trained using the proposed methodology, produces
results that closely align with the efficiency of the mobile agent control system.</p>
    </sec>
    <sec id="sec-8">
      <title>References</title>
      <p>[1] Moutinho A. Modeling and nonlinear control for airship autonomous flight. Instituto Superior</p>
      <p>Tecnico, Technical University of Lisbon. 2017. P. 55–65.
[2] Fukau T., Kanzawa T., Osuka K. Inverse optimal tracking control of an aerial blimp robot.</p>
      <p>Proceedings of the 5th International Workshop. Robot Motion and Control. 2015. P. 193–198.
[3] Ko J., Klein D., Fox D., Haehne D. Gaussian Processes and Reinforcement Learning for
Identification and Control of an Autonomous Blimp Proc. of the IEEE Int. Conf. Robotics and
Automation. 2017. P. 742–747.
[21] Canfora G. Formal Tool for Identifying Mobile Malicious Behavior. IEEE Transactions on</p>
      <p>Software Engineering. 2019. Vol. 45. P. 1230–1252.
[22] How J., Frazolli E., Chowdhary G. Linear Flight Control Techniques. Handbook of Unmanned</p>
      <p>Aerial Vehicles. Dordrecht; Heidelberg; New York; London: Springer. 2018. P. 529–576.
[23] Lotfi A. Zadeh. 1994. Fuzzy logic, neural networks, and soft computing. Commun. ACM 37, 3
(March 1994), 77–84. DOI:https://doi.org/10.1145/175247.175255
[24] Varley TF, Sporns O, Schaffelhofer S, Scherberger H, Dann B. Information-processing dynamics
in neural networks of macaque cerebral cortex reflect cognitive state and behavior. Proc Natl
Acad Sci US A. 2023 Jan 10; 120(2): e2207677120. DOI:https://doi.org/10.1073/pnas.2207677120
[25] Paulo Vitor de Campos Souza. Fuzzy neural networks and neuro-fuzzy networks: A review of
the main techniques and applications used in the literature. Applied Soft Computing. Vol. 92.
2020. ISSN 1568-4946. DOI:https://doi.org/10.1016/j.asoc.2020.106275
[26] AM Zador. A critique of pure learning and what artificial neural networks can learn from animal
brains. Nat Commun 10, 3770 (2019).https://doi.org/10.1038/s41467-019-11786-6
[27] V. Mukhin, V. Zavgorodnii, V. Liskin, S. Syrota, V. Koval, L. Honchar. Classification of
Information Objects with Fuzzy Parameters in E-Learning Systems. IEEE 12th International
Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and
Applications (IDAACS). Dortmund. Germany. 2023. P. 1189-1193. DOI:
https://10.1109/IDAACS58523.2023.10348768
[28] Ghafor K. Multifunctional Models, Including an Artificial Neural Network, to Predict the
Compressive Strength of Self-Compacting Concrete. Applied Sciences. 2022; 12(16):8161.</p>
      <p>DOI:https://doi.org/10.3390/app12168161
[29] Vadym Mukhin; Yaroslav Kornaga; Yurii Bazaka; Ievgen Krylov; Andrii Barabash; Alla
Yakovleva; Oleg Mukhin "The Testing Mechanism for Software and Services Based on Mike
Cohn's Testing Pyramid Modification," 2021 11th IEEE International Conference on Intelligent
Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS),
Cracow, Poland, 2021, pp. 589-595, doi: 10.1109/IDAACS53288.2021.9660999.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Braykovs'ka,</article-title>
          <string-name>
            <surname>O. Yarovyi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Zavgorodnya</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Liskin</surname>
            ,
            <given-names>O. Mukhin.</given-names>
          </string-name>
          <article-title>The Method of Restoring Parameters of Mobile Agents in a Unified Dynamic Environment Considering Similarity Coefficients</article-title>
          .
          <source>International Journal of Computer Network and Information Security (IJCNIS)</source>
          . Vol.
          <volume>15</volume>
          . No. 4. R.
          <volume>25</volume>
          -
          <fpage>35</fpage>
          .
          <year>2023</year>
          . DOI: https://doi.org/10.5815/ijcnis.
          <year>2023</year>
          .
          <volume>04</volume>
          .03
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Kwon</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seo</surname>
            <given-names>J</given-names>
          </string-name>
          .
          <article-title>Vector field guided auto-landing control of airship with wind disturbance</article-title>
          .
          <source>Proceedings of the 19th World Congress, Cape Town</source>
          , South Africa.
          <year>2014</year>
          . P.
          <volume>1114</volume>
          -
          <fpage>1119</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Dodonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgorodnya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          .
          <article-title>Method of Parallel Information Object Search in Unified Information Spaces</article-title>
          .
          <source>International Journal of Computer Network and Information Security (IJCNIS)</source>
          . Vol.
          <volume>13</volume>
          . No. 4. P.1-
          <fpage>13</fpage>
          ,
          <year>2021</year>
          . DOI: https://doi.org/10.5815/ijcnis.
          <year>2021</year>
          .
          <volume>04</volume>
          .01
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Cortes</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martinez</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karatas</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bullo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          (
          <year>2002</year>
          )
          <article-title>Coverage control for mobile sensing networks</article-title>
          .
          <source>IEEE Conference on Robotics and Automation. Arlington, VA</source>
          , pp.
          <fpage>1327</fpage>
          -
          <lpage>1332</lpage>
          . DOI:https://doi.org/10.48550/arXiv.math/0212212
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Dodonov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukhin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorodnii</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornaga</surname>
          </string-name>
          , Ya.,
          <string-name>
            <surname>Zavgorodnya</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Method of searching for information objects in unified information space</article-title>
          .
          <source>System research and information technologies. N1</source>
          . P.
          <volume>34</volume>
          -
          <fpage>46</fpage>
          . DOI:https://doi.org/10.20535/SRIT.2308-
          <fpage>8893</fpage>
          .
          <year>2021</year>
          .
          <volume>1</volume>
          .
          <fpage>03</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Golembo</surname>
            ,
            <given-names>VA</given-names>
          </string-name>
          , Bochkaryev,
          <string-name>
            <given-names>O.Yu.</given-names>
            ,
            <surname>Tsyzh</surname>
          </string-name>
          ,
          <string-name>
            <surname>AM</surname>
          </string-name>
          (
          <year>2006</year>
          )
          <article-title>The task of forming individual zones of responsibility by a team of mobile agents</article-title>
          .
          <source>Visn. National Lviv Polytechnic University</source>
          . Vol.
          <volume>573</volume>
          . P.
          <volume>62</volume>
          -
          <fpage>67</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Mukhin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornaga</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bazaliy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorodnii</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krysak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mukhin</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>Obfuscation Code Techniques Based on Neural Networks Mechanism</article-title>
          .
          <source>IEEE 2nd International Conference on System Analysis &amp; Intelligent Computing (SAIC)</source>
          . Kyiv. Ukraine. P. 1-
          <fpage>6</fpage>
          . DOI:https://doi.org/10.1109/SAIC51296.
          <year>2020</year>
          .9239247
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Chikriy</surname>
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baranovskaya</surname>
            <given-names>L.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chikriy</surname>
            <given-names>A.A.</given-names>
          </string-name>
          (
          <year>2000</year>
          )
          <article-title>An approach game problem under the failure of controlling devices</article-title>
          .
          <source>J. of Automation and Information Sciences</source>
          . Vol.
          <volume>32</volume>
          , No. 5. P. 1-
          <fpage>8</fpage>
          . DOI:https://doi.org/10.1615/JAutomatInfScien.v32.
          <year>i5</year>
          .
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Baranovska</surname>
            <given-names>L.V.</given-names>
          </string-name>
          <article-title>Quasi-linear differential-difference game of approach</article-title>
          .
          <source>Understanding Complex Systems</source>
          .
          <year>2019</year>
          . P.
          <volume>505</volume>
          -
          <fpage>524</fpage>
          . DOI:https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -96755-4_
          <fpage>26</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [13]
          <string-name>
            <surname>El-Zahar</surname>
            <given-names>E</given-names>
          </string-name>
          .
          <article-title>Applications of Adaptive multi-step differential transform method to singular perturbation problems arising in science and engineering</article-title>
          .
          <source>Appl. Math. Inf. Sci</source>
          .
          <year>2015</year>
          . Vol.
          <volume>9</volume>
          , no. 1. P.
          <volume>223</volume>
          -
          <fpage>232</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Gusynin</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gusynin</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tachinina</surname>
            <given-names>H.</given-names>
          </string-name>
          <article-title>The use of differential transformations for solving nonlinear boundary value problems</article-title>
          .
          <source>Proceedings of NAU</source>
          .
          <year>2016</year>
          . No.
          <volume>4</volume>
          (
          <issue>69</issue>
          ). P.
          <volume>45</volume>
          -
          <fpage>55</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Mukhin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorodnii</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornaga</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baranovska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Algorithm for the Information Space Forming and the Evaluation of Input Objects Search Efficiency</article-title>
          . CEUR Workshop Proceedings this link is disabled. 3241. P.
          <volume>193</volume>
          -
          <fpage>204</fpage>
          . URL:https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>3241</volume>
          /paper18.pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Liu</surname>
            <given-names>Feng</given-names>
          </string-name>
          ,
          <source>Guo Wei-Wei. Research and Design of Task Scheduling Method Based on Grid Computing. International Conference on Smart City and Systems</source>
          Engineering (ICSCSGridE). Changsha, China.
          <year>2017</year>
          . P.
          <volume>188</volume>
          -
          <fpage>192</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Sheikh</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shahid</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nagaraju</surname>
            <given-names>A</given-names>
          </string-name>
          .
          <article-title>A novel dynamic task scheduling strategy for computational grid</article-title>
          .
          <source>International Conference on Intelligent Communication and Computational Techniques (ICCT)</source>
          .
          <year>2017</year>
          . P.
          <volume>102</volume>
          -
          <fpage>107</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Mukhin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorodnii</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornaga</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavgorodnya</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krylov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rybalochka</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kornaga</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Belous</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Devising a method to identify an incoming object based on the combination of unified information spaces</article-title>
          .
          <source>Eastern-European Journal of Enterprise Technologies</source>
          .
          <volume>3</volume>
          (
          <issue>2</issue>
          (
          <issue>111</issue>
          ). P.
          <volume>35</volume>
          -
          <fpage>44</fpage>
          . DOI:https://doi.org/10.15587/
          <fpage>1729</fpage>
          -
          <lpage>4061</lpage>
          .
          <year>2021</year>
          .229568
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Aron</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chana</surname>
            <given-names>I</given-names>
          </string-name>
          .
          <article-title>Grid Scheduling Heuristic Methods: State of the Art</article-title>
          .
          <source>International Journal of Computer Information Systems and Industrial Control Applications</source>
          .
          <year>2014</year>
          . Vol.
          <volume>6</volume>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          466-
          <fpage>473</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Chauhan</surname>
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Decentralized</surname>
          </string-name>
          <article-title>Scheduling Algorithm for DAG Based Tasks on P2P Grid</article-title>
          .
          <source>Journal of Engineering</source>
          .
          <year>2014</year>
          . P. 1-
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>