<?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>12</volume>
    <number>2</number>
    <altNumber> </altNumber>
    <dateUni>2019</dateUni>
    <pages>1-83</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-15</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>St. Petersburg National Research University of Information Technologies, Mechanics and Optics</orgName>
              <surname>Lazarev</surname>
              <initials>Victor</initials>
              <email>holod25@yandex.ru</email>
              <address>St. Petersburg, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Informational scaling of variations in the distribution laws of parameters. Applications to the tasks of monitoring and management</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper studies the effect of changes in the distribution law on the parameter uncertainty state based on informational estimates. The proposed methodology for creating information scales for the rapid assessment of changes in these states. To illustrate the proposed approach, we consider an example of an information scale based on the basis of five model distribution laws that are widely used in various fields. As a result of using the proposed solutions, it is possible to obtain estimates of the transformation of the laws of distributions based on the amount of information generated in this case. The results obtained are illustrative, and the proposed methods and technologies are fairly «simple» and convenient for practical use. The implementation of the approach was carried out on the basis of the methods and developments of the theory of entropy potentials; it has prospects of application for the organization of monitoring and control.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12201</doi>
          <udk>53.08</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>laws of distribution</keyword>
            <keyword>states of uncertainty</keyword>
            <keyword>entropy potentials</keyword>
            <keyword>information scaling</keyword>
            <keyword>monitoring</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.1/</furl>
          <file>7-15.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>16-27</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Ermolova</surname>
              <initials>Tatiana</initials>
              <email>togatsbp@gmail.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Ivaschenko</surname>
              <initials>Polina</initials>
              <email>deadpolonium@yandex.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Laptev</surname>
              <initials>Vladimir</initials>
              <email>laptevsee@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Studying the efficiency of visualization of static data structures by means of bar and pie charts by eye-tracking method</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The understanding of the mechanisms used for decoding information ensures efficient and correct interpretation of the information if it is taken into consideration during the design process. The article describes the most popular approaches to the visual presentation of static data structures with the help of graphic images (pie charts, donut charts, vertical and horizontal bar charts), an overview different eye-tracking studies of the effectiveness of visualization is given. Based on the statistical analysis, including cluster analysis of the coordinates of the fixation points of the subjects' eyes, a confirmation of the hypothesis of the existence of various patterns and approaches to the perception of diagrams was obtained. The drawbacks of visualization of information using pie charts were discovered. Certain recommendations for the visualization of static data structures were formulated.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12202</doi>
          <udk>004.932.2:003.63</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>infographics</keyword>
            <keyword>data visualization</keyword>
            <keyword>pie charts</keyword>
            <keyword>donut charts</keyword>
            <keyword>bar charts</keyword>
            <keyword>eye-tracking</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.2/</furl>
          <file>16-27.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>28-38</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Bauman Moscow State Technical University</orgName>
              <surname>Yadgarova</surname>
              <initials>Yulia</initials>
              <email>y.v.yadgarova@gmail.com</email>
              <address>Moscow, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>National Research University Higher School of Economics</orgName>
              <surname>Taratoukhine</surname>
              <initials>Viktor</initials>
              <email>victor.taratoukhine@sap.com</email>
              <address>Moscow, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">General approach for selection software architecture pattern based on system quality attributes</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper presents the approach of selection general architecture pattern and design tactics for the software project. Proposed method is based on the satisfying required software quality attributes. The domain ontology is defined along with the main concepts and structure. Base software architectural patterns and main design tactics were analyzed and as a result the problem of building software architecture with required quality attributes has stated. As a solution, analytical model of selecting necessary tactics has presented. The general approach to select the best software architecture pattern and tactics is defined and described with the example of preventive maintenance systems.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12203</doi>
          <udk>004.05</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>software architecture</keyword>
            <keyword>software quality</keyword>
            <keyword>software architecture design</keyword>
            <keyword>software systems quality attributes</keyword>
            <keyword>design tactics</keyword>
            <keyword>software architectural patterns</keyword>
            <keyword>ontology of the software architecture design</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.3/</furl>
          <file>28-38.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>39-49</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Kostenko</surname>
              <email>zaba-1@bk.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Onufriev</surname>
              <initials>Vadim</initials>
              <email>ovavadim@gmail.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="003">
            <authorCodes>
              <researcherid>AAH-8784-2019</researcherid>
              <scopusid>35303230700</scopusid>
            </authorCodes>
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Vyacheslav</surname>
              <initials>P.</initials>
              <email>shkodyrev@imop.spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Multicriterial optimisation of rectificational process based on SPEA2 algorithm</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This article describes the process of multicriterial optimization using the Pareto efficiency method. A large-scale industrial plant was taken as a controllable object. The object was decomposed and represented as a hierarchy of embedded orgraphs. The orgraph’s vertices mark the current state of the product while the edges stand for technological operations. Based on the object’s technical documentation, a list of influencing factors is created. The list contains every technological parameter affecting the quality of the final product. A neural network trained on a set of statistical data is utilized to identify dependencies between discrete influencing factors and the product quality. These dependencies are then processed with the SPEA2 algorithm, outputting a set of combinations of optimized parameters values known as the Pareto front.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12204</doi>
          <udk>004.942</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Pareto efficiency</keyword>
            <keyword>multicriterial optimisation</keyword>
            <keyword>identification</keyword>
            <keyword>SPEA2</keyword>
            <keyword>neural network</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.4/</furl>
          <file>39-49.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>50-67</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">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Purii</surname>
              <initials>Alexandr</initials>
              <email>purii.alexander@gmail.com</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russian Federation</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Study decomposing and executing algorithms of data extraction queries in heterogeneous relationship database management systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">When working with independent databases, the problem of partial automation arises, which consists in the impossibility of obtaining data from independent databases with a previously unknown scheme. The problem consists of two aspects: the lack of semantic connection between independent databases, and the dynamics of the semantics of schemes. The goal is the development and study of algorithms for constructing integrated queries for data sampling to heterogeneous distributed database management systems. To test the functionality of the algorithms, software and database of databases, which provides the ability to access independent databases, as if they were a single DBMS, but without full replication of the merging databases.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12205</doi>
          <udk>004.652.42, 004.657, 004.655.3:004.652.4</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>heterogeneous DBMS</keyword>
            <keyword>metadata</keyword>
            <keyword>distributed queries</keyword>
            <keyword>queries decomposition</keyword>
            <keyword>distributed DBMS</keyword>
            <keyword>databases integration</keyword>
            <keyword>queries processing</keyword>
            <keyword>DBMS</keyword>
            <keyword>databases</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.5/</furl>
          <file>50-67.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>68-79</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">Distance finding method between a point and a segment in navigation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The authors proposed an efficient method for determining the distance between an interval and a point on the surface of a spheroid to address some ensuing control problems. The authors described detection of multi extremal situations in the proposed problem and the causes of its occurrence. The authors suggested the algorithm of its solution under such conditions. In the case of multiextremality, the algorithm divides the interval into parts that are analyzed separately. In general case of unimodal intervals the algorithm uses special gnomonic projections with squared degree of convergence. The limits of applicability of the projection method are determined, and the optimal choice of the center of the gnomonic projection is justified. If the method is not applicable the universal minimization method provides the required solution. The method demonstrates high accuracy of the solution and the authors recommend it for use in commercial navigation and geodetic software products. The technique extends to control problems associated with different applications of navigation.</abstract>
        </abstracts>
        <codes>
          <doi>10.18721/JCSTCS.12206</doi>
          <udk>519.6:527</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>modeling methods</keyword>
            <keyword>geodesic problems</keyword>
            <keyword>loxodrome</keyword>
            <keyword>orthodrome</keyword>
            <keyword>multi-extremal optimization problems</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2019.61.6/</furl>
          <file>68-79.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
