<!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 />
    <article-meta>
      <title-group>
        <article-title>Method of Early Detection of Information Security Anomalies and Incidents in Information Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hryhorii Hnatiienko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tetiana Babenko</string-name>
          <email>babenkot@ua.fm</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yuliia Kovalova</string-name>
          <email>Kovalovajp@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Larysa Myrutenko</string-name>
          <email>myrutenko.lara@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dnipro University of Technology</institution>
          ,
          <addr-line>Dnipro, Dmytro Yavornytskyi Avenue, 19, Dnipro, 49005</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>Volodymyrs'ka str. 64/13, Kyiv, 01601</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>110</fpage>
      <lpage>119</lpage>
      <abstract>
        <p>In order to timely and effectively respond to external influences in any system, it is necessary to have the ability to detect external impacts at early stages of their manifestation. It is particularly important to stop access to the system if a malicious actor has already breached it. This requires conducting timely investigations into the causes and methods of the breach, anticipating such possibilities in the future, and ensuring more reliable protection. Traditionally, methods of attack detection are divided into two broad categories: misuse detection and anomaly detection. This paper considers approaches to early detection of anomalies in the system's operation at early stages by analyzing the entropy of the event log. This method is used for both detecting anomalies in network traffic and for analyzing anomalies in event logs on hosts, which can also indicate intrusion attempts. The study conducted on the example of Windows event logs showed that entropy analysis can detect early security threshold breaches in the number of messages in the event log. Such indicators can indicate anomalies in the operation of the information system. The method proposed in the article can be applied in intrusion detection systems, which notify the security administrator about possible misuse or intrusion attempts.</p>
      </abstract>
      <kwd-group>
        <kwd>1 External influences</kwd>
        <kwd>anomalies</kwd>
        <kwd>entropy</kwd>
        <kwd>event log</kwd>
        <kwd>information security</kwd>
        <kwd>intrusion detection</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p> Appearance of a large number of archived files in places where they should not be;
 Use of non-original configurations of DNS servers and registry;
 Changes in the configuration of the operating system, including on mobile devices.</p>
      <p>The use of indicators of compromise (IOCs) in most cases allows information security specialists
and system administrators to detect signs of attacks, intrusions, or other potentially dangerous actions,
but it is necessary to detect existing indicators of compromise in the system, which is often a problem.</p>
      <p>Considering the reality of the threats described above, it is evident that scientific research enabling
the timely and confident detection of deviations in information processes is relevant. The success of
such research will allow for the identification of vectors of cyber attacks and actions to neutralize
such attacks [6-7]. A promising direction for scientific research in this field is the use of entropy
indicators to evaluate various parameters of information system cybersecurity. This is evidenced by a
significant amount of research in this area [8-12]. Modeling early anomaly detection is a relevant
problem for many areas of human activity [13, 14]. Several approaches have been proposed and
studied to solve this problem, which to varying degrees allow for the identification of anomalies and
incidents of the information security in information systems [15, 16]. One of the main tasks in solving
this problem is timely detection of system compromise indicators and warning of potential abuses in
order to provide for prompt response measures.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Goal and Objectives of the Research</title>
      <p>Many authors of modern research assume that we have a standard situation with known
accompanying circumstances, and under these idealized conditions, we can propose a new approach, a
new or improved method, a modified algorithm, etc. This fully applies to sliding windows and their
width. This technology has been applied for a long time, intensively and productively. However,
authors usually start from the fact of a given width of the sliding window or do not focus on this
parameter at all. The problem of determining an acceptable, and even more so, an optimal or at least
justified value of its width is discussed very rarely by researchers.</p>
      <p>The aim of this study is to determine the size of a sliding window at which a cyber attack vector or
any cybersecurity anomaly can be reliably detected. The main tasks of researching and detecting
anomalies in the operation of information systems are as follows:
 not to miss the fact of an attack;
 recognize the beginning of an attack at an early stage;
 accurately recognize the attack and distinguish it from a typical event;
 minimize the number of errors made in identifying the attack;
 minimize the consequences of incorrect identification of the attack;
 teach the system to distinguish an attack from a standard event at an early stage, and so on.</p>
    </sec>
    <sec id="sec-3">
      <title>3. The comprehensiveness of the research</title>
      <p>In many cases, a comprehensive application of different approaches in scientific research is
