<!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>Mathematical Models and Information System for Modeling Optimum Upgrade of Fixed Capital Assets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Askar Boranbayev</string-name>
          <email>aboranbayev@nu.edu.kz</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Yersultan Tulebayev</string-name>
          <email>yersultan.tulebayev@astanait.edu.kz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Astana IT University</institution>
          ,
          <country country="KZ">Kazakhstan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Nazarbayev University</institution>
          ,
          <country country="KZ">Kazakhstan</country>
        </aff>
      </contrib-group>
      <fpage>202</fpage>
      <lpage>209</lpage>
      <abstract>
        <p>This article discusses models and methods for the optimal replacement of fixed assets and introduces new algorithms for replacing assets with a limited prediction of changes in indefinite costs. The total cost is generated from the operating costs of the current asset that is being used; the cost of liquidating the asset and the cost of new assets. The variation in these costs depends on various factors such as technological changes, economic and environmental changes. Modern innovations enlarge the significance and intricacy of technological progress. The optimum substitution of assets is dissected when future direction of technical development is known over a restricted horizon. Matching of the actual and desired characteristics of existing substitution methods leads us to the idea of how to increase their effectiveness when technology changes, which translates into lower exploitative and new asset costs. We are studying renewed modes of the classical method of substituting an economic resource at an uncertain cost. We show that the modified methods provide solution substitution equal to or close to infinite horizon substitution under technological development. The considered algorithms work well for a random age apportionment of deterministic or stochastic recurrent expenses. We showcase their excellent productivity in a variety of technology advancement scenarios, resulting in reduction in operating costs and costs for new assets. Numerical research is presented and administrative decisions of the received results are considered. The information system of the mathematical model of asset replacement using the conventional economic life method and the modified economic life method is presented.</p>
      </abstract>
      <kwd-group>
        <kwd>Asset replacement</kwd>
        <kwd>optimal lifetime</kwd>
        <kwd>technological update</kwd>
        <kwd>capital</kwd>
        <kwd>method</kwd>
        <kwd>algorithm</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        This article explores the main algorithms for asset replacement in the presence of incomplete and
indefinite data on technological changes. A new
mathematical model of the modified method of
economic life is proposed. Based on the developed methods, an information system for modeling the
optimal renewal of fixed assets was created. Significant research is dedicated to the issue of substitution
of assets, in specific works [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref18 ref2 ref3 ref4 ref5 ref6 ref7 ref8 ref9">1-24</xref>
        ]. The Infinite Horizon Method (IH) with regard to technological
change has been found to be an excellent example for asset substitution.
      </p>
      <p>
        At the moment, there are different ways to replace assets, but in practice most of them are not suitable
in reality. The reason for this is the problem with limited data, time intervals and other restrictions. In
this regard, in the scientific works of engineering and economics, the method of economic life (EL) is
proposed (7, 21, 22). This algorithm is unique, simple and safe for real life applications and allows you
to determine the optimal output when replacing a single asset. It is worth noting that in the case of an
increase in the operating costs of assets, the Economic Life method produces different data than the
Infinite Horizon method. As technological changes are taking place, the results produced by the
Economic Life method are not practical. In order to solve this problem, the authors [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] propose a new
modified method of Economic Life, while adding a new parameter that takes into account the return on
      </p>
      <p>
        2022 Copyright for this paper by its authors.
