<?xml version="1.0" encoding="utf-8"?>
<journal>
  <titleid/>
  <issn>2687-0517</issn>
  <journalInfo lang="ENG">
    <title>Computing, Telecommunication and Control</title>
  </journalInfo>
  <issue>
    <number>1</number>
    <altNumber>212</altNumber>
    <dateUni>2015</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-15</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Starikov</surname>
              <initials>Vladimir</initials>
              <email>vl.vl.starikov@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Babkov</surname>
              <initials>Valery</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Nikitina</surname>
              <initials>Alexandra</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Definition оf the Spatial and Technical Parameters LTE Network</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article contains methods of planning the initial approximation LTE network and choosing the cluster structure. All main problems of RF Planning are inside the initial approximation LTE network. This network requires the accurate calculation of capacity, subscriber capacity and cluster structure. We have offered the system of mass service for calculating the subscriber capacity. Spatial and technical parameters need clarification too. They will depend on MAPL when using the selected MCS and equipment parameters. Therefore the planning procedure can be started only after defining these parameters. This article presents the algorithm for generating the initial approximation LTE network.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.1</doi>
          <udk>621.397</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>LTE RF planning</keyword>
            <keyword>cluster 4G</keyword>
            <keyword>LTE radio link budget</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.1/</furl>
          <file>01.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>16-21</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Popov</surname>
              <initials>Sergey</initials>
              <email>popovserge@gmail.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Glazunov</surname>
              <initials>Vadim</initials>
              <email>neweagle@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kurochkin</surname>
              <initials>Mikhail</initials>
              <email>kurochkin_ma@spstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Qualification Routes Messaging for Dynamic Systems Using Logical-probabilistic Method</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper we have considered the problem of message routes evaluation in the dynamic network of mobile subscribers. The network of mobile objects is represented by a graph with the time-varying structure. The search of the optimal route at any given time has polynomial complexity. As a solution, we suggest the logical-probabilistic method to build estimates of the routes. This method allows obtaining an analytical expression of the message delivery probability function for a s-connected graph with the given dimension. In this case, the time of searching for an optimal route can be considered as a constant.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.2</doi>
          <udk>004.22,658.5,65.011.56</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>function of mesage delivery probability</keyword>
            <keyword>mobile object</keyword>
            <keyword>dynamic system</keyword>
            <keyword>route mesaging</keyword>
            <keyword>logical-probabili</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.2/</furl>
          <file>02.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>23-36</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Bylina</surname>
              <initials>Mariya</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Improved Model and Computing Technique of TDR Ttrace for a Transmission Line with Discontinuities</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Time domain reflectometry method and time domain reflectometers are used to monitor the state of continuity for transmission lines. The method is based on probing the transmission line with short voltage pulses and return stream signal registration. Functionality of existing TDRs can be enhanced by the use of digital processing TDR traces. The digital processing should be based on adequate models of a transmission line with discontinuities and return stream signal (TDR trace). This paper presents the improved mathematical model of TDR trace for a transmission line with discontinuities. The model allows for the complex character and frequency response of the particular impedance. The paper also comes up with the results of theoretical and experimental studies. The results demonstrate the need of the model refinement and validity of the proposed formulas.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.3</doi>
          <udk>621.315</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>transmission line</keyword>
            <keyword>time domain reflectometry</keyword>
            <keyword>time domain reflectometers</keyword>
            <keyword>TDR</keyword>
            <keyword>TDR trace</keyword>
            <keyword>transmission line with discontinuities</keyword>
            <keyword>discontinuity</keyword>
            <keyword>mathematical model</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.3/</furl>
          <file>03.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>37-48</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Melikhova</surname>
              <initials>Antonina</initials>
              <email>antonina_92@list.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <researcherid>U-4200-2017</researcherid>
              <scopusid>6506501810</scopusid>
              <orcid>0000-0002-6916-9061</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Igor</surname>
              <initials>A.</initials>
              <email>tsikin@mail.spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Angle of Arrival Method for Global Navigation Satellite Systems Integrity Monitoring</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper considers the method of monitoring the integrity of global navigation satellite systems based on using the angle of arrival estimation. The method uses the differences between measured and calculated azimuths (“azimuth differences”) and elevations (“elevation differences”) respectively. The probability distributions of the differences are analyzed and probability-based integrity monitoring characteristics are obtained. The most important of them are the probability of false detection (false alarm probability) and the probability of missing the violation of integrity (missing probability). Three kinds of decision-making procedures are analyzed. The first one involves using only one of the differences for decision-making, whereas other procedures use each of them. In the latter case it is possible to use two ways of decision-making – when both differences exceed the thresholds simultaneously (logic “AND”) and at least one of them exceeds the threshold (logic “OR”). Both ways are analyzed and areas where parameter values, in either way, have advantages are obtained. As a result the probability-based characteristics improvement methods are suggested.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.4</doi>
          <udk>621.37</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>navigation field integrity monitoring</keyword>
            <keyword>global navigation satellite systems</keyword>
            <keyword>multiple arrays</keyword>
            <keyword>angle of arrival integrity monitoring</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.4/</furl>
          <file>04.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>49-57</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Trosko</surname>
              <initials>Igor</initials>
              <email>saiu@ftk.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Vladimir</surname>
              <initials>N.</initials>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Ryabov</surname>
              <initials>Gennadiy</initials>
              <email>genaryabov@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Estimation Region of Stability for Energy System Based on the Direct Method of Lyapunov</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The current work is dedicated to analytical and numerical methods of analyzing stability in electromagnetic and electromechanical processes of the electric power system (EPS). The EPS, considered in the present article, runs in the external network of infinite power. The algorithm of estimating the stability region's boundary was obtained using Lyapunov's Direct Method, and an analytical technique to study the system's stability was developed based on the algorithm. The suggested technique was used to study the EPS and the boundary of its stability region during the generator's frequency variation and various ratios of linear and nonlinear terms of the mathematical model of the studied system.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.5</doi>
          <udk>517.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>stability region</keyword>
            <keyword>electric power system</keyword>
            <keyword>Lyapunov's direct method of</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.5/</furl>
          <file>05.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>60-73</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Smolov</surname>
              <initials>Sergey</initials>
              <email>smolov@ispras.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Kamkin</surname>
              <initials>Alexander</initials>
              <email>kamkin@ispras.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A Method of Extended Finite State Machines Construction from HDL Descriptions Based on Static Analysis of Source Code</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The complexity of digital microelectronic hardware grows steadily, which complicates its functional verification and makes the methods of automated functional verification extremely important. Such methods usually use models that are formal representations of hardware descriptions. Such models are suitable for functional test generation and/or property checking. These models are often manually built, which can cause errors or unexpected behavior. This paper comes up with a new method of automated extraction of extended finite-state machine models from hardware descriptions. The key feature of the method is automated detection of hardware module's registers that encode the module's state. The experimental results of the method's application are also presented in the paper.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.6</doi>
          <udk>004.05</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>digital hardware</keyword>
            <keyword>functional verification</keyword>
            <keyword>hardware description language</keyword>
            <keyword>static analysis</keyword>
            <keyword>functional test generation</keyword>
            <keyword>model checking</keyword>
            <keyword>logic synthesis</keyword>
            <keyword>extended finite-state machine</keyword>
            <keyword>guarded action</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.6/</furl>
          <file>06.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>74-87</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Podymov</surname>
              <initials>Vladislav</initials>
              <email>valdus@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Chemeritskiy</surname>
              <initials>Eugene</initials>
              <email>tyz@lvk.cs.msu.su</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Zakharov</surname>
              <initials>Vladimir</initials>
              <email>zakh@cs.msu.su</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Altukhov</surname>
              <initials>Viktor</initials>
              <email>victoralt@lvk.cs.msu.su</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">VERMONT – a Toolset for Verification of Software Defined Networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper we present the software toolset VERMONT (VERifying MONiTor) for runtime checking the consistency of Software Defined Network (SDN) configurations with formally specified invariants of Packet Forwarding Policies (PFPs). VERMONT can be installed in line with the control plane to observe state changes of a network by intercepting the exchange of messages and commands between network switches and SDN controller, to build an adequate formal model of the whole network, and to check every event, such as installation, deletion, or modification of rules, port and switch up and down events, against a set of PFP invariants. Before retransmitting a network updating command to the switch, VERMONT simulates the result of its execution and checks PFP requirements. If a violation of some PFP invariant is detected, VERMONT blocks the change, alerts a network administrator, and gives some additional information to elucidate a possible source of the error. We define a SDN mathematical model used in our toolset, discuss some algorithmic and engineering issues of our toolset. After introducing a formal model of SDN and a formal language for PFP specification, we outline the main algorithms used in VERMONT for SDN model building, model checking, and model modification, and describe the structure of VERMONT and the functionality of its components. Finally, we demonstrate the results of our experiments on the application of VERMONT to a real-life network.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.7</doi>
          <udk>519.681</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>runtime verification</keyword>
            <keyword>formal specification</keyword>
            <keyword>model checking</keyword>
            <keyword>software defined network</keyword>
            <keyword>controller</keyword>
            <keyword>switch</keyword>
            <keyword>packet forwarding relation</keyword>
            <keyword>network update</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.7/</furl>
          <file>07.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>88-96</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Barygin</surname>
              <initials>Ilya</initials>
              <email>ibarygin@devexperts.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Brekelov</surname>
              <initials>Vsevolod</initials>
              <email>vsevolod.brekelov@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Borisov</surname>
              <initials>Egor</initials>
              <email>borisov@devexperts.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Integration Testing Automation: Case Study of Financial Data Exchange Modules Based on FIX-protocol</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The majority of modern trading systems use FIX-protocol as a transport protocol for data services. Manual testing of trading system integration modules responsible for FIX messaging is an overly laborious process. The paper describes a complex automated testing approach for this type of integration testing, which incorporates improvements to test the documentation structure, and tackles the problem of vendors diversity, as well as the resulting functional coverage and timing estimates of the tests. The major outcome of this work is a complete and unified auto tests set with associated documentation, which sufficiently accelerates testing procedures and allows fast incorporation of new vendors and fast adaptation to changes in existing specifications.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.8</doi>
          <udk>004.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>FIX-protocol test</keyword>
            <keyword>automation</keyword>
            <keyword>integration testing</keyword>
            <keyword>test case</keyword>
            <keyword>trading system</keyword>
            <keyword>exchange</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.8/</furl>
          <file>08.pdf</file>
        </files>
      </article>
      <article>
        <artType>REV</artType>
        <langPubl>RUS</langPubl>
        <pages>101-109</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Shchemelinin</surname>
              <initials>Dmitry</initials>
              <email>dshchmel@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Efimov</surname>
              <initials>Vadim</initials>
              <email>2vadim@inbox.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Mescheryakov</surname>
              <initials>Sergey</initials>
              <email>serg-phd@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">International Congress on Ultra Modern Telecommunications and Control Systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper is a summary of the 6th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT) [1]. ICUMT series of the annual conference has been indexed in Elsevier’s Scopus [2], the largest citation database of peer-reviewed scientific publications in the world. ICUMT abstracts and proceedings are published in the IEEE Xplore Digital Library [3] though PDF versions of the author’s papers and even the Internet access to Scopus web site are not free. This paper presents a brief description of the most relevant presentations of keynote speakers to ICUMT-2014.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.9</doi>
          <udk>004=111</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>telecommunications</keyword>
            <keyword>networking</keyword>
            <keyword>automated control systems</keyword>
            <keyword>performance</keyword>
            <keyword>capacity</keyword>
            <keyword>cloud computing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.9/</furl>
          <file>09.pdf</file>
        </files>
      </article>
      <article>
        <artType>REV</artType>
        <langPubl>RUS</langPubl>
        <pages>110-119</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Shchemelinin</surname>
              <initials>Dmitry</initials>
              <email>dshchmel@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Mescheryakov</surname>
              <initials>Sergey</initials>
              <email>serg-phd@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Rudenko</surname>
              <initials>Alexander</initials>
              <email>rudenko.ao@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">ASE International Conferences on Big Data Science and Computing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper is the analytical overview of the series of the International conferences on big data, which are being organized annually by the Academy of Science and Engineering (ASE) in the USA at Stanford, Cambridge, Harvard, and other famous universities [1]. The conference proceedings are published with open Internet access in the ASE scientific digital library [2] while the paper abstracts are indexed in the world leading citation database Scopus [3]. This article briefly describes the most interesting, to authors’ opinion, papers and poster presentations having innovative ideas in big data computing area.</abstract>
        </abstracts>
        <codes>
          <doi>10.5862/JCSTCS.212.10</doi>
          <udk>004=111</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Big Data</keyword>
            <keyword>database</keyword>
            <keyword>performance</keyword>
            <keyword>capacity</keyword>
            <keyword>cloud computing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2015.43.10/</furl>
          <file>10.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
