<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid/>
  <issn>2687-0517</issn>
  <journalInfo lang="ENG">
    <title>Computing, Telecommunication and Control</title>
  </journalInfo>
  <issue>
    <volume>11</volume>
    <number>2</number>
    <altNumber> </altNumber>
    <dateUni>2018</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-18</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Makarov</surname>
              <initials>Aleksei</initials>
              <email>lyohamakarov@yandex.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Bolsunovskaya</surname>
              <initials>Marina</initials>
              <email>bolsun_hht@mail.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Comparative analysis of methods for detecting special points in images at different levels of illumination</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this article, we have carried out a comparative analysis of methods for detecting special points in an image, which is part of the study on developing an around view system for large vehicles. Because nighttime is especially dangerous for driving and most difficult for stitching images, this article focused on the possibility of detecting special points and stitching in low illumination. We made a comparative analysis of the methods for detecting special points in images, developed a technique and conducted experiments to find special points in images using such methods as SURF, MSER, BRISK, Harris, FAST and MinEigen. During the study, we have performed a search for identical special points for a pair of images, an analysis of their number and stitching of images by different methods at different levels of illumination. The results of the experiments are given in graphs and tables.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11201</doi>
          <udk>004.932</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>detecting special points</keyword>
            <keyword>stitching images</keyword>
            <keyword>low level of illumination</keyword>
            <keyword>comparison technique</keyword>
            <keyword>SURF</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.1/</furl>
          <file>2018_2_01.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>19-31</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Pyattaev</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>RUDN University</orgName>
              <surname>Andreev</surname>
              <initials>Sergey</initials>
              <email>serge.andreev@gmail.com</email>
              <address>6, Miklukho-Maklaya str., Moscow, 117198, Russia</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <researcherid>D-5155-2014</researcherid>
              <scopusid>6507253900</scopusid>
              <orcid>0000-0003-3976-2971</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Higher School of Economics</orgName>
              <surname>Yevgeni</surname>
              <initials>A.</initials>
              <email>ykoucheryavy@hse.ru</email>
              <address>Korkeakoulunkatu 10, FI-33720 Tampere Finland</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Design and evaluation of a system of direct connections D2D with LTE cellular assistance</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Due to the growing popularity of mobile user applications, cellular network operators are increasingly interested in offloading their scarce licensed spectrum resources. To this aim, using unlicensed-band radio technologies is attractive owing to its reduced costs. This work designs a system of direct D2D (device-to-device) connections to offload mobile traffic that is served by LTE (long-term evolution) cellular networks. In particular, a network assistance protocol over LTE architecture is proposed for D2D connections, and its system-level performance is evaluated to quantify the resulting traffic-steering efficiency. In addition, practical operation of D2D communication in a test LTE network is described, which allows making substantiated conclusions about the actual feasibility of the proposed solution in real-life conditions.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11202</doi>
          <udk>004.77</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>mobile traffic</keyword>
            <keyword>LTE cellular communication</keyword>
            <keyword>direct connections with network assistance</keyword>
            <keyword>WiFi Direct radio technology</keyword>
            <keyword>design and evaluation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.2/</furl>
          <file>2018_2_02.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>35-46</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Saint Petersburg State University</orgName>
              <surname>Moiseenko</surname>
              <initials>Evgenii</initials>
              <email>e.moiseenko@2012.spbu.ru</email>
              <address>7-9 Universitetskaya Emb., St Petersburg 199034, Russia</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Saint Petersburg State University</orgName>
              <surname>Podkopaev</surname>
              <initials>Anton</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Relational programming with memoization and negation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The relational paradigm allows to express programs as relations. Unlike functions, the relations do not distinguish input and output parameters, thus a single relational program can be used to solve several related problems. Relational interpreters are of particular interest. These interpreters can execute a program, check that the program satisfies a set of constraints or generate a program that has specified properties. In order to take advantages of the relational interpreter, the developer needs to define the semantics of the programming language as a relation. In this work, we present an implementation of two useful extensions of relational programming: tabling and constructive negation. Tabling helps to traverse the state space of the interpreter efficiently. Constructive negation allows to check that some state of the interpreter is unreachable. We show how this extensioncan be used on an example of a relational interpreter for a concurrent imperative programming language.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11203 </doi>
          <udk>004.434 </udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>relational programming</keyword>
            <keyword>declarative programming</keyword>
            <keyword>constraint logic programming</keyword>
            <keyword>tabling</keyword>
            <keyword>constructive negation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.3/</furl>
          <file>2018_2_03.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>47-53</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Norilsk State Industrial Institute</orgName>
              <surname>Sulyaev</surname>
              <initials>Ilgiz</initials>
              <email>ilgizfinland@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>“Norilsk Nickel”</orgName>
              <surname>Sedov</surname>
              <initials>Dmitriy</initials>
              <email>dvsedov95@mail.ru</email>
              <address>Norilsk</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Modeling of a low-pressure air separator as a control object</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article deals with the task of developing a mathematical model of an air separator as the control object. We have carried out systematic analyses of the object and built a conceptual model with the principle of revelation consistency according to vagueness. The results of active and passive identification are presented. The analysis of the experiment results is carried out. The causes of divergences, which are determined mainly because of structural peculiarities, are established.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11204</doi>
          <udk>681.5 </udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>air-separation</keyword>
            <keyword>oxygen</keyword>
            <keyword>identification</keyword>
            <keyword>mathematical model</keyword>
            <keyword>systematic analysis</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.4/</furl>
          <file>2018_2_04.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>55-63</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Tian</surname>
              <initials>Zhaolin</initials>
              <email>peter0431peter@gmail.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Zhang</surname>
              <initials>Weiwei</initials>
              <email>soszhang@outlook.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Sequence-to-Sequence Based English-Chinese Translation Model </artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In recent years, with the continuous improvement of theory in artificial intelligence, artificial neural networks has become novel tools for machine translation. Compared with traditional Statistical Machine Translation (SMT), neural network based Neural Machine Translation (NMT) transcends SMT in many aspects such as translation accuracy, long distance reordering, syntax, tolerance to noisy data et al. In 2014, with the emergence of sequence-to-sequence (seq2seq) models and attentional mechanisms introduced into the model, NMT was further refined and its performance was getting better and better. This article uses the current popular sequence-to-sequence model to construct a neural machine translation model from English to Chinese. In addition, this paper uses Long-Short Term Memory (LSTM) to replace the traditional RNN in order to solve the problem of gradient disappearance and gradient explosion that it faces in long-distance dependence. The attention mechanism has also been introduced into this article. It allows neural networks to pay more attention to the relevant parts of the input sequences and less to the unrelated parts when performing prediction tasks. In the experimental part, this article uses TensorFlow to build the NMT model described in the article.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11205</doi>
          <udk>004</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>NMT</keyword>
            <keyword>seq2seq</keyword>
            <keyword>LSTM</keyword>
            <keyword>attention mechanism</keyword>
            <keyword>encoder-decoder</keyword>
            <keyword>TensorFlow</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.5/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>64-71</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Sichkar</surname>
              <initials>Valentin</initials>
              <email>valentyn.s2014@yandex.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Comparison analysis of knowledge-based systems for navigation of mobile robot and collision avoidance with obstacles in unknown environment</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Developing systems for intelligent navigation is one of the major problems in world of modern robotics. This problem is particularly urgent when the environment is unknown. It means that a mobile robot meeting unpredictable obstacles on its way and has to react according to the current situation fast and in real time. That is why developing such a system is always a big challenge. This paper studies different techniques for storing and using the knowledge in order to avoid collisions with obstacles. Most attention is paid for developing two types of Knowledge Bases to help the mobile robot to avoid possible collisions and continue its way. A comparison analysis is provided for these two different types of Knowledge Bases. The advantages and disadvantages were analyzed and described.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.11206 </doi>
          <udk>004.81 </udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>mobile robot</keyword>
            <keyword>intelligent navigation</keyword>
            <keyword>obstacle avoidance</keyword>
            <keyword>symbolic knowledge base</keyword>
            <keyword>neural network knowledge base</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2018.57.6/</furl>
          <file/>
        </files>
      </article>
    </articles>
  </issue>
</journal>
