<!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>lvan D eykin[oooo-0002-s1-бsз1з1J</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>MoscowState TechnicalUniversityM</institution>
          ,
          <addr-line>oscow105005</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <fpage>411</fpage>
      <lpage>418</lpage>
      <abstract>
        <p>Signal imitation iswidely usedtoday sinceit helpsto bring the experimentto the virtualdomain thus eliminatingrisksof damaging realequipment. At the sametime all signals usedin the physical worldare limited Ьу the fшite band of frequencies renderinbgandpasssignalstudiesespeciallyimportant. Тhе method for imitating bandpasssignals in complexbasisis vfaoraЫe in the case of а bdanpass signalasit usesresourceesffectivelyand provide seth desiredaccuracy. Тhе authorhas implemented the method in the form of the РС application generatingsignalsaccordingto eth characteristicssetЬу theuserТ.hesecharacteristicsare:bordersdenfiing the signal's rfequency band, the time period,the numberof stepsfordiscretizationt,he specatrl densityform. Тhе РС application usesthe characteristics to generatethe signaland its experimentaalutocorelation. Тhе paplication calculatestheoreti cand algorimthic autocorelations in orderto evaluatethe quality of the imitation Ьу computing the eorr function. Тhе application visualizesall theresultinginformation via thesimple interface. Тhе application wasusedto generattewo-dimensionalsignals to highlight the presenltimitationsand to sketchthe directionforthe future. Тhе paplication is laterto Ье adapted completely to imitating multidimensionalsignals. Тhisworkisfinancially supportedЬу theRussianFederationMinistryofScienceand Higher Education intheframework of theResearcPhrojectitled"Component'sdigital transformation methods'fundeamntal resecarh for micro-dan nanosystems("Project#0705-2020-0041).</p>
      </abstract>
      <kwd-group>
        <kwd>digital signal processingD</kwd>
        <kwd>SP</kwd>
        <kwd>Fourie rfunctions</kwd>
        <kwd>two-dimensional siagnls</kwd>
        <kwd>broadbdan signal</kwd>
        <kwd>signal imitation</kwd>
        <kwd>randomsignalgenemtion</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Bauman
The word "signal" today is oknwn to everyone and is used regularly but often we don't
even suspect how often this word could Ье used but wasn't. Temporal changes of some
physical value сап Ье represented as time series or as signals. The term "signal pro­
cessing" is applicaЫe to any processes that change in time [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] including the very
large time series data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The proЫem of forecasting brings these two terms especially
close and also links them to events happening in the real world [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The fundament of
such analysis is derived ftom the theory of digital signal processing [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
plans
2
2.1
Some methods are
intensively.
      </p>
      <p>Increasing volumes of data breed growing amotuns
of information
all of which have
to Ье contained</p>
      <p>
        in the form of а sign al (or а time series), and as you have to represent
more and more linked processes the dimensions of sign
als being used grow [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Multi­
dimensional sign
als are involved when dealing with visual information:
image pro­
cessing and generation [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] or scanning diferent
sections of а brain [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Finance uses
one-dimensional time series widely but today multidimensional
si
ng
als can represent
more complex nfiancial phenomena [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Thus, digital si
ng
al processing provides meth­
ods used when analyzing or managing data which nowadays is often
multidimensional.
more efective
and work faster
which is desiraЫe when data is used
      </p>
      <p>
        The complex basis has shown itself to Ье uselfu ofr imitating one-dimensionalband­
pass sign als [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ]. The program that uses the colmpex
on one-dimensional and two-dimensional unidirectional si
ng
basis was designed and tested
als. Since the reviewed
works don't consider methods of two-dimensional sign al imitation in depth [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], deal
with visual methods [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], do not consider the broadband
use colmpex
umltidimensional
basis, it is planned then to upgrade
si
ng
als with vyaring
nbumers
of dimensions.
      </p>
      <p>Section 2 shows the results gained Ьу using the program
in the case of one-dimen­
sional sign als. Section 3 embarks upon settling ewhther
the method of signal imitation
in colmpex</p>
      <p>basis described in section 2 can Ье used to generate two-dimensional sign als
and what changes have to Ье made to increase quality of such generating. The etrfu
si</p>
      <p>ng als separately and do not
the design ed program
for imitating
are described in the conclusion.</p>
      <p>One-Dimensional Signallmitation in Complex Basis</p>
      <p>Complex Basis Imitation Algorithm
Banadpss
si</p>
      <p>
        ng al's spectrum
spectral density of the banadpss
is constrained within two border efrequncies
[
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The
si
ng al is shown on the figeur
1.
--------+-------➔fi
ber of discretization intervals N [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Discretization replaces fiL
and fiR
      </p>
      <p>with discrete
So</p>
      <p>S(ro)
borders NLdan NR. "L" stands for "Left" and "R'' stands for "Right". ХFE and ХFO are
even and odd Fourier coeficients.</p>
      <p>
        Formula of the random complex spectrum is as follows:
The formula derived for calculating the resulting signal is presented below:
The spectrum and the signal are connected through the Fourier rtansform. When imi­
tating random signal, coefficients µk and Ykrandomly take on values of "1" or "-1".
When imitating determined signal all of themjust remain set to "1". The values ofYF
on the borders depending on whether the N is odd or even are to Ье considered sepa­
rately which is dropped here in favor of the general method. These formulas to Ье used
in the program were derived Ьу Professor Syusev V. V. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and tested experimentally
Ьу the author of the current paper.
2.2
      </p>
      <p>Applying the Method
Three the signals and also three experimental autocorrelations generated Ьу the pro­
gram are presented on the figure 2.
random signals (on the left) and three resulting autocoпelations (on the right)</p>
      <p>based on the same spectral density
The resulting experimental autocorrelation is calculated as follows:</p>
      <p>1
=-­</p>
      <p>N - m</p>
      <p>I- y(i)y(i + m),
N-1-m
i=O
m Е [О,М).</p>
      <p>The program calculates diferent autocoпelations (gfiure 3). The rfist one (figure 3, а)
is an а priori theoretical autocoпelation derived directly ofrm the spectral density. The
second one (figure 3, Ь) is an algorithmic autocoпelation that uses Fourier coeficients.
The third one (figure 3, с) substitutes Fourier coefficients with their complex basis ver­
sions, this is the resulting experiment autocoпelation that is compared to the other two
in order to estimate the quality ofimitation.</p>
      <p>а)</p>
      <p>=...... ... ..... , - .c... =
0, i --- ----r----:----1---)- --1----1---- --- ----r----r-- -1----j---·i----1----r
----i·---1----r---. ,o ±iJ +-:- т-· ·-··:-· -,- :- . -: -: ;. : : :&gt;i+·:·:····</p>
      <p>=············ ····· ····=[J j:···· 1:····i(··t:"···1:····1
О 10 20 30 40 50 бО 70 80 90 10 110 120 130 140 150 160 170 180 190 20
с)
The епоr function and the mean епоr ear computed Ьу nfiding the diference between
the two autocoпelation being compared. An example ofthe епоr function calculated is
presented on the figure 4. Due to the symmetry ofthe digital spectrum the right halfof
the епоr function plot with the peak on the very right could Ье ignored.
When generating determined signals comparison is done between the resulting auto­
coпelation and the theoretical autocoпelation that is derived а priori. The random sig­
nals are qualified on the dirfeence between the experimental uatocoпelation and the
algorithmic autocoпelation.
3
3.1</p>
      <p>Two-Dimensional Signal lmitation in Complex Basis</p>
      <p>
        The Specifics of Two-Dimensional Signal Processing
The structure of multidimensional signals presents the certain level of difficulty when
it comes to both representing and processing [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Figure 5 shows the two-dimensional
signal S(ш1, ш2) = sin(шf + ш ).
The Fourier rtansform is diefrent when it comes to multidimensional signals as the
Fourier ufnctions are defined in the !И. n space. But discrete Fourier transform exchanges
the !И. n space for the n-dimensional апауs of numbers. The direct discrete Fourier rtans­
ofrm:
where О
      </p>
      <p>Ki</p>
      <p>Ai - 1, i = 1, 2, ... , п. Inverse transform:
where О а1, ... , й-п А с1,...,п) - 1.</p>
      <p>However, before advancing into two-dimensional domain it was decided to study
the specifics of the "quasi-two-dimensional" signals that are obtained Ьу stacking to­
gether random broadband one-dimensional signals generated earlier.
3.2</p>
      <p>
        Applying One-Dimensional Algorithm to Two-Dimensional Signals
Despite the need of readjusting the method for two-dimensionalsignals this method can
already Ье used. То do so we just have to transform the two-dimensionalspectral den­
sity into an raray of one-dimensionalbroadband ones stacked together. Resulting two­
dimensional specatrl density is presented on figure 6.
Then the one-dimensionalsignals comprising the two-dimensionalone can Ье gener­
ated separately and stacking them together side Ьу side provides us with а two-dimen­
sional signal (gufire 7). This signal inherits the quality of either being determinate or
random Ьу the virtue of its coeficients.
Signals generated while being two-dimensionalare unidirectional as clear ofrm the fig­
ure 7 - the most obvious trends are visiЫe on the main horizontal axis so the so called
waterfall plot appears. Waterfall plots are encountered in medicine [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], in physics [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
and in other fields where one-dimensionalsignals that follow the same etrnd are ana­
lyzed [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], therefore the need for generating arrays of such codirected signals is also
present.
      </p>
    </sec>
    <sec id="sec-2">
      <title>Conclusion</title>
      <p>This paper is а part of а new development for high-dimensional signal simulation that
is presented in the conference Ьу the paper where the author was involved too. The
method of imitation developed earlier for one-dimensional imitation was used to imitate
two-dimensional signals. Further research and adaptation of this method is to Ье per­
ofrmed in due cosure.</p>
      <p>The method of imitation in complex basis reduces algorithmization to the execution
of pre-derived mathematical equations, which reduces the computational complexity
and resource intensity of the algorithm, and the use of linear data structures positively
afects the scalaЬility of the developed solution.</p>
      <p>The software solution was implemented in the Lazarus DIE which allowed to meet
all the accuracy criteria and to create the interface. Free Pascal language used in Lazarus
IDE is very clear as it was designed Ьу mathematicians to Ье understood Ьу their col­
leagues. This language is also widely used in education field in Russia so the program
developed could Ье studied Ьу the future students during their digital signal processing
cosure.</p>
      <p>Since the in-box work with two-dimensional signals is not supported yet and to Ье
added later the results in section 3 were obtained Ьу putting the one-dimensional signals
comprising the two-dimensional one through the software and later stacking the results
back together for the visualization through MS Excel 2010.</p>
      <p>The first test of the one-dimensional algorithm being expanded to imitate two-di­
mensional signals highlighted the direction rfo tufeur development: the algorithm
should Ье adopted to allow rfo signals with diferent numbers of dimensions, the visu­
alization facilities should Ье expanded. The method as it is can Ье used for modeling
the unidirectional two-dimensional data in the form of а waterfall plot.</p>
    </sec>
    <sec id="sec-3">
      <title>Acknowledgements</title>
      <p>This work was supervised Ьу professors Syuzev V. V. and Smimova Е. V. of the Bau­
man Moscow State Technical University. The project was made possiЫe with the fi­
nancial support of the Russian Federation Ministry of Science and Higher Education in
the framework of the Research Project titled "Component's digital transformation
methods' fundamental research for micro- and nanosystems" (Project
#0705-20200041). Special gratitude goes to the organizers ofDDAМDI conference for providing
а medium suitaЫe rfo exchanging ideas and results and advancing the quality of scien­
tific work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Lyons</surname>
          </string-name>
          , R.G.,
          <source>: Understanding Digital Signal Processing (3rd Edition)</source>
          .
          <source>Prentice Hall</source>
          .
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Ceri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , et al.:
          <article-title>Overview of GeCo: А Project for Exploring and Integrating Siagnls tfom the Genome</article-title>
          . In: Kalinichenko L.,
          <string-name>
            <surname>Manolopoulos</surname>
            <given-names>У.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malkov</surname>
            <given-names>О.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skvortsov</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stupnikov</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sukhomlin</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>(eds) Data Analytics dan Management in Daat Intensive Domains</article-title>
          . DAМDID/RCDL 2017.
          <article-title>Comunications in Computer dan Information Science</article-title>
          , vol
          <volume>822</volume>
          . Springer, Cham (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Кraeva</surname>
          </string-name>
          , У., ZymЫer, М.:
          <article-title>ScalaЫe Algorithm for Subseequnce Similarity Search in Very LargeTime Series Data on Cluster of Phi LКN</article-title>
          . In:Manolopoulos У.,
          <string-name>
            <surname>Stupnikov</surname>
            <given-names>S</given-names>
          </string-name>
          . (eds)
          <article-title>Data Analytics dan Management in Data Intensive Domains</article-title>
          .
          <source>DAМDID/RCDL 2018. Communications in Computer and Information Science</source>
          , vol
          <volume>1003</volume>
          . Springer, Cham (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Andreev</surname>
            ,
            <given-names>А</given-names>
          </string-name>
          , Berezkin,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Kozlov</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Approach to Forecasting eth Developmentof Situations Based on Event Detection in HeterogeneousData Streams</article-title>
          . In: Kalinichenko L.,
          <string-name>
            <surname>Manolopoulos</surname>
            <given-names>У.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malkov</surname>
            <given-names>О.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skvortsov</surname>
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stupnikov</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sukhomlin</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>(eds) Data Analytics andManagement in Data lntensive Domains</article-title>
          .
          <source>DAМDID/RCDL 2017. Communications in Computer and Information Science</source>
          , vol
          <volume>822</volume>
          . Springer, Cham (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bourennean</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Marot</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Fossati</surname>
            ,
            <given-names>С.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Bouridane</surname>
            ,
            <given-names>А</given-names>
          </string-name>
          &amp; Spinnler,К.:
          <article-title>Multidimensional Signal Processing and Applications</article-title>
          .
          <source>ТheScientificWorldJoaurnl</source>
          .
          <year>2014</year>
          .
          <volume>365126</volume>
          . 10.1155/
          <year>2014</year>
          /365126 (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Glassner</surname>
            ,
            <given-names>A.S.:</given-names>
          </string-name>
          <article-title>Principles of Digital Image Synthesis</article-title>
          . Morgan Кaufinann PuЫishers, inc. San Frcanisco, Califomia. USA.
          <year>1995</year>
          . ISBN 1-55860-276-3.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kosinski</surname>
          </string-name>
          , К.,
          <string-name>
            <surname>Stanek</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gбrka</surname>
            ,
            <given-names>M.J.</given-names>
          </string-name>
          et al.:
          <article-title>Reconsctrution of non-uniformly sampled vfiedimensional NМR specatr Ьу signal separation algorithm</article-title>
          .
          <source>J Biomol NМR</source>
          <volume>68</volume>
          ,
          <fpage>129</fpage>
          -
          <lpage>138</lpage>
          (
          <year>2017</year>
          ). https://doi.org/10.1007 /sl0858-017-0095-8
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Popov</surname>
            ,
            <given-names>D.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milman</surname>
            ,
            <given-names>I.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pilyu gin</surname>
          </string-name>
          , V.V.,
          <string-name>
            <surname>Pasko</surname>
          </string-name>
          , А.А:
          <article-title>Visual Analytics ofMultidimensional Dynamic Data with а Fincanial Case Study</article-title>
          . In: Кalinichenko L.,
          <string-name>
            <surname>Kuznetsov</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manolopoulos</surname>
            <given-names>У</given-names>
          </string-name>
          .
          <article-title>(eds) Data Analytics dna Management in Data Intensive Domains</article-title>
          . DAМDID/RCDL 2016.
          <article-title>Comunications in Computer dan Information Science</article-title>
          , vol
          <volume>706</volume>
          . Springer, Cham (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Deykin</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Syuzev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smimova</surname>
          </string-name>
          , Е.,
          <string-name>
            <surname>Lubavsky</surname>
          </string-name>
          ,
          <source>А: Random Bandpass Signals Simulation with Complex Basis Algorithm / Science ProЫems Joaurnl</source>
          .
          <year>2019</year>
          . №
          <volume>11</volume>
          (
          <issue>144</issue>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Syuzev</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smimova</surname>
            ,
            <given-names>E.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurenko</surname>
          </string-name>
          , V.V.:
          <article-title>SpeedAlgorithms for Signal'</article-title>
          s Simulation // Science ProЫems.
          <year>2018</year>
          . №
          <volume>11</volume>
          (
          <issue>131</issue>
          ). URL: https://cyberleninka.ru/article/n/Ьystrye-algoritmy
          <article-title>-modelirovaniya-signalov (</article-title>
          <source>Date of retrieve:04.05</source>
          .
          <year>2020</year>
          )
          <article-title>- in russian.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Syuzev</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gureonk</surname>
            ,
            <given-names>V.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smimova</surname>
            ,
            <given-names>E.V.</given-names>
          </string-name>
          :
          <article-title>Signal Simulation Spectra Algorithms as Leaming dan MethodicalTools ofEngineers</article-title>
          ' Preparation//Machinery and ComputerTechnologies.
          <year>2016</year>
          . №7. URL: https://cyberleninka.ru/article/n/spektralnye
          <article-title>-algoritmy-imitatsiisignalov-kak-uchebno-metodicheskiy-instrument-podgotovki-inzhenerov(</article-title>
          <source>Date of retrieve: 04.05</source>
          .
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Kotelnikov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>А: On the carying capacity of the ether and wire in telecommunications. Materialfor the First All-UnionConrfeence on Questions ofCommunication,</article-title>
          <string-name>
            <surname>Izd. Red. Upr. Svyazi .RКА</surname>
          </string-name>
          <year>1933</year>
          . р.
          <volume>769</volume>
          -
          <fpage>770</fpage>
          . - in russian.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Johannesen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grove</surname>
            ,
            <given-names>U.S.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Serensen</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          , Schmidt, М.,
          <string-name>
            <surname>Graff</surname>
          </string-name>
          , С.,
          <string-name>
            <surname>Couderc</surname>
            ,
            <given-names>J.-P.:</given-names>
          </string-name>
          <article-title>nAalysis ofT-wave amplitudeadaptation to heart rate using RR-binningof long-termECG recordings</article-title>
          . Computing in Cardiology.
          <volume>37</volume>
          .
          <fpage>369</fpage>
          -
          <lpage>372</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Marinelli</surname>
          </string-name>
          , Е.,
          <string-name>
            <surname>Hyde</surname>
          </string-name>
          , Т.,
          <string-name>
            <surname>Matthews</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Тhе Efects of Pairtcle Size and Polydispersion on ComplexPlasma Crystal Sctruture dna Phase Transition (</article-title>
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Xu</surname>
          </string-name>
          , Х.,
          <string-name>
            <surname>Vallabh</surname>
          </string-name>
          ,С. К.,
          <string-name>
            <surname>Cleland</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cetiankya</surname>
          </string-name>
          , С.:
          <article-title>Phononic Artifacts for Real-timeIn-Situ QualityMonitoring of 3D Printed Objects at Fiber/Вond-scale</article-title>
          .
          <source>Joumal ofManufacturing Science and Engineering. 10.1115/1</source>
          .4036908 (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>