<!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>The Construction of the Algorithm Study Based on the Mathematical Model of Motion</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>National Aviation University</institution>
          ,
          <addr-line>pr. Kosmonavta Komarova, 1, Kiev, 03680, Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The purpose of this work is the construction of the algorithm study a neural network based on the mathematical model of the motion in remotely piloted aircraft systems (RPAS) or unmanned vehicle aircraft (UAV). Information technologies are considered in the UAV control system to provide two-way information transfer between the on-board computer UAV and the operator. The problem arises in the analysis of big amounts of data with information which come from the operator to the on-board computer and in the opposite direction, as well as with a constant change under the influence of external factors. In case of distorted data transmission or collision with obstacles a hang-up and drop of the UAV is possible. Taking into account the rapid growth of UAV usage for civilian and military purposes, the neural network training algorithm for processing the input signal is offered. It can facilitate the task of data analysis and reduce the likelihood of uncertain situations. This algorithm is designed to predict the development of the situation, increase accuracy, the rate of information transfer and its reliability.</p>
      </abstract>
      <kwd-group>
        <kwd>unmanned aerial vehicle</kwd>
        <kwd>information technology</kwd>
        <kwd>data transmission</kwd>
        <kwd>algorithm study</kwd>
        <kwd>big amounts of data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>To build the neural network of the algorithm study for two-way information transfer,
it is necessary to collect and prepare data for training; determine the parameters of the
model for training; implement the model in the form of program code; train the model
on the collected data; test the model.</p>
      <p>The RPAS or UAV includes its own control system, which usually also contains an
engine. The control system solves the problem of controlling a particular engine in
order to achieve the given values of the generalized coordinates. The task for
controlling the engines is to bring the BTS to the trajectory control level, where the task of
calculating the generalized coordinates and selecting the trajectory for achieving the
specified position or position is solved.
1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Data Collection</title>
      <p>The main stage in the construction the algorithm of study is the collection and
preparation of data for learning the model. Required data for the collection, storage and
processing of information between the operator and the on-board computer of the
UAV - the altitude, latitude, longitude and turns in the Euclidean coordinate system
relative to the UAV coordinate system, known as Euler angles: pitch, roll and yaw.</p>
      <p>Preliminary processing of the data usually improves the results, so it is worth
deleting obviously wrong combinations. After that, the information is divided into parts
(height, angles of rotation, coordinate values). Next, a dictionary is created, the data is
transferred to key arrays, which will be the input data for the information transfer
model (dialog model).
2
2.1</p>
      <sec id="sec-2-1">
        <title>Theoretical Basics</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Dialog Model</title>
      <p>
        In this work, the Sequence-to-Sequence dialog model, proposed by Google, is
implemented, which is successfully used in the task of machine translation. Training takes
place with the teacher, the input is given a sequence of tokens (the phrase in the
original language), output too (translation) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>This model can also be used for information transfer (dialog model). The
difference is that instead of translating from one language to another, one language is used.
The question and answers should be the same, the axis is the time axis.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>The Algorithm of Study</title>
      <p>
        In this work, the algorithm of study the recurrent neural network Long short-term
memory (LSTM) is implemented [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] (see Fig. 1).
1
0
1
1
      </p>
      <p>EOL
1
0</p>
      <p>1
LSTM Encoder
1</p>
      <sec id="sec-4-1">
        <title>LSTM Decoder</title>
        <p>Long Short Term Memory networks – usually just called “LSTMs” – are a special kind
of Recurrent Neural Networks (RNN), capable of learning long-term dependencies. They
W</p>
        <p>
          EOL