capital. The modified Economic Life method and the Infinite Horizon method release the same
outcomes, provided that technological changes affect operating costs and the cost of new assets, as
presented in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. It also had an impact on performance indicators in the task of replacing assets at
stochastic costs [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. At present, when studying the replacement of one asset at an unknown cost, the
method of minimizing the cost of an infinite horizon and the method of optimal stopping are widely
used. This article proposes a modified method of Economic Life under the condition of unknown
operating. An algorithm has been developed that can be used in practical life, and an information system
based on this algorithm has also been implemented.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Methods: updating the asset with technological changes</title>
      <p>For example, let's define a company that needs to serially substitute one asset with new assets that
execute the same statements but have better substitution costs due to technological change. Let us set
out this substitution operation in continuous time 0 ≤ t &lt; . Significant changes in technology and
economics are expressed using the following functions:
(1) the cost P(t) (buy price and setup cost) of a new asset at time t;
(2) the cost of exploitation and service A(t,u) for an asset acquired on time t;
(3) the liquidation cost S(t,u) at time u of the asset acquired on time t, 0  S(t,u) &lt; P(t).</p>
      <p>The variable a = u-t is an asset age, 0  a  M, where M is maximum natural asset life. Advances
in technology manifest the emergence of new assets that require less service and/or are less costly, so
P(t) and A(t,u) lessening in t. This fact is discovered as the technological change (TC). The exploitative
cost A(t,u) grows with asset age u-t due to natural wear, however, it may also fall due to training. The
function A(t,u) can express various impairment and learning speculations.</p>
      <p>To estimate the factual cost of substitution during a final stage, the theory of substitution uses the
capital reimbursement ratio. R(r,T ) which changes the actual value of definite costs over a specific
future interval into a sequence of interchangeable yearly costs. Assuming continuous interest accrual,
the yearly return on capital for the interval [0,T] is
where r &gt; 0 is general industry discount rate.</p>
      <p>To depict the successive replacement of one asset by a new asset, we represent an endogenous
longevity Lk of the k-th asset, k=1,2,…. Then, the time k of the substittution of the k-th asset with the
(k+1)-th asset is</p>
      <p>R(r,T ) </p>
      <p>r
1  e rT ,</p>
      <p>k
k = k-1 + Lk   L j ,
j1
(1)
(2)</p>
      <p>For clarity, imagine that the first asset is acquired at time t = 0 and will be substituted at the end of
its life cycle, then 0 = 0 and 1= L1.</p>
      <p>
        The asset substitution cost: The actual value of full substitution cost of the k-th asset, k=1,2,…,
during your future life Lk is computed at a certain industrial discount rate r&gt;0 as [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]
      </p>
      <p>PWk (Lk , k )  er(kLk )P( k  Lk )  S( k , k  Lk ) kkLk eru A( k1, u)du, (3)
The first part (3) is the actual value of the new asset minus the discounted liquidation value of the actual
asset, and the integral is the exploitative operating costs over the future life of the current asset. The
challenge is to create substitution methods that use limited data of technological change, but give the
same results as for an ideal technological prediction. Accordingly, our ideal task is to optimize on an
infinite horizon. Below we present the mathematical statements of the substitution methods under study.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 Infinite-Horizon (IH) Substitution</title>
      <p>The IH substitution algorithm [23, 24] proposes that the outer technological parameters P, A and S
are revealed over an infinite horizon [0,) and defines the endless optimum sequence of serial asset
lifetimes Lk, k=1,2,…, that decreases the actual value of the summary substitution cost over [0,):
where PWk is given by (3) and k is defined from (2).</p>
      <p>On the contrary, the following substitution methods work in the case of a restricted technological
prediction. We will consider that the technological parameters P(t), A(t,u), and S(t,u) are noted for 0≤ t
≤ u ≤ T &lt; at some finite interval in the future [0, T], where the value T should not be less than the
future obscure lifetime L1 of the actual asset. For example, T may be the maximal natural lifetime M of
assets.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Economic Life (EL) Substitution Method</title>
      <p>The EL method defines the lifetime L1 that decreases the interchangeable yearly cost (EAC) of the
first asset substitution [21]
where R(r, L1) is determined by (1) and PW1 is given by (3). By the EL algorithm, the first optimum
lifetime EL1 is defined as</p>
      <p>C1(L1)  R(r, L1)PW1(L1,0) ,</p>
      <p>(6)
EL1  arg min C1 (L) .</p>
      <p>0LM
(7)</p>
      <p>To discover the first optimum lifetime EL1, it is sufficiently to know the cost P(t) and the sequences
S(0,t) and A(0,t) over the future interval [1, EL1]. As a result, the EL method gives various optimum
lifetimes EL1, EL2,…, for successively substitutions k=1,2,3,… of the asset. In research of engineering,
searching the first optimum service life EL1 is the most pressing issue.</p>
      <p>The general coherence in the theory of substitution is that the EL method does not take into account
technological changes. This is only partly correct. The variant (6) of the EL algorithm above supposes
substitution at the end of the actual life cycle of the asset and thus actually considers a possible
technological development as a shift in the value of a new asset. P( k  Lk ) . However, the EL (6)-(7)
algorithm does not account for enhancements in exploitative costs. Below we define a modified method
that overcomes this shortcoming.
2.3</p>
    </sec>
    <sec id="sec-5">
      <title>Modified EL Method</title>
      <p>To cope with constant technological improvements, we perform an effective return on capital ratio.</p>
      <p>Rˆ (r, c, L)  R(r  c, L) ,
(8)
where c is the cumulative TC rate. The selection of rate c for different types of TC should be based on
a matching of the actual and desired properties of replacement methods. Specifically, using Rˆ (r, c, L)
instead of R(r, L) in the EL algorithm noticeably raises its effectiveness. The modified EL algorithm
defines the lifetime L1 that decreases the corrected EAC of the first asset substitution
L1  arg min Cˆ1(L) ,</p>
      <p>0LM
Cˆ1 (L)  R(r  c, L)PW1 (L,0) ,
(9)
in which Rˆ (r, c, L) is used instead of R(r, L) as in (6).</p>
    </sec>
    <sec id="sec-6">
      <title>3. Resutls: comparative algorithm analysis</title>
      <p>Calculations of the optimal service life of the asset were carried out using two methods: the
replacement method is active excluding the technological update; a method of replacing an asset, taking
into account the technological update. The method of replacing an asset without taking into account
technological renewal corresponds to the method of economic life, in turn, the method of substitution
an asset with regard to technological renewal corresponds to the modified method of economic life.</p>
      <p>Formula of the Economic Life method:</p>
      <p>EAC(L) </p>
      <p>d (1  d ) L 
(1  d ) L 1L (1  d ) L 0</p>
      <p>P( 0 )
</p>
      <p>S( 0 , L)
(1  d ) L 0</p>
      <p>L A( 0 , j) 
 
j1 (1  d ) j 0 
.
describes the effective annual equivalent cost (EEAC)</p>
      <p>The formula for the modified Economic Life method is:</p>
      <p>EEAC(L) 
d (1  d ) L</p>
      <p> P( 0 )a L 0
(1  d ) L  q L 
 (1  d ) L 0
</p>
      <p>S ( 0 , L)
(1  d ) L 0</p>
      <p>L A( 0 , j) 
 
j1 (1  d ) j 0 .</p>
      <p>The modified method of economic life is identical to the original method of economic life at a = q
= 1, that is, excluding technological improvements.</p>
      <p>i = 1,2,..- discrete time (i = 0 is the current year);
P(i) is the cost of acquiring (installing) a new asset in year i;
A(i,j) - cost of exploitation and service (O&amp;M) of an asset of age j established in year i;
S(i,j) - liquidation value of an asset of age j established in year i;
A - annual factor of change in the purchase price P of a new asset;
q is the yearly change in O&amp;M value A of the new asset;
L1 = L - unknown lifetime of the current asset;
0 - the current moment of installation of the current (first) asset;
d is the given annual discount rate;
EEAC is the effective annual present value equivalent of the total value of current assets.</p>
      <p>Having analyzed the possibility of substitution the asset during this year, it is enough to compare the
two values of EEAC: EEAC(0) for this year and EEAC(0+1) for the coming year. Replacement
decision:
- If EEAC(0+1) &gt; EEAC(0), then the asset is due to be substituted this year.
- If EEAC(0+1) ≤ EEAC(0), then the asset continues to operate this year.</p>
      <p>Comparing the results of calculations for the two methods of asset replacement, it can be seen
that the calculation of the year of asset replacement using the Asset Replacement Method
without taking into account technological renewal does not correspond to the real life of the
asset and is far from reality. With the Technology Update Asset Replacement Method, the
calculation of the year of asset replacement is close to real data.</p>
    </sec>
    <sec id="sec-7">
      <title>4. Information system for modeling asset replacement</title>
      <p>The information system was developed using the PHP scripting language and the MySQL database
management system. The information system is designed to calculate the optimal life of an asset
using asset replacement methods; creating an asset database.</p>
      <p>In the course of the study, an analysis was made of existing methods, models of asset replacement,
their advantages and disadvantages. This information system implements two methods for replacing an
asset: the method for replacing an asset without taking into account technological updates; a method of
replacing an asset, taking into account the technological update. Information system capabilities:
1. Create a new asset database.</p>
      <p>2. Calculation of the optimal time to replace an asset using the asset replacement method without
taking into account technological upgrades.</p>
      <p>3. Calculation of the optimal time to replace an asset using the asset replacement method, taking
into account the technological update.</p>
      <p>Algorithm for calculating the optimal time to replace an asset using the asset replacement method
without taking into account technological renewal (Fig. 1). Algorithm for calculating the optimal time
to replace an asset using the asset replacement method, taking into account technological updates (Fig.
2).
(10)
(11)</p>
      <sec id="sec-7-1">
        <title>Conclusion of results and calculation of the optimal replacement time</title>
      </sec>
      <sec id="sec-7-2">
        <title>Choosing an Asset Replacement Method</title>
      </sec>
      <sec id="sec-7-3">
        <title>Asset database selection</title>
      </sec>
      <sec id="sec-7-4">
        <title>Parameters input d, q, R</title>
      </sec>
      <sec id="sec-7-5">
        <title>Conclusion of results and calculation of the optimal replacement time</title>
        <p>4.1 Description of the program and interface</p>
        <p>The main page of the program is shown in Figure 3. There are two buttons in the main menu: MAIN,
METHODS. When you press the MAIN button, the page goes to the menu of the main program window.
In the METHODS menu, there are two methods of asset replacement (Fig. 4): The method of replacing
an asset without considering a technological update. The method of replacing an asset with a
technological update. We will perform calculations using the asset replacement method with taking into
account the technological update for the X-ray equipment. By selecting the Asset replacement method
button taking into account technological update, the program will calculate the time of asset
replacement with technological update parameters (Fig. 6). Next, select a table from the database using
which we will calculate. Let's select the table X-ray equipment (Fig. 7). The program window opens
with the table data. Next, we enter the parameters: the annual discount rate, the annual factor of change
in the operating cost of a new asset, the cost of a new asset and click the Calculate button (Fig. 8). The
next window displays the results where the effective annual equivalent values are calculated. And
displays the year of replacement of the asset (Fig. 9). Based on the results, the X-ray equipment should
be replaced in 2019 as the EAC(L) value increases in subsequent years.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>5. Conclusions</title>
      <p>We focus on practical situations where the new asset and operating costs vary but are known over a
short forecast horizon or even can only be estimated at some points. Our methodology is based on the
assumption that the current cost dynamics will continue, at least for some time. This allows us to predict
future cost dynamics based on the few discrete cost measures available and build a simple asset
replacement algorithm that provides a cost-effective management decision on when to replace assets.</p>
      <p>The algorithm of the Modified method of Economic Life is proposed. A simple information
system based on this method has been developed to determine the optimal replacement period
for an asset in case of uncertain technological changes.</p>
    </sec>
    <sec id="sec-9">
      <title>6. Acknowledgement</title>
      <p>The authors are grateful to the Ministry of Education and Science of the Republic of Kazakhstan for
financial support under grant № AP09261118.
7. References</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Szeliski</surname>
            ,
            <given-names>R</given-names>
          </string-name>
          . Computer Vision: Algorithms and Applications, - Springer, (
          <year>2011</year>
          ):
          <fpage>832</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Rosin</surname>
            ,
            <given-names>P. L.</given-names>
          </string-name>
          <string-name>
            <surname>Yu-Kun</surname>
            <given-names>Lai</given-names>
          </string-name>
          , Ling Shao, Yonghuai Liu.
          <article-title>RGB-D Image Analysis and Processing (Advances in Computer Vision</article-title>
          and Pattern Recognition). - Springer, (
          <year>2019</year>
          ):
          <fpage>953</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Gonzalez R.C. Woods R.E. Digital</surname>
          </string-name>
          <article-title>Image Processing</article-title>
          . 3rd ed. - Pearson, (
          <year>2007</year>
          ):
          <fpage>976</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Pratt</surname>
            <given-names>W.K.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>Digital Images Processing</article-title>
          .
          <article-title>Third edition</article-title>
          . Wiley, (
          <year>2016</year>
          ):
          <fpage>738</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Nixon</surname>
            ,
            <given-names>M. S.</given-names>
          </string-name>
          <string-name>
            <surname>Aguado</surname>
            ,
            <given-names>A. S. Feature</given-names>
          </string-name>
          <string-name>
            <surname>Extraction</surname>
            and
            <given-names>Image</given-names>
          </string-name>
          <string-name>
            <surname>Processing</surname>
          </string-name>
          . - Newnes, (
          <year>2002</year>
          ):
          <fpage>350</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Parker</surname>
            <given-names>J.R.</given-names>
          </string-name>
          <article-title>Algorithms for Image Processing</article-title>
          and
          <string-name>
            <given-names>Computer</given-names>
            <surname>Vision. Second Edition</surname>
          </string-name>
          . - Wiley Publishing, Inc., (
          <year>2010</year>
          ):
          <fpage>504</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Koschan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Abidi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Detection and Classification of Edges in Color Images</article-title>
          .
          <source>IEEE Signal processing magazine</source>
          ,
          <source>January</source>
          (
          <year>2005</year>
          ):
          <fpage>64</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Roberts</surname>
          </string-name>
          .
          <source>Machine Perception of Three-Dimensional Solids, Optical and ElectroOptical Information Processing</source>
          , MIT Press, (
          <year>1965</year>
          ):
          <fpage>159</fpage>
          -
          <lpage>197</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Sobel</surname>
            ,
            <given-names>I.E. Camera Models</given-names>
          </string-name>
          <article-title>and Machine Perception</article-title>
          ,
          <source>PhD Thesis</source>
          , Stanford Univ, (
          <year>1970</year>
          ):
          <fpage>60</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Prewitt</surname>
            ,
            <given-names>J.M.S.</given-names>
          </string-name>
          <article-title>"Object Enhancement and Extraction"</article-title>
          .
          <source>Picture processing and Psychopictorics</source>
          . Academic Press. (
          <year>1970</year>
          ):
          <fpage>75</fpage>
          -
          <lpage>149</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Prewitt</surname>
            ,
            <given-names>J. M. S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Mendelsohn</surname>
            ,
            <given-names>M. L.</given-names>
          </string-name>
          <article-title>The Analysis of Cell Images, -</article-title>
          <string-name>
            <given-names>Ann. N.Y.</given-names>
            <surname>Acad</surname>
          </string-name>
          . Sci.,
          <volume>128</volume>
          , (
          <year>1966</year>
          ):
          <fpage>1035</fpage>
          -
          <lpage>1053</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Waheed</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Deng</surname>
            , G. Liu,
            <given-names>B. Discrete</given-names>
          </string-name>
          <article-title>Laplacian operator and its applications in signal processin</article-title>
          ,
          <source>IEEE Access</source>
          , VOLUME
          <volume>4</volume>
          , (
          <year>2016</year>
          ):
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Marr</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Hildreth</surname>
          </string-name>
          , E..
          <article-title>"Theory of Edge Detection"</article-title>
          .
          <source>Proceedings of the Royal Society of London. Series B</source>
          ,
          <string-name>
            <surname>Biological Sciences</surname>
          </string-name>
          .
          <volume>207</volume>
          (
          <issue>1167</issue>
          ), (
          <year>1980</year>
          ):
          <fpage>187</fpage>
          -
          <lpage>217</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Bilan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Models and hardware implementation of methods of Pre-processing Images based on the Cellular Automata</article-title>
          ,
          <source>Advances in Image and Video Processing</source>
          , Vol
          <volume>2</volume>
          , No 5 (
          <year>2014</year>
          ):
          <fpage>76</fpage>
          -
          <lpage>90</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Bilan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Riabtsev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Daniltso</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Volume increasing of secret message in a fixed graphical stego container based on intelligent image analysis</article-title>
          ,
          <source>- Information Technology and Security</source>
          , Vol.
          <volume>8</volume>
          ,
          <issue>N2</issue>
          , (
          <year>2020</year>
          ):
          <fpage>133</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Bilan</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          <article-title>Evolution of two-dimensional cellular automata</article-title>
          . New forms of presentation, -
          <source>Ukrainian Journal of Information Technologies, т. 3, №1</source>
          , (
          <year>2021</year>
          ):
          <fpage>85</fpage>
          -
          <lpage>90</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Bilan</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          <article-title>A Technique for Describing and Transforming Images Based on the Evolution of Cellular Automata, - Intelligent Solutions (Computational Intelligence &amp; Decision Making Theory)</article-title>
          . Vol-
          <volume>3106</volume>
          , (
          <year>2021</year>
          ):
          <fpage>106</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Albdour</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Zanoon</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <article-title>A Steganographic Method Based on Roberts Operator</article-title>
          .
          <source>Jordan Journal of Electrical Engineering</source>
          , V.
          <volume>6</volume>
          ,
          <issue>N3</issue>
          , (
          <year>2020</year>
          ):
          <fpage>265</fpage>
          -
          <lpage>273</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>