<?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>198</altNumber>
    <dateUni>2014</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-18</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kotenko</surname>
              <initials>Igor</initials>
              <email>ivkote@comsec.spb.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Saenko</surname>
              <initials>Igor</initials>
              <email>ibsaen@comsec.spb.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences</orgName>
              <surname>Yusupov</surname>
              <initials>Rafael</initials>
              <email>spiiran@iias.spb.su</email>
              <address>14-th Linia, VI, No. 39, St. Petersburg, 199178, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">New generation of security information and event management systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The given paper justifies the technological necessity to develop a new generation of security monitoring and event management systems based on security information and event management technology. We have focused on the typical architecture and key solutions to design the individual modules of such systems collecting constant security data, their universal translation, scalable processing, hybrid ontological storage and rich visualization, as well as a cross-level correlation of events, attack modelling and predictive security analysis. We have also stated some proposals to use such systems in the domains related to security protection in critical infrastructures.</abstract>
        </abstracts>
        <codes>
          <udk>004.056.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>security monitoring and management</keyword>
            <keyword>computer network</keyword>
            <keyword>security event</keyword>
            <keyword>information infrastructure</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.1/</furl>
          <file>01.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>19-27</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Borodin</surname>
              <initials>Anton</initials>
              <email>AntonioBorodin@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research of computer systems load capability</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Load testing is one of the main tools used to measure parameters and determine computer system behavior under operating conditions. Constant development and extension of computer systems lead to the load increase to maintain normal condition. As the resources of a single computer are not enough to create that amount of load, there are different methods to reach that amount of load using distributed computing. This article presents the experiment results to determine load capability limits for a single computer system and factors affecting them.</abstract>
        </abstracts>
        <codes>
          <udk>004.054</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>load testing</keyword>
            <keyword>load capability</keyword>
            <keyword>processing time of a packet by operating system</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.2/</furl>
          <file>02.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>28-36</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Cherny</surname>
              <initials>Sergey</initials>
              <email>sergiiblack@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Zhilenkov</surname>
              <initials>Anton</initials>
              <email>zhilenkovanton@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Identification of external parameters for the expert subsystems in the composition of the shipboard of electric power systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">One of the most important tasks for the filter-compensation devices is an accurate determination of changing harmonic components of a non-sinusoidal signal. It helps the power component of the filter compensate the appropriate harmonics. The form of the network currents and voltages in the autonomous electric energetic systems operating with powerful semiconductor load are rather distorted and generator sets generate voltage with non-constant frequency, phase and amplitude. Thus, the calculation of the harmonic composition of the distorted signals proves to be a sophisticated problem.</abstract>
        </abstracts>
        <codes>
          <udk>620.9+004.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>power load</keyword>
            <keyword>intelligent systems</keyword>
            <keyword>identification</keyword>
            <keyword>optimal control</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.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>Demidova</surname>
              <initials>Liliya</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Nesterov</surname>
              <initials>Nikolay</initials>
              <email>nikolaynesterov@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Tishkin</surname>
              <initials>Roman</initials>
              <email>roman.tishkin@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Possibilistic-fuzzy segmentation of earth surface images by means of genetic algorithms and artificial neural networks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">We have focused on the problem of image segmentation of earth surface using intelligent information technologies. The application expediency of genetic algorithms to receive suboptimum results of the image segmentation on the basis of clustering algorithms under uncertainty has been shown. We have offered to use artificial neural networks to specify segmentation results received on the base of clustering algorithms under uncertainty.</abstract>
        </abstracts>
        <codes>
          <udk>004.932.2:519.254</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>earth remote sensing</keyword>
            <keyword>hyper spectral shooting</keyword>
            <keyword>segmentation</keyword>
            <keyword>clustering</keyword>
            <keyword>fuzzy C-means algorithm</keyword>
            <keyword>genetic algorithm</keyword>
            <keyword>artificial neural network</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.4/</furl>
          <file>04.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>49-58</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Botnev</surname>
              <initials>Victor</initials>
            </individInfo>
          </author>
          <author num="002">
            <authorCodes>
              <scopusid>6603839750</scopusid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Sergey M. Ustinov</surname>
              <email>usm50@yandex.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Methods for direct and inverse geodesic problems solving with high precision</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Proposed algorithms for navigational calculations provide an extremely low error over the entire range of input parameters and allow avoiding the loss of accuracy typical for these tasks. These methods demonstrate an acceptable performance for practical applications and we can recommend using them in commercial navigational software products meeting international navigational standards.</abstract>
        </abstracts>
        <codes>
          <udk>519.6:527</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>modelling methods</keyword>
            <keyword>loss of accuracy</keyword>
            <keyword>machine epsilon</keyword>
            <keyword>asymptotic expansions</keyword>
            <keyword>geodesic problems</keyword>
            <keyword>loxodrome</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.5/</furl>
          <file>05.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>59-64</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Chetverikov</surname>
              <initials>Sergey</initials>
              <email>tschetserg@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Using the information and measurement system to study statistical characteristics and daily and seasonal variation in the intensity of VLF atmospheric radio noise</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper discusses physical conditions of the origin of VLF Atmospheric Radio Noise, summarizes its statistical characteristics and daily and seasonal variation in its intensity. It also examines general regularities in the diurnal variation of the envelope of Atmospheric Radio Noise field strength and describe the information and measurement system operates.</abstract>
        </abstracts>
        <codes>
          <udk>550.388.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>lightning discharges</keyword>
            <keyword>atmospheric radio noise</keyword>
            <keyword>statistical characteristics</keyword>
            <keyword>daily and seasonal variation</keyword>
            <keyword>generalized empirical model</keyword>
            <keyword>atmospheric</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.6/</furl>
          <file>06.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>65-76</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Chervyakov</surname>
              <initials>Nikolay</initials>
              <email>k-fmf-primath@stavsu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Babenko</surname>
              <initials>Michael</initials>
              <email>whbear@yandex.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Lyakhov</surname>
              <initials>Pavel</initials>
              <email>ljahov@mail.ru</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Lavrinenko</surname>
              <initials>Irina</initials>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <surname>Lyagin</surname>
              <initials>Aleksey</initials>
              <email>kfmf-primath@stavsu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Multiplication and division in the residue number system using Galois fields GF(p)</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The current paper presents an algorithm of multiplication and division in the residual classes based on the theory of Galois fields GF(p). The use of Galois fields GF(p) to solve the problems of arithmetic multiplication and division eliminates a lot of limitations of existing algorithms. The advantage of the proposed algorithm is that it has no restrictions on the dividend and the divisor and it does not use the generalized positional notation and the expansion of the residue number systems.</abstract>
        </abstracts>
        <codes>
          <udk>621.391</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>computer arithmetic</keyword>
            <keyword>residue number system</keyword>
            <keyword>modular arithmetic</keyword>
            <keyword>Galois field</keyword>
            <keyword>number theory</keyword>
            <keyword>parallel computing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.7/</furl>
          <file>07.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>78-84</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">Sequence diagrams application for keyword-driven testing</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The given paper focuses on the application of sequence diagrams in Message Sequence Chart format for keyword-driven testing. We have studied a keyword-driven approach and presented main advantages of sequence diagrams. The paper comes up with a brief description how to implement testing automation framework based on presented techniques.</abstract>
        </abstracts>
        <codes>
          <udk>004.054</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>testing automation</keyword>
            <keyword>keyword-driven testing</keyword>
            <keyword>formal specification</keyword>
            <keyword>Message Sequence Charts</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.8/</furl>
          <file>08.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>85-91</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">
              <surname>Voinov</surname>
              <initials>Nikita</initials>
            </individInfo>
          </author>
          <author num="004">
            <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">Approach to concurrent systems testing based on UCM specification</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The current paper presents an approach to testing of concurrent program systems based on UCM specifications usage. We have studied UCM constructions specifying multithreading system behavior. We have also described equivalent constructions using the language of basic protocols that is operated by test scenario generator. The approach to automated creation of test scenarios in MSC notation for multithreading systems has been shown. The described approach based on the analysis of concurrent threads allows us to obtain automatically verified test suites for testing concurrent distributed systems.</abstract>
        </abstracts>
        <codes>
          <udk>004.415</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>formal model</keyword>
            <keyword>thread synchronization</keyword>
            <keyword>parallel computing</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.9/</furl>
          <file>09.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>92-98</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Osennya</surname>
              <initials>Daria</initials>
              <email>osen1313@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Zakirova</surname>
              <initials>Irina</initials>
              <email>from.mumla@gmail.com</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">Developing software for data center configuration</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper describes an approach to the development of software products aimed at automating configuration of data centers. Also, the paper presents methods to select configurations for information centers and an approach to analyse their properties.</abstract>
        </abstracts>
        <codes>
          <udk>004.65</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>data center</keyword>
            <keyword>EMC</keyword>
            <keyword>ECLIPSE</keyword>
            <keyword>EMF</keyword>
            <keyword>GMF</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.39.10/</furl>
          <file>10.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