effective. In the situation of detecting attacks, it can be useful to use methods and algorithms that
belong to the following directions:
 data recovery methods taking into account anomalies that arise;
 image recognition methods;
 machine learning methods;
 time series analysis methods - determining similarity measures of series, comparing trends, and
other aspects of this research direction;
 statistical research based on various types of scales: fixed, interval, using membership functions,
and so on.</p>
      <p>To successfully and adequately apply the mentioned approaches simultaneously, it is necessary to
take into account the features of multi-attribute choice and multi-criteria optimization. In addition, for
the successful complex application of different approaches to the task of determining the beginning of
an attack, it is necessary to consider the features of decision-making under fuzzy conditions.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Scheme for detecting anomalies and security incidents</title>
      <p>The research conducted by the authors of this work on behavior traffic analysis using entropy
values allows for the application of an expert approach to identify and classify different system
operation conditions that cause changes in entropy. Visual analysis performed by the authors revealed
that a highly skilled expert can distinguish and classify about 15 types of events. However, it is
impossible to involve experts in solving this problem in everyday life. Therefore, it is logical to
formalize this problem, involve high-level expert knowledge in its solution, and provide automated or
automatic incident detection. To further investigate and refine the problem of identifying impacts on
information security, heuristics will be introduced.</p>
      <p>Heuristic E1. Based on the research of the entropy change graph, which reflects the behavior of the
message source, it is possible to identify an attack with high accuracy.</p>
      <p>Heuristic E2. To fully identify an attack on the system, several attack indicators must be present.
The necessary conditions for an attack are a deep drop in entropy level and a significant increase in
entropy level. However, if these two indicators are not related to each other, these indicators are
insufficient to consider them individually as mandatory entropy indicators. It is obvious but necessary
to formalize the behavior identification model with the following heuristic.</p>
      <p>Heuristic E3. An attack is accompanied by a large range of entropy reduction at the beginning of
the attack and a large increase in entropy at the end of the attack. In the future, it is also advisable to
introduce heuristics for capturing the entire passage of the attack. Obviously, after determining the
width of the sliding window, it is possible to automatically analyze the behavior of the function that
reflects the level of entropy. It should also be noted that a risk-oriented approach allows for the
classification of events that indicate the degree of risk of threat realization. Different scales can be
used to classify events. In this work, we will introduce a five-level scale for classifying levels of
impact on the system:
1  the informative level of impact
 2  the low level of impact;
3  the moderate impact level;
 4  the high or dangerous level of impact;
 5  the critical level of impact.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Determining the width of the sliding window</title>
      <p>Expert decision-making technologies can be applied at different stages of research and practical
situation modeling [17, 18]. The study of entropy behavior and determination of the sliding window
width using expert methods can serve as both an element of a broader study and a goal in itself. The
authors of this study propose several options for expert determination of the window width, taking
into account the limited capabilities of involving high-level experts to solve this problem.</p>
      <p>Firstly, expert survey can be organized to determine the values of the sliding window width, both
in individual expert survey and group expert survey. Secondly, to determine the window width in
which the information about the attack is guaranteed to be present, a series of studies can be
conducted in which the beginning and end of the attack are reliably recorded by expert means. As a
result of the analysis of such a survey, the window width is determined based on statistical analysis of
the data obtained from the experts. It should be noted that the width of the sliding window is an
important parameter that significantly affects the speed and quality of attack research. This value may
relate to different aspects of the study, so it is necessary to distinguish between different quantities
with this name. The width of the sliding window should be considered in several aspects, including:
 when studying trends in entropy changes;
 when detecting anomalous function values;
 for guaranteed event localization.</p>
      <p>In such cases, precise approximation of the anomaly is not necessary, but using additional
computer resources such as time and memory is also not sensible. When studying the behavior of a
function that describes changes in entropy, we will distinguish at least several factors:
 the number of events in the sliding window;
 the diversity of different types of events in the window;
 the range of entropy changes in the window.</p>
      <p>Definition 1. We define a Window for Attack Detection (WAD) as the number of recorded events
during which the beginning of an attack, the maximum entropy change, and the end of the attack can
be reliably identified. The width of WAD is denoted by S1 .</p>
      <p>Definition 2. A window for detecting standard events (WDSE) is defined as the number of
recorded events during which the beginning, minimum/maximum entropy, and completion of the
event can be determined. The width of WDSE is denoted by S 2 .</p>
      <p>
        It is logical to assert that the size of the sliding window should be measured by the number of
events recorded in the log in all cases. Such a coordinate system was adopted and successfully applied
in a series of computational experiments. Based on visual observations, in all practical situations, it is
obvious that the following relation always holds:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
      </p>
      <p>It should also be noted that the use of a properly defined window allows for achieving a whole
range of results. In order to ensure further automatic investigation of the behavior of the function that
describes the entropy value in the system, it is necessary to investigate:
 detecting peculiarities of the function graph behavior during attacks;
 identifying common attack characteristics reflected in the graph;
 finding the boundaries of the attack start and end, etc.</p>
      <p>
        It should be noted that, with regard to relation (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), if the sliding window size is correctly defined, it
is possible to correctly select and effectively apply the relevant mathematical tools.
      </p>
    </sec>
    <sec id="sec-6">
      <title>6. Algorithmic determination of trend change intensity</title>
      <p>It is evident that an attack can be studied by analyzing trends in behavior, particularly through the
analysis of time series, which have been studied in works [19-21]. Trends are described using linear,
logarithmic, power, and other equations, which have been investigated in works [22-24]. The authors
proposed an approach that allows detecting a rapid change in trend behavior already in the early
stages of its appearance. The validity of this approach has been verified and confirmed through a
series of computational experiments.</p>
      <p>
        Let a sequence of events be defined and recorded in a log, the number of which is equal to t. We
will denote the set of these events by T , and represent the sequence of the events using indices
i  T  1,..., t. (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
      </p>
      <p>To clarify the decision-making situation, ensure transparency in further modeling, and refine the
mathematical model to be constructed, it is necessary to formulate another heuristic. The introduction
of such a heuristic is associated with the fact that in practical decision-making situations, thousands of
events need to be researched and analyzed.</p>
      <p>
        Heuristic E4: Each discrete element (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) corresponds to dozens or hundreds of events in specific
cases, which in our mathematical model are indivisible and can be modeled by discrete elements (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
      </p>
      <p>Taking into account heuristic E4, we will denote the entropy value for each event by
ai , i T .</p>
      <p>
        To investigate the patterns of behavior of the values of the sequence (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), we will define WDSE, for
example, in the interval of   1, t / 2.
      </p>
      <p>
        For each i-th discrete element, to which the next block of events, i  T , of the form (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) corresponds,
we will determine the values of the ratio between the current and the next discrete element
      </p>
      <p>
        In situations where entropy values may be zero, some sufficiently small values   0 may be
added to the denominator in formula (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>bij  ai / ai j where j  1,..., .</p>
      <p>bij  ai / ai j    where j  1,..., .</p>
      <p>It should be noted that the introduction of specific values of the variable   0 is also a heuristic,
but in this work, there is no need to investigate the dependence of experiments on the size of this
variable. Therefore, we will not focus on the influence of the value of   0 on the convergence of the
procedure and the features of the computational experiment. The following two heuristics are fair:</p>
      <p>
        Heuristic E5. It is obvious that the presence of values within the window width (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) of the type (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ),
which are significantly larger than the values in the series (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), can serve as indicators of a trend
change when there is a sharp decrease in entropy. The formal aspect of this heuristic will be presented
below, along with the further exposition of the research logic and the descriptive computational
experiments.
      </p>
      <p>
        Heuristic E6. In the opposite case to Heuristic E5, the presence of values of the type (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) that are
significantly smaller than the inverse values in the series (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) are indicators of a trend change when
there is a sharp increase in entropy. Finally, a heuristic for decision-making can be formulated for this
situation.
      </p>
      <p>
        Heuristic E7. The presence of several values of the type (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ) that are described by heuristics E5 and
E6 is a criterion for a sharp trend change. There may be at least two approaches for algorithmically
determining the indicators that reflect the behavior of different event log fragments in an integral
form:
 multiplicative approach;
 additive approach.
      </p>
    </sec>
    <sec id="sec-7">
      <title>7. Multiplicative approach</title>
      <p>Let's introduce notation for the window size, the dependency of which we will investigate in
determining further criteria. Taking into account Heuristic E4, we will denote by v  2 the window
size based on which we need to calculate the criteria values that reflect the presence or absence of
attacks on the information system. To investigate the behavior of an information system that reflects
the dynamics of entropy values at each moment in time, let us introduce the following criterion
function:</p>
      <p>v1
  i1 ai  av , якщо av1  av
QM t, v    v1</p>
      <p> i1 ai / av , якщо av1  av</p>
    </sec>
    <sec id="sec-8">
      <title>8. Additive approach</title>
      <p>An additive approach can also be applied to investigate the behavior of a function that reflects the
dynamics of entropy values at each moment in time. In this case, the behavior of such a function can
be introduced and investigated:</p>
      <p>For each level of impact classification scale from to , boundary values of the criteria QM 1,..., QM 5
can be determined. It would be useful to supplement the decision-making situation we are
investigating with an additional heuristic that will contribute to the refinement and formalization of
our research situation.</p>
      <p>
        Heuristic E8: The extreme values of the criterion function (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) for the standard (normal, stable, etc.)
operation of the information system and the extreme values of the function (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) for the attack differ
significantly in magnitude. Variations of the values of v  2, and t  1, 2,... will allow the researcher
to determine the combinations of function values and arguments, or intervals of such values, that best
correspond to the conditions of situation classification and the probability of an attack on the
information system.
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
iv11 ai  av , якщо av1  av
Q A t, v    v1
      </p>
      <p>i1 ai  av , якщо av1  av</p>
      <p>
        In this case, the behavior of criteria of the form (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) and (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) differs from each other. Therefore,
there is an opportunity for the integrated use of these tools to improve early detection methods of
cyber attacks or other impacts on the information system. Based on the conducted research, which
was a combination of expert methods and calculations based on formulas (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )-(
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), critical values of the
function K were determined, at which the situation reflected in values (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) can be classified with a high
degree of certainty as belonging to one of the variants of the impact risk of 1,..., 5 .
      </p>
      <p>
        It should be noted that the application of the proposed approaches indirectly solves the problem of
the sliding window size. Clearly, the indicators of the situation classification are the values of
functions (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )-(
        <xref ref-type="bibr" rid="ref7">7</xref>
        ). Depending on the value of the parameter, which can be interpreted as the window
size, the functions (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )-(
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) take on certain values. Based on the magnitude of these values, one can
draw conclusions about the degree of danger of impacts on the information system, i.e. about the
classification of the decision-making situation into one of the classes 1 5 introduced by us.
      </p>
    </sec>
    <sec id="sec-9">
      <title>9. Computational experiment</title>
      <p>For the investigation of the methods described in this work, individual fragments of the event log
were considered. The computational experiment was conducted on three fragments, all of which were
unambiguously identified by the experts as reflecting the normal operation of the system. One
fragment was also selected for which an attack was emulated.</p>
      <p>It should be noted that to ensure the purity of the experiment, communication channels, external
networks, etc., were disabled. Such measures were taken to ensure the absence of communication
with sources from which a potential attack can be expected.</p>
      <p>A whole range of decision-making situations were considered, where the entropy values, from the
experts' point of view, confidently correspond to the normal functioning of the information system.
Several fragments of this situation are presented in this work in figures 1-3. In addition, figure 4 will
show a fragment that undoubtedly contains an attack on the information system, deliberately
provoked by the experiment organizers. For example, among the hundreds of decision-making
situations investigated, we will select some of the most characteristic situations. To illustrate the
course of the computational experiment and the detection of a change in the behavior gradient of the
function, we will consider information on entropy, which we will present in the form of tables 1-3.
Let's present Table 1 as a graph - Figure 1, which visualizes the behavior of the information
system in situations of cyber attacks or other incidents. Among the hundreds and thousands of
decision-making situations that have been reflected in the event log, those that best reflect the normal
functioning of the information system have been identified through expert analysis. The numerical
indicators for three such typical situations of standard information system functioning are presented for
illustration in Table 1, Table 2, and Table 3. Table 2 is visualized as Figure 2. Obviously, this graph
differs from Figure 1, but it also represents indicators that correspond to normal functioning of the
information system. Table 3 is represented in Figure 3. In the computational experiment, hundreds of
fragments were analyzed, samples of which are presented in Figure 1, Figure 2, Figure 3.</p>
      <p>
        Based on the results of the conducted experiment, it was shown that the method presented in this
paper allows for identifying the beginning of an attack after only 4-5 discrete units (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ).
By applying additional criteria, the confidence in the presence of an attack or incident during event
log analysis can be significantly increased. Additional criteria may include a decrease in entropy
value, continued monitoring of the behavior of the function that reflects entropy, and so on.
      </p>
    </sec>
    <sec id="sec-10">
      <title>Prospects for further research</title>
      <p>
        Algorithms for computing potential threats through trend analysis, similar to the algorithms
described by formulas (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )-(
        <xref ref-type="bibr" rid="ref5">5</xref>
        ), can be developed to expand the toolkit for researching attacks and
incidents. Using precedents for analyzing the similarity measures of series and identifying patterns in
the behavior of the function that describes the change in system entropy is also promising. In the
future, automated tracking of trend behavior and identification of situations such as plateaus, sharp or
smooth growth, and declines are planned. Support for decision-making regarding trend similarity will
be provided by analyzing the range of entropy values within a justified window.
      </p>
      <p>The behavior of the entropy change function can also be approximated using primitive shapes such
as triangular functions [25-27]. In addition to the multiplicative and additive approaches proposed in
this paper, neural networks [28, 29] can also be used for decision-making in this situation. In this case,
the neural network identifies the nature of the functional dependency during normal operation of the
information system and changes in dependencies during situations that experts identify as attacks. The
neural network determines the type of functional dependence during normal system operation and
changes in dependencies during situations that experts identify as attacks, thus identifying patterns in the
behavior of entropy and the relationship between functions that reflect the dynamics of entropy change.</p>
      <p>In order to increase confidence in the identification of the decision-making situation and the
classification of the level of danger, several approaches can be simultaneously applied in a complex [30,
31]. To increase confidence in identifying situations and decision-making, multiple approaches can be
simultaneously applied, necessitating the use of multi-criteria optimization methodology [32, 33].
11.</p>
    </sec>
    <sec id="sec-11">
      <title>Conclusions</title>
      <p>The paper proposes a model for early detection of anomalies and incidents in information systems.
A scheme for early detection of anomalies is proposed. Approaches to determining the window width
in studying the operation of the information system are discussed. The algorithmic determination of
trend change intensity is described. The computational experiment described in this paper
demonstrates an example of detecting a change in the gradient of the criterion function's behavior.
The application of research related to numerical series is a promising direction and has broad
prospects when various methods are applied together. It should be noted that this paper describes an
idealized situation for detecting an attack. After a series of additional studies and computational
experiments, the approaches described can be applied to real decision-making situations.</p>
      <p>Prospects for further research on detecting cyber-attacks, incidents, and anomalies in the
functioning of information systems are also identified. It is clear that the subject of research can be
significantly expanded in the future, as the detection of anomalies in the functioning of complex
systems of various kinds is a popular direction for scientific research.
12. References</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Geer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Jardine</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Leverett</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          <article-title>On market concentration and cybersecurity risk</article-title>
          .
          <source>J. Cyber Policy</source>
          <year>2020</year>
          ,
          <volume>5</volume>
          ,
          <fpage>9</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Khraisat</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gondal</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ; Vamplew,
          <string-name>
            <given-names>P.</given-names>
            ;
            <surname>Kamruzzaman</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Survey of intrusion detection systems: Techniques, datasets and challenges</article-title>
          .
          <source>Cybersecurity</source>
          <year>2019</year>
          ,
          <volume>2</volume>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>22</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Papastergiou</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Mouratidis,
          <string-name>
            <given-names>H.</given-names>
            ;
            <surname>Kalogeraki</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.M.</surname>
          </string-name>
          <article-title>Cyber security incident handling, warning and response system for the european critical information infrastructures (cybersane)</article-title>
          .
          <source>In Proceedings of the International Conference on Engineering Applications of Neural Networks, Crete, Greece</source>
          ,
          <fpage>24</fpage>
          -
          <lpage>26</lpage>
          May 2019; Springer: Berlin/Heidelberg, Germany,
          <year>2019</year>
          ; pp.
          <fpage>476</fpage>
          -
          <lpage>487</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Babenko</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hnatiienko</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ignisca</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iavich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Modeling of critical nodes in complex poorly structured organizational systems //</article-title>
          <source>Proceedings of the 26th International Conference on Information Society</source>
          and University Studies (IVUS
          <year>2021</year>
          ), Kaunas, Lithuania, April
          <volume>23</volume>
          ,
          <year>2021</year>
          / CEUR Workshop Proceedings,
          <year>2021</year>
          ,
          <volume>2915</volume>
          , pp.
          <fpage>92</fpage>
          -
          <lpage>101</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Krumay</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernroider</surname>
            ,
            <given-names>E.W.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walser</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Evaluation of Cybersecurity Management Controls and Metrics of Critical Infrastructures: A Literature Review Considering the NIST Cybersecurity Framework</article-title>
          . In: Gruschka,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>(eds) Secure IT Systems</article-title>
          .
          <source>NordSec 2018. Lecture Notes in Computer Science()</source>
          , vol
          <volume>11252</volume>
          . Springer, Cham. https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -03638-6_
          <fpage>23</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Anwar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohamad</surname>
            <given-names>Zain</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Zolkipli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. F.</given-names>
            ,
            <surname>Inayat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Anthony</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            , &amp;
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>From intrusion detection to an intrusion response system: fundamentals, requirements, and future directions</article-title>
          .
          <source>Algorithms</source>
          ,
          <volume>10</volume>
          (
          <issue>2</issue>
          ), [
          <volume>39</volume>
          ]. https://doi.org/10.3390/a10020039
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Rupa</given-names>
            <surname>Devi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Badugu</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>A review on network intrusion detection system using machine learning</article-title>
          .
          <source>In Advances in Decision Sciences, Image Processing, Security and Computer Vision</source>
          ; Springer: Berlin/Heidelberg, Germany,
          <year>2020</year>
          ; pp.
          <fpage>598</fpage>
          -
          <lpage>607</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Salih</surname>
            <given-names>AA</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abdulazeez</surname>
            <given-names>AM</given-names>
          </string-name>
          (
          <year>2021</year>
          )
          <article-title>Evaluation of classification algorithms for intrusion detection system: a review</article-title>
          .
          <source>J Soft Comput Data Mining</source>
          <volume>2</volume>
          (
          <issue>1</issue>
          )
          <fpage>31</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Hierarchical Information Entropy System Model for TWfMS</article-title>
          . Entropy,
          <volume>20</volume>
          (
          <issue>10</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Li</surname>
            <given-names>Y.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Chao</surname>
            <given-names>X.</given-names>
          </string-name>
          , “
          <article-title>Distance-entropy: an effective indicator for selecting informative data,” Frontiers in Plant Science</article-title>
          , vol.
          <volume>12</volume>
          , pp.
          <fpage>818</fpage>
          -
          <lpage>895</lpage>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Shiju</given-names>
            <surname>Rawther</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S</given-names>
            <surname>Sathyalakshmi</surname>
          </string-name>
          ,
          <article-title>"Entropy Analysis of Cyber-Attack Propagation in Network"</article-title>
          ,
          <source>2022 13th International Conference on Computing Communication and Networking Technologies (ICCCNT)</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Hamid</surname>
            <given-names>T</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Al-Jumeily</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mustafina</surname>
            <given-names>J</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Evaluation of the dynamic cybersecurity risk using the entropy weight method</article-title>
          .
          <source>In: Dastbaz M et al (eds) Technology for Smart Futures</source>
          , pp
          <fpage>271</fpage>
          -
          <lpage>287</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Pu</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dong</surname>
            <given-names>F.</given-names>
          </string-name>
          ,
          <article-title>A hybrid unsupervised clustering-based anomaly detection method</article-title>
          .
          <source>Tsinghua Sci. Tech</source>
          .,
          <volume>26</volume>
          (
          <issue>2</issue>
          ) (
          <year>2021</year>
          ), pp.
          <fpage>146</fpage>
          -
          <lpage>153</lpage>
          ,
          <fpage>10</fpage>
          .26599/TST.
          <year>2019</year>
          .9010051
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Moon</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ; Im, H.;
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ; Park,
          <string-name>
            <given-names>J.H.</given-names>
            <surname>DTB-IDS</surname>
          </string-name>
          :
          <article-title>An intrusion detection system based on decision tree using behavior analysis for preventing APT attacks</article-title>
          .
          <source>J. Supercomput</source>
          .
          <year>2017</year>
          ,
          <volume>73</volume>
          ,
          <fpage>2881</fpage>
          -
          <lpage>2895</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Yao</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luo</surname>
            <given-names>J.</given-names>
          </string-name>
          , Zhang S.,
          <article-title>Network anomaly detection using random forests and entropy of traffic features</article-title>
          ,
          <source>in: Fourth International Conference on Multimedia Information Networking and Security</source>
          , Nanjing,
          <year>2012</year>
          , pp.
          <fpage>926</fpage>
          -
          <lpage>929</lpage>
          . doi:
          <volume>10</volume>
          .1109/MINES.
          <year>2012</year>
          .
          <volume>146</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Shukla</surname>
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maurya</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <article-title>Entropy-based anomaly detection in a network</article-title>
          .
          <source>Wireless Pers</source>
          . Commun.,
          <volume>99</volume>
          (
          <issue>4</issue>
          ) (
          <year>2018</year>
          ), pp.
          <fpage>1487</fpage>
          -
          <lpage>1501</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Hnatiienko</surname>
            <given-names>H. Choice</given-names>
          </string-name>
          <article-title>Manipulation in Multicriteria Optimization Problems / Selected Papers of the XIX International Scientific and Practical Conference "Information Technologies and Security"</article-title>
          (ITS
          <year>2019</year>
          ), pp.
          <fpage>234</fpage>
          -
          <lpage>245</lpage>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>McAndrew</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          et al. (
          <year>2021</year>
          )
          <article-title>Aggregating predictions from experts: a review of statistical methods, experiments, and applications</article-title>
          .
          <source>WIREs: Comput. Stat</source>
          .
          <volume>13</volume>
          ,
          <year>e1514</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Fawaz</surname>
            <given-names>H. I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forestier</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Idoumghar</surname>
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Muller P.-A</surname>
          </string-name>
          ., “
          <article-title>Deep learning for time series classification: a review,” Data Mining and Knowledge Discovery</article-title>
          , vol.
          <volume>33</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>917</fpage>
          -
          <lpage>963</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shi</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goh</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
          </string-name>
          , S.
          <article-title>-</article-title>
          K.:
          <article-title>MAD-GAN: multivariate anomaly detection for time series data with generative adversarial networks</article-title>
          . In: Tetko,
          <string-name>
            <given-names>I.V.</given-names>
            , K˚urková, V.,
            <surname>Karpov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Theis</surname>
          </string-name>
          ,
          <string-name>
            <surname>F. (eds.) ICANN</surname>
          </string-name>
          <year>2019</year>
          .
          <article-title>LNCS</article-title>
          , vol.
          <volume>11730</volume>
          , pp.
          <fpage>703</fpage>
          -
          <lpage>716</lpage>
          . Springer, Cham (
          <year>2019</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -30490-4_
          <fpage>56</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Zhou</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            <given-names>S.</given-names>
          </string-name>
          , Hooi B.,
          <string-name>
            <surname>Cheng</surname>
            <given-names>X.</given-names>
          </string-name>
          , and Ye J., “
          <article-title>BeatGAN: Anomalous Rhythm Detection using Adversarially Generated Time Series,”</article-title>
          <source>in Proc. of the 28th Int. Joint Conf. on Artificial Intelligence</source>
          ,
          <source>(IJCAI)</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4433</fpage>
          -
          <lpage>4439</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liao</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ji</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Multidimensional time series anomaly detection: a GRU-based Gaussian mixture variational autoencoder approach</article-title>
          .
          <source>In: Asian Conference on Machine Learning</source>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>112</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Radivilova</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kirichenko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lemeshko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ageyev</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mulesa</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Ilkov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Analysis of anomaly detection and identification methods in 5G traffic</article-title>
          .
          <source>In Proceedings of the Eleventhth IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)</source>
          , Cracow, Poland,
          <fpage>22</fpage>
          -
          <lpage>25</lpage>
          September 2021; pp.
          <fpage>1108</fpage>
          -
          <lpage>1113</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Hrechko</given-names>
            <surname>Viktoriia; Hrygorii Hnatienko; Tetiana Babenko</surname>
          </string-name>
          .
          <article-title>An intelligent model to assess information systems security level // 2021</article-title>
          <source>Fifth World Conference on Smart Trends in Systems Security and Sustainability (WorldS4)</source>
          , London, United Kingdom,
          <fpage>29</fpage>
          -
          <issue>30</issue>
          <year>July 2021</year>
          / Date Added to IEEE
          <source>Xplore: 19 August</source>
          <year>2021</year>
          , Pp 128 - 133, DOI: 10.1109/WorldS451998.
          <year>2021</year>
          .9514019
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Zare</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Shoeibi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Shafaei</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Moridian</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Alizadehsani</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ; Halaji,
          <string-name>
            <given-names>M.</given-names>
            ;
            <surname>Khosravi</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Accurate Prediction Using Triangular Type-2 Fuzzy Linear Regression</article-title>
          .
          <source>arXiv</source>
          <year>2021</year>
          , arXiv:
          <fpage>2109</fpage>
          .
          <fpage>05461</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Iraq</surname>
            <given-names>Tariq</given-names>
          </string-name>
          <string-name>
            <surname>Abbas</surname>
          </string-name>
          .
          <article-title>Triangular membership functions for solving single and multiobjective fuzzy linear programming problem //</article-title>
          <source>Iraqi Journal of Science</source>
          ,Vol
          <volume>53</volume>
          ,No 1,
          <year>2012</year>
          , Pp.
          <fpage>125</fpage>
          -
          <lpage>129</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Lathamaheswari</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Nagarajan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kavikumar</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Broumi,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Triangular interval type-2 fuzzy soft set and its application</article-title>
          .
          <source>Complex Intell. Syst</source>
          .
          <year>2020</year>
          ,
          <volume>6</volume>
          ,
          <fpage>531</fpage>
          -
          <lpage>544</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Raghuraman</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Suresh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Shivshankar</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Chapaneri,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>Static and dynamic malware analysis using machine learning</article-title>
          .
          <source>In Proceedings of the First International Conference on Sustainable Technologies for Computational Intelligence</source>
          , Jaipur, India,
          <fpage>29</fpage>
          -
          <lpage>30</lpage>
          March 2019; Springer: Berlin/Heidelberg, Germany,
          <year>2020</year>
          ; pp.
          <fpage>793</fpage>
          -
          <lpage>806</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>Sekhar</given-names>
            <surname>Ch</surname>
          </string-name>
          et al (
          <year>2021</year>
          )
          <article-title>Deep learning algorithms for ıntrusion detection systems: extensive comparison analysis</article-title>
          .
          <source>Turkish J Comput Mathe Edu (TURCOMAT)</source>
          <volume>12</volume>
          (
          <issue>11</issue>
          ):
          <fpage>2990</fpage>
          -
          <lpage>3000</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>Voloshin</surname>
            ,
            <given-names>A.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gnatienko</surname>
            ,
            <given-names>G.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drobot</surname>
            ,
            <given-names>E.V.</given-names>
          </string-name>
          <article-title>A Method of Indirect Determination of Intervals of Weight Coefficients of Parameters for Metricized Relations Between Objects //</article-title>
          <source>Journal of Automation and Information Sciences</source>
          ,
          <year>2003</year>
          ,
          <volume>35</volume>
          (
          <issue>1</issue>
          -
          <fpage>4</fpage>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Ghafari</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yaghoobi</surname>
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <article-title>An algorithm for a multicriteria optimization problem and its application to a facility location problem</article-title>
          ,
          <source>J. Mahani Math. Res</source>
          .
          <year>2022</year>
          ;
          <volume>12</volume>
          (
          <issue>3</issue>
          ):
          <fpage>197</fpage>
          -
          <lpage>213</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Kravchenko</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Starkova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herasymenko</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kharchenko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Peculiarities of the IPv6 implementation in Ukraine // 2017 4th International Scientific-Practical Conference Problems of Infocommunications Science and Technology, PIC S and</article-title>
          <string-name>
            <surname>T 2017 - Proceedings</surname>
          </string-name>
          ,
          <year>2017</year>
          ,
          <fpage>2018</fpage>
          -January, pp.
          <fpage>363</fpage>
          -
          <lpage>368</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Hnatiienko</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiktev</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Babenko</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Desiatko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Myrutenko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <article-title>Prioritizing Cybersecurity Measures with Decision Support Methods Using Incomplete Data // Selected Papers of the XXI International Scientific and Practical Conference "Information Technologies and Security"</article-title>
          (ITS
          <year>2021</year>
          ), Kyiv, Ukraine, December 9,
          <year>2021</year>
          / CEUR Workshop Proceedings,
          <year>2021</year>
          ,
          <volume>3241</volume>
          , pp.
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>