<?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>3</number>
    <altNumber>174</altNumber>
    <dateUni>2013</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-18</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Benderskaya</surname>
              <initials>Elena</initials>
              <email>helen.bend@gmail.com</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Tolstov</surname>
              <initials>Aleksandr</initials>
              <email>gm.alext@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Trends of hardware implementation of neural networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Hardware implementations of bio-inspired neural networks are under consideration. A comparative analysis of neuromorphic systems with other approaches is provided. The stages of chaotic neural network hardware implementation based on graphics processing units are proposed.</abstract>
        </abstracts>
        <codes>
          <udk>004.8.032.26, 681.513.8</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>neural network</keyword>
            <keyword>bio-inspired computing</keyword>
            <keyword>neuromorphic systems</keyword>
            <keyword>hardware implementation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.1/</furl>
          <file>01_benderskaya.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>19-25</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Sukhov</surname>
              <initials>Igor</initials>
              <email>sia23@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Akimov</surname>
              <initials>Valerij</initials>
              <email>valeri_akimov@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Resolution improvement of MUSIC algorithm for the direction-finder based on a circular antenna array</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Method of the MUSIC algorithm improvement resolution for the direction-finder is suggested. The method is based on forming number of subarrays from elements of the circular antenna array. It gives the possibility to improve the direction-finder resolution.</abstract>
        </abstracts>
        <codes>
          <udk>621.396.663</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>multiple signal classification</keyword>
            <keyword>circular antenna array</keyword>
            <keyword>direction-finding</keyword>
            <keyword>direction-finding algorithm</keyword>
            <keyword>beamforming</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.2/</furl>
          <file>02_sukhov.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>26-32</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Alekseev</surname>
              <initials>Mikhail</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>22735712200</scopusid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Sorotsky</surname>
              <initials>Vladimir</initials>
              <email>sorotsky@mail.spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Distortions reduction for switch-mode generated radio signals</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper gives an overview of promising switch-mode method for generation of radio signals with specified characteristics. Based on the mathematical model of radio signal an error assessment for the envelope and phase deviation is proposed. The method can be used in communication, navigation or broadcasting radio transmitters.</abstract>
        </abstracts>
        <codes>
          <udk>621.37</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>radio signal</keyword>
            <keyword>radio transmitter</keyword>
            <keyword>switch mode</keyword>
            <keyword>distortions</keyword>
            <keyword>model</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.3/</furl>
          <file>03_alekseev.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>33-43</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Volkova</surname>
              <initials>Violetta</initials>
              <email>violetta_volkova@list.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Chernenkaya</surname>
              <initials>Liudmila</initials>
              <email>Ludmila@qmd.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Mager</surname>
              <initials>Vladimir</initials>
              <email>mv@qmd.spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Classification of models in system analysis</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Brief analysis of existing approaches on models’ classification provided. The concept for classification of models is offered. Characteristics of orientations and methods of modelling, included in the proposed structure of classification, are submitted.</abstract>
        </abstracts>
        <codes>
          <udk>510.67</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>system</keyword>
            <keyword>model</keyword>
            <keyword>classification</keyword>
            <keyword>criteria of classification</keyword>
            <keyword>mathematical modelling</keyword>
            <keyword>classification according to methods of modelling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.4/</furl>
          <file>04_volkova.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>44-52</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Lantsev Yevgeniy A .</surname>
              <email>red_snow@list.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Dorrer</surname>
              <initials>Mikhail</initials>
              <email>mdorrer@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Creating agent-based model from the business process discrete-event model</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper the technique for translating model in eEPC notation into AnyLogic agent-based simulation model are proposed and developed. Performed an experiment of translating model in eEPC notation into Anylogic agent-based simulation model based on the developed algorithm. The results can be used by analysts to reduce simulation models designing and implementing time, and simplifying the exploitation process.</abstract>
        </abstracts>
        <codes>
          <udk>65.012.122</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>agent-based simulation</keyword>
            <keyword>eEPC</keyword>
            <keyword>ARIS</keyword>
            <keyword>AnyLogic</keyword>
            <keyword>business process</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.5/</furl>
          <file>05_lantsev.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>53-57</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Yastrebov</surname>
              <initials>Mikhail</initials>
              <email>mikyast@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The Fibonacci search — the substantiation, the number system and the hashing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article is aimed to prove the completeness of the Fibonacci search. The algorithm of the search allows representing the searched-for numbers as finite sequences (n-tuples) of a special type combined of the alphabet consisting of three symbols. The conversion of the tripartite record of a number into the admissible tuple results in the hashing procedure.</abstract>
        </abstracts>
        <codes>
          <udk>004.67, 519.688</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Fibonacci search</keyword>
            <keyword>completeness of the search</keyword>
            <keyword>representation of numbers</keyword>
            <keyword>ternary system</keyword>
            <keyword>hashing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.6/</furl>
          <file>06_yastrebov.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>58-66</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Shubnikov</surname>
              <initials>Vladislav</initials>
              <email>vlad.shubnikov@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Belyaev</surname>
              <initials>Sergey</initials>
              <email>sergey.belyaev@d-inter.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Image Difference Estimation and Noise Removing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">PSNR (Peak Signal to Noise Ratio) metric is typically used to estimate difference between two given images. Recent time more reliable metric (SSIM – Structural Similarity) was introduced to detect image changes/noise/etc. This article introduces more advanced approach for the image distance measurement, based on weighted sum of the image structure estimation and edges detection. Proposed metric (ESSIM – Edgeted Structural Similarity) is more close to the human image difference perception, and provide strong emphasize to pixels near edges. Paper illustrates two image modification cases, where PSNR and SSIM cannot find difference between images, but proposed metric can do it. Also this paper introduces a novel image noise removal approach, based on the weighted mixture of bilateral method and advanced edge detection approach.</abstract>
        </abstracts>
        <codes>
          <udk>004.932</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>image similarity</keyword>
            <keyword>image processing</keyword>
            <keyword>filtration</keyword>
            <keyword>edge detection</keyword>
            <keyword>noise removing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.7/</furl>
          <file>07_shubnikov.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>67-74</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Antonova</surname>
              <initials>Elena</initials>
              <email>ant_vladivostok@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Vasilev</surname>
              <initials>Ilya</initials>
              <email>vasyhin@list.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The problem of cargo operation management on container terminal railway</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article covers the research of existing problems with container terminal railway functioning. Technological processes are analyzed that are in progress when discharging and loading to railway transport using Vladivostok container terminal as an example. Author researches ability to automate technological process to get managing container terminal railway more optimized. The goal of research is development of automating methods for cargo processes management at container terminal. The article contains formal description of the tasks that should be solved to achieve the goal of developing the methods for automating cargo loading processes at container terminal railway.</abstract>
        </abstracts>
        <codes>
          <udk>004.825</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>container transportation</keyword>
            <keyword>railway processes</keyword>
            <keyword>container terminal management systems</keyword>
            <keyword>railway processes automating</keyword>
            <keyword>formal planning of technological process</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.8/</furl>
          <file>08_antonova.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>75-84</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kashirin</surname>
              <initials>Igor</initials>
              <email>igor_kashirin@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Medvedev</surname>
              <initials>Roman</initials>
              <email>roman_medvedev@inbox.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Ontological accumulation of educational knowledge based on the service information networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article discusses an ontological model of knowledge representation for their accumulation in distance learning systems. When collecting information used WSDL and OWL-S technology service descriptions in global information networks. The resulting technology has been effective in practical use as a subsystem of Internet-portal of general education.</abstract>
        </abstracts>
        <codes>
          <udk>007:681.512.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>ontological model</keyword>
            <keyword>Internet-service</keyword>
            <keyword>accumulation of knowledges</keyword>
            <keyword>distance learning</keyword>
            <keyword>description logics</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.9/</furl>
          <file>09_kashirin.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>85-92</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Ivanchenko</surname>
              <initials>Dmitry</initials>
              <email>DIvanchenko@ibs.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Khmelkov</surname>
              <initials>Igor</initials>
              <email>IKhmelkov@ibs.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Raychuk</surname>
              <initials>Dmitry</initials>
              <email>vicerector.sc@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Mitrofanov</surname>
              <initials>Aleksandr</initials>
              <email>mitrofanov@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Samochadin</surname>
              <initials>Aleksandr</initials>
              <email>Samochadin@soft-consult.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="006">
            <individInfo lang="ENG">
              <surname>Rogov</surname>
              <initials>Petr</initials>
              <email>petr.rogov@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The use of BYOD approaches for implementation of university IT-strategy</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article presents the current approaches to the use of mobile technologies and services in the higher education system, disclosed the contents of BYOD as a component of IT-strategy for the higher education institution, identified technological and organizational problems of implementing BYOD approaches to the educational process.</abstract>
        </abstracts>
        <codes>
          <udk>004.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>informatization of education</keyword>
            <keyword>mobile technologies</keyword>
            <keyword>BYOD</keyword>
            <keyword>mobile device manager</keyword>
            <keyword>MDM</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.10/</furl>
          <file>10_ivanchenko.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>94-98</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kirilenko</surname>
              <initials>Iakov</initials>
              <email>jake@math.spbu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Grigoriev</surname>
              <initials>Semen</initials>
              <email>rsdpisuy@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Avdiukhin</surname>
              <initials>Dmitry</initials>
              <email>dimonbv@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Syntax analyzers development in automated reengineering of informational system</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this article features of syntax analyzer development in automatic reengineering problems are considered. Requirements, laid on parser generators, are stated. Tool, satisfying these requirements, is described.</abstract>
        </abstracts>
        <codes>
          <udk>519.685.3</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>reengineering</keyword>
            <keyword>syntax analysis</keyword>
            <keyword>translation</keyword>
            <keyword>parser generators</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.11/</furl>
          <file>11_kirilenko.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>99-104</pages>
        <authors>
          <author num="001">
            <authorCodes>
              <scopusid>56049610600</scopusid>
              <orcid>0000-0003-1116-7765</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Drobintsev</surname>
              <initials>Pavel</initials>
              <email>drobintsev_pd@spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Nikiforov</surname>
              <initials>Igor</initials>
              <email>igor.nikiforov@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kotlyarov</surname>
              <initials>Vsevolod</initials>
              <email>vpk@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Formal models structurization based technique of complex software projects testing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper describes a technique of software testing based on structurization of formal model. In the scope of the technique approaches and criterions of structurization are described. An example of automated tests generation is shown. Suggested technique allows to resolve problems of formal model understanding and gives an opportunity of automated tests generation with usage of branch coverage criterion.</abstract>
        </abstracts>
        <codes>
          <udk>004.415</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>UCM</keyword>
            <keyword>structurization</keyword>
            <keyword>coverage</keyword>
            <keyword>test suite</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.12/</furl>
          <file>12.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>105-110</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kolosov</surname>
              <initials>Aleksandr</initials>
              <email>akolosov@cs.karelia.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Bogoyavlensky</surname>
              <initials>Yuriy</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A parallel algorithm for constructing a graph of a local Internet service provider’s ICT-infrastructure</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">An ICT-infrastructure (Network) graph is a necessary tool for solving of most network management problems. While the number of modern mobile devices in a Network grow up, permanent update of the Network graph is required to keep it actual and concistent. Therefore, it's required to develop more efficient and fast methods of building such graphs. In this paper we present parallel algorithm of Network graph discovery using routers' MIB data obtained with SNMP and its implementation. Described experiments confirm three-fold speed-up of the PetrSU Network graph building when using parallel algorithm.</abstract>
        </abstracts>
        <codes>
          <udk>004.722+004.415.23</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>network analysis</keyword>
            <keyword>object-oriented modelling</keyword>
            <keyword>network topology</keyword>
            <keyword>concurrency</keyword>
            <keyword>network management</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.13/</furl>
          <file>13_kolosov.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>111-117</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Nikiforov</surname>
              <initials>Igor</initials>
              <email>igor.nikiforov@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>56049610600</scopusid>
              <orcid>0000-0003-1116-7765</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Drobintsev</surname>
              <initials>Pavel</initials>
              <email>drobintsev_pd@spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kotlyarov</surname>
              <initials>Vsevolod</initials>
              <email>vpk@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Integrated criteria of software requirement checking</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper describes developing methods of tests for the requirements checking that provide 100 % coverage of the initial specifications for the system by test cases. Proposed approach of criterion chains are used in the traceability matrix. The criteria chains are used to automatic generation of test scenarios. Also the article describes methods for generating scenarios and selection of scenarios that satisfy the selected integral coverage criteria. The use of suggested integrated tests criteria for the requirements checking at the stage of a formal specification of the system, allows to cover by test scenarios all the initial requirements of the system.</abstract>
        </abstracts>
        <codes>
          <udk>004.415</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>design specification</keyword>
            <keyword>requirements</keyword>
            <keyword>traceability matrix</keyword>
            <keyword>guides</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.14/</furl>
          <file>14.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>118-122</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Tyutin</surname>
              <initials>Boris</initials>
              <email>b.tyutin@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Veselov</surname>
              <initials>Alexey</initials>
              <email>veselov.alexey@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kotlyarov</surname>
              <initials>Vsevolod</initials>
              <email>vpk@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Test suite execution scaling for automated testing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article reviews the test execution scaling problem and the approach for its solution implemented in TestCommander, an automated testing system. Results of the system piloting are analyzed and discussed.</abstract>
        </abstracts>
        <codes>
          <udk>004.4’22</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>testing automation</keyword>
            <keyword>unit-testing</keyword>
            <keyword>verification</keyword>
            <keyword>requirement management</keyword>
            <keyword>scaling</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.15/</furl>
          <file>15_tyutin.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>123-128</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Tutygin</surname>
              <initials>Vladimir</initials>
              <email>vs4141@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Pelkonen</surname>
              <initials>Ignatiy</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Kirilenko</surname>
              <initials>Kirill</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Method and software for precision measurement of time delay echo-signals of radars</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A new approach to the decision of a problem of delay definition noised radar echo-signals from an exciting radio impulse based on initial approach of delay received by means of autocorrelation procedure, and additional digital iterative approach of exact delay using nonconventional combination of normalized cross-correlation echo-signal with reference signals, spline-interpolation, oversampling are considered.</abstract>
        </abstracts>
        <codes>
          <udk>621.391:004.421</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>radar echo-signal</keyword>
            <keyword>reference signals</keyword>
            <keyword>cross-correlation</keyword>
            <keyword>spline-interpolation</keyword>
            <keyword>oversampling</keyword>
            <keyword>iterative algorithm</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.16/</furl>
          <file>16_tutygin.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>129-133</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Voinov</surname>
              <initials>Nikita</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Aleksandrova</surname>
              <initials>Olga</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Kotlyarova</surname>
              <initials>Lina</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Modernization of the methodic of WINDOWS PHONE 8 mobile applications development</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper describes the modernized methodic of an applications development for modern mobile devices working on new operating system of Microsoft Corporation – Windows Phone 8. The methodic teaches the main principles of applications development and usage of the most important platform’s capabilities.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.068</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>methodic</keyword>
            <keyword>mobile platform</keyword>
            <keyword>mobile device</keyword>
            <keyword>application</keyword>
            <keyword>development</keyword>
            <keyword>Microsoft Windows Phone</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.17/</furl>
          <file>17_voinov.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>134-138</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Zaslavskiy</surname>
              <initials>Mark</initials>
              <email>mark.zaslavskiy@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Krinkin</surname>
              <initials>Kirill</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Ryabikov</surname>
              <initials>Eduard</initials>
              <email>Edward.ryabikov@gmail.com</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Cherkalova</surname>
              <initials>Viktoria</initials>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <surname>Tsamutali</surname>
              <initials>Aleksey</initials>
              <email>indrik_rush@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Toolset for secure data storage</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Different approaches to data storage systems software work and debugging tools creation are presented in this work. Approaches to non-invasive profiling of Linux dynamic libraries. Also, the algorithm of cluster resources update which allows to update the cluster resources without cluster consistency disruption (i.e. forced nodes stop) is considered. Moreover, the methods for log-file view automation, allowing the optimization of test results analysis.</abstract>
        </abstracts>
        <codes>
          <udk>004.42</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>cluster</keyword>
            <keyword>resource update</keyword>
            <keyword>profiling</keyword>
            <keyword>shared libraries</keyword>
            <keyword>test log analysis</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.18/</furl>
          <file>18_zaslavskiy.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>139-142</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Zhigulin</surname>
              <initials>Andrei</initials>
              <email>dron.subzero@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Safonov</surname>
              <initials>Vladimir</initials>
              <email>vosafonov@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Video content projecting on complex surfaces using multiple output devices</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses the application, which plays content on complex surfaces without distorting it, as well as maintains the integrity of the content. The description of the application steps is presented, the development perspectives of this area are proposed.</abstract>
        </abstracts>
        <codes>
          <udk>621.319</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Bezier surfaces</keyword>
            <keyword>the reference alpha value integrity of the content</keyword>
            <keyword>DirectX</keyword>
            <keyword>DirectShow</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.19/</furl>
          <file>19_zhigulin.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>143-147</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Batyukov</surname>
              <initials>Alexander</initials>
              <email>batsun@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Ampilova</surname>
              <initials>Nataly</initials>
              <email>n.ampilova@spbu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A modified diffusion-limited aggregation modelling algorithm</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">For processes of diffusion-limited aggregation (DLA) a simulation method based on Brownian motion of particles on a plane lattice has been considered. The basic method to trace the walking of sequentially dropped particles has been realized. The optimized method using a priori estimation of particle selection coefficients has been designed and implemented. The results of numerical experiments are given.</abstract>
        </abstracts>
        <codes>
          <udk>004.942</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>diffusion-limited aggregation</keyword>
            <keyword>DLA</keyword>
            <keyword>fractal cluster</keyword>
            <keyword>Brownian motion</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.20/</furl>
          <file>T3_174_2013_20.PDF</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>148-153</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Nikiforov</surname>
              <initials>Igor</initials>
              <email>igor.nikiforov@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kotlyarov</surname>
              <initials>Vsevolod</initials>
              <email>vpk@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <scopusid>56049610600</scopusid>
              <orcid>0000-0003-1116-7765</orcid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St. Petersburg Polytechnic University</orgName>
              <surname>Drobintsev</surname>
              <initials>Pavel</initials>
              <email>drobintsev_pd@spbstu.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Restrictions on concurrent construction and time delays of UCM language</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper describes an approach to adjustment of semantics for UCM real time constructions in implementation of translator into Basic Protocols notation. The following constructions and their adjustment are described: multithreading and delays. The main problem of such constructions is that initial version of UCM standard allows to create semantically incorrect models. Proposed extensions and restrictions of UCM semantics allowed solving of these problems for different types of projects.</abstract>
        </abstracts>
        <codes>
          <udk>004.415</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>timers</keyword>
            <keyword>delays</keyword>
            <keyword>synchronization</keyword>
            <keyword>thread</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.33.21/</furl>
          <file>21.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