were introduced by Hochreiter &amp; Schmidhuber (1997), and were refined and popularized
by many people in following work [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>LSTMs are explicitly designed to avoid the long-term dependency problem.
Remembering information for long periods of time is practically their default behavior, not
something they struggle to learn.</p>
        <p>
          Other attempts to avoid the long-term dependency problem include the use of
powerful second order optimization algorithms [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ][
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], regularization of the RNN’s weights that
ensures that the long-term dependency does not vanish [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], giving up on studying the
recurrent weights altogether [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ][
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and a very careful initialization of RNN’s parameters
[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>All recurrent neural networks have the form of a chain of repeating modules of neural
network. In standard RNNs, this repeating module will have a very simple structure, such
as a single tanh layer (hyperbolic tangent).</p>
        <p>LSTMs also have this chain like structure, but the repeating module has a different
structure. Instead of having a single neural network layer, there are four, interacting in a
very special way.</p>
        <p>The main feature of recurrent networks in comparison with traditional ones is the
presence of feedbacks, by means of which signals, which are some sequence, from the
outputs of these neurons are fed to their inputs. The values of the sequence are
transmitted along with the predictions until the sequence ends.</p>
        <p>
          Unlike simple recurrent networks, LSTM has three filters (input, output, forget), with
which the signal is controlled inside a neuron [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] (see Fig. 2).
        </p>
        <sec id="sec-4-1-1">
          <title>Using LSTM for the Construction of the Algorithm Study</title>
          <p>
            The parameters of the signal include the accuracy and speed of information transfer.
By processing the input signal properly, you can significantly simplify the task of
analyzing information, its accuracy, rate and reliability of transmission. Manually
adjusting the signal parameters when changing the characteristics of information in
time, requires a lot of time. Therefore, for signal processing, its analysis depends on
the influence of external factors, the signal must first be processed. One of the
approaches to solving this problem is the construction of an expert model and
algorithms for the logical derivation of solutions using certain methods of adjusting the
signal parameters [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ].
          </p>
          <p>Another approach is the implementation of the neural network training algorithm
to provide reliable two-way information transfer between the on-board computer of
the UAV and the operator.
3.1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Mathematically</title>
      <p>Let's describe the LSTM additions mathematically. At time t, we receive a new input
xt. We also have our long-term and working memories passed on from the previous
time step, ltmt−1 and wmt−1 (both n-length vectors), which we want to update.</p>
      <p>We'll start with our long-term memory. First, we need to know which pieces of
long-term memory to continue remembering and which to discard, so we want to use
the new input and our working memory to learn a remember gate of n numbers
between 0 and 1, each of which determines how much of a long-term memory element
to keep. (1 means to keep it, 0 means to forget it entirely).</p>
      <p>We can use a small neural network to learn this remember gate.</p>
      <p>Next, we need to compute the information we can learn from xt, i.e., a candidate
addition to our long-term memory.</p>
      <p>remembert = σ(Wrxt+Urwmt−1)
ltm′t = ϕ(Wlxt + Ulwmt−1),
savet = σ(Wsxt + Uswmt−1)
ϕ is an activation function, commonly chosen to be tanh.</p>
      <p>Before we add the candidate into our memory, though, we want to learn which
parts of it are actually worth using and saving.</p>
      <p>Combine all these steps. After forgetting memories we don't think we'll ever need
again and saving useful pieces of incoming information, we have our updated
longterm memory.</p>
      <p>ltmt = remembert∘ltmt−1 + savet∘ltm′t ,
where ∘ denotes element-wise multiplication.
(1)
(2)
(3)
(2)</p>
      <p>Next, let's update our working memory. We want to learn how to focus our
longterm memory into information that will be immediately useful. Let’s study a
focus/attention vector.</p>
      <sec id="sec-5-1">
        <title>Our working memory is then:</title>
        <p>focust=σ(Wfxt+Ufwmt−1)
wmt = focust ∘ ϕ(ltmt)
(5)
(6)</p>
        <p>In other words, we pay full attention to elements where the focus is 1, and ignore
elements where the focus is 0.
3.2</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Structure of the Software</title>
      <p>For realization in the information storage unit, a matrix of values of the required
quantities is created depending on the time. The values for storage are: height, latitude,
longitude, pitch, roll and yaw, the time period is set to 1, 2 and 3 seconds.</p>
      <p>The result of the operation of the information analysis algorithms and the neural
network training algorithm depends directly on the input data. I.e. from the signal,
which corresponds to the exact parameters.</p>
      <p>As a neural network, there are 100 cells LSTM.</p>
      <p>The received information is broken by element, and we learn the recurrent neural
network to predict the next bit of information based on the previous bits.</p>
      <p>Having learned a neural network, we can perform predictions of the next chain in
this way.</p>
      <p>We select the initial symbol. You can take just anyone with equal probability, or
consider the probability of the appearance of symbols in the transmission / receipt.
Either take the frequencies of the initial transmission symbol.</p>
      <p>Then, in the loop, take the previously selected symbol and skip it through RNN,
obtaining the output vector of the forecast.</p>
      <p>The output layer works by softmax activation, so that the predicted neural network
forecasts correspond to the probability of appearance of characters from the set.</p>
      <p>We generate a random number [0,1) and choose a symbol according to these
probabilities. Add the selected symbol to the chain and repeat the procedure a number of
times.</p>
      <p>To improve the code, each sentence on which RNN is learning is framed by two
special characters &lt;begin&gt; and &lt;end&gt;.</p>
      <p>To start generating a new sentence, it is enough to apply a token &lt;start&gt; to the
input of the neural network. And the neural network itself knows which symbols
usually come first. Also, if the choice on the next step falls on the symbol &lt;end&gt;, then we
interrupt. This provides a more beautiful ending for the sequences being created.</p>
      <p>
        For development, the Google Tensorflow library [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] was used. The function that
initializes the Sequence-to-Sequence model is shown below:
decoderOutputs, states =
tf.contrib.legacy_seq2seq.embedding_attention_seq2seq(
self.encoderInputs,
self.decoderInputs,
encoDecoCell,
self.textData.getVocabularySize(),
self.textData.getVocabularySize(),
embedding_size=self.args.embeddingSize,
output_projection=outputProjection.getWeights()
if outputProjection else None,
feed_previous=bool(self.args.test) )
      </p>
      <p>The LSTM cell creation code is:
def create_rnn_cell():
encoDecoCell = tf.contrib.rnn.BasicLSTMCell(</p>
      <p>self.args.hiddenSize,
)
if not self.args.test:
encoDecoCell = tf.contrib.rnn.DropoutWrapper(
encoDecoCell,
input_keep_prob=1.0,
output_keep_prob=self.args.dropout
)
return encoDecoCell
self.encoderInputs - list of the number of neurons on the hidden layer.
self.decoderInputs - a list with the same length as self.encoderInputs, but it is used
as a decoder in the sequence2sequence model.</p>
      <p>self.textData.getVocabularySize () - the number of unique tokens.
self.args.embeddingSize - the dimension of each sequence.
encoDecoCell - cell type (neuron), maybe both LSTM, and GRU.</p>
      <p>tf.contrib.rnn.DropoutWrapper - during the network training, the random part of
the neurons does not participate in the prediction, which allows the model not to
retrain.</p>
      <p>Symbols of the beginning and the end of the chain are added by hand, since they
are not in the library explicitly.</p>
      <p>chars_set.add( '\r' )
chars_set.add( '\n' )
Parameters for creating this model:
- maximum sequence length - 20 conversations;
- number of hidden layers - 6;
- the number of neurons on each hidden layer is 64;
- the number of examples that must pass through the network before updating the
scale - 32;</p>
      <p>- number of epochs – 20.
3.3</p>
    </sec>
    <sec id="sec-7">
      <title>Training Model</title>
      <p>
        Training recurrent neural with the help of the CPU requires a lot of resources and, as a
consequence, takes a long time. Therefore, the training of the model will be
conducted on the cloud service. For example, from the company Amazon [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. With its help,
the training of such a model of a long 20 it is possible to train in 10-15 seconds for an
epoch.
3.4
      </p>
    </sec>
    <sec id="sec-8">
      <title>Results</title>
      <p>The model was tested on similar data during signal transmission.</p>
      <p>Data for training was taken on 100 cells of the LSTM model, which is not enough,
and the model constructed did not always correspond correctly, the prediction
algorithm was not always accurate.</p>
      <p>
        For example, in order to obtain reliable results, more than 1 million dialogues were
used in problem [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
4
      </p>
      <sec id="sec-8-1">
        <title>Conclusions</title>
        <p>This work describes the construction of an algorithm based on the mathematical
model of UAV motion, the process of collecting data for constructing an algorithm. It
describes the approach to the implementation and training of the dialogue model
using the LSTM network, the basic principles of the work of recurrent neural networks.
A mathematical description is given and a program is written for using LSTM to build
the learning algorithm.</p>
        <p>The structure of the long-term memory of the neural network is developed.</p>
        <p>An algorithm for training the neural network is proposed to provide reliable
twoway information transfer between the on-board computer of the UAV and the
operator.</p>
        <p>An algorithm for working with the determination of the probability of the
appearance of symbols in the transmission/receipt is given.</p>
        <p>The constructed matrix for the information storage unit. As a neural network, 100
LSTM cells are taken. The main parameters for creating such an algorithm of training
based on the mathematical model of motion for UAV are described.</p>
        <p>The Google Tensorflow library was used for development.</p>
        <p>
          To improve the results of the dialogue model it is necessary to collect more data,
apply word2vec technology for data preparation [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], optimize the model parameters
(number of layers, number of neurons).
        </p>
        <p>In the future, scientific research should be directed at increasing the speed of
information processing.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vinyals</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          :
          <article-title>Sequence to sequence learning with neural networks</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          , Location (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Greff</surname>
          </string-name>
          , К.,
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koutník</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steunebrink</surname>
            ,
            <given-names>B.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            <given-names>J.:</given-names>
          </string-name>
          <article-title>LSTM: A Search Space Odyssey</article-title>
          .
          <source>IEEE Transactions on Neural Networks and Learning Systems</source>
          <volume>28</volume>
          ,
          <fpage>2222</fpage>
          -
          <lpage>2232</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Hochreiter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Long short-term memory</article-title>
          .
          <source>Neural Computation</source>
          <volume>9</volume>
          (
          <issue>8</issue>
          ),
          <fpage>1735</fpage>
          -
          <lpage>1780</lpage>
          (
          <year>1997</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>James</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Deep learning via hessian-free optimization</article-title>
          .
          <source>In: Proceedings of the 27th International Conference on Machine Learning (ICML-10)</source>
          , pp.
          <fpage>735</fpage>
          -
          <lpage>742</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Martens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.:</given-names>
          </string-name>
          <article-title>Learning recurrent neural networks with hessian-free optimization</article-title>
          .
          <source>In: Proceedings of the 28th International Conference on Machine Learning (ICML11)</source>
          , pp.
          <fpage>1033</fpage>
          -
          <lpage>1040</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Pascanu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>On the difficulty of training recurrent neural networks</article-title>
          . In: Cornell University Library. Computer science, Learning, (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jaeger</surname>
          </string-name>
          , H.:
          <article-title>The echo state approach to analysing and training recurrent neural networkswith an erratum note</article-title>
          . Bonn, Germany: German National Research Center for Information
          <source>Technology GMD Technical Report</source>
          ,
          <volume>148</volume>
          :
          <fpage>34</fpage>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Jaeger</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haas</surname>
          </string-name>
          , H.:
          <article-title>Harnessing nonlinearity: Predicting chaotic systems and saving energy in wireless communication</article-title>
          .
          <source>Science</source>
          <volume>304</volume>
          (
          <issue>5667</issue>
          ),
          <fpage>78</fpage>
          -
          <lpage>80</lpage>
          (
          <year>2004</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dahl</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinton</surname>
          </string-name>
          , G.:
          <article-title>On the importance of initialization and momentum in deep learning</article-title>
          .
          <source>In: Proceedings of the 30th International Conference on Machine Learning (ICML13)</source>
          , pp.
          <fpage>1139</fpage>
          -
          <lpage>1147</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Graves</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Generating sequences with recurrent neural networks</article-title>
          . In: Cornell University Library. Computer science,
          <source>Neural and Evolutionary Computing</source>
          , (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Graf</surname>
            ,
            <given-names>M.S.:</given-names>
          </string-name>
          <article-title>Metod avtomatychnogo pidboru sposobu koryguvannya tochnosti ta shvidkosti peredachi informacii v bezpilotnomu povitryanomu sudni. VII Miznarodna naukovotehnichna konferenciya “ITSEC”</article-title>
          . Zbirnic tez,.pp.
          <fpage>46</fpage>
          -
          <lpage>47</lpage>
          (
          <year>2017</year>
          )
          <article-title>(in Ukrainian)</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Abadi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , et al.:
          <article-title>TensorFlow: Large-scale machine learning on Heterogeneous distributed systems</article-title>
          . In: Cornell University Library. Computer science, Distributed, parallel, and cluster computing, (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. AWS Documentation, Regions and
          <string-name>
            <given-names>Availability</given-names>
            <surname>Zones</surname>
          </string-name>
          . Homepage, https://docs.aws.amazon.com/AmazonRDS/latest/UserGuide/Concepts.
          <source>RegionsAndAvaila bilityZones.html, last accessed</source>
          <year>2014</year>
          /10/31.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Auli</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galley</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Quirk</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zweig</surname>
          </string-name>
          , G.:
          <article-title>Joint Language and Translation Modeling with Recurrent Neural Networks</article-title>
          .
          <source>In: CONFERENCE</source>
          <year>2013</year>
          , EMNLP, pp.
          <fpage>1044</fpage>
          -
          <lpage>1054</lpage>
          . Seattle, Wasington (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Efficient Estimation of Word Representations in Vector Space</article-title>
          . In: Cornell University Library. Computer science, Computation and language, (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>