<?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>4</number>
    <altNumber>176</altNumber>
    <dateUni>2013</dateUni>
    <pages>1-162</pages>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>9-17</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Ivankov</surname>
              <initials>Alexey</initials>
              <email>a.vnkv1@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Shishagin</surname>
              <initials>Alexei</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Stanford NLP parsers and semantic triplets identification</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">We developed some own classes for the object model of Stanford NLP parsers to implement our algorithm of semantic triplet identification. Results of information retrieving are discussed for en.Wikipedia articles.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.07</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information retrieving</keyword>
            <keyword>semantic analysis</keyword>
            <keyword>Stanford NLP parsers</keyword>
            <keyword>semantic triplet</keyword>
            <keyword>retrieving errors</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.1/</furl>
          <file>01.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>18-28</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Glushkov</surname>
              <initials>Peter</initials>
              <email>pglushkov@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Mikhailov</surname>
              <initials>Nikolai</initials>
              <email>nmikhailov@softnav.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Yudakin</surname>
              <initials>Dmitry</initials>
              <email>dyudakin@softnav.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Open-loop tracking of GNSS signals under condition of multipath propagation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A new method for GPS signal tracking is being proposed. The method differs from conventional delay-locked loops, frequency/phase-locked loops and is based on calculation of a narrow-band signal correlation function in time-frequency domain. The method allows to track both line-of-sight signal and reflected GNSS signals, which cause serious degradation of positioning accuracy in urban environments. The method is targeted at mobile user under severe multipath propagation conditions, when reflected signal power is comparable to the power of line-of-sight signal.</abstract>
        </abstracts>
        <codes>
          <udk>621.396.98:629.195</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>GNSS</keyword>
            <keyword>GPS</keyword>
            <keyword>multipath propagation</keyword>
            <keyword>signal tracking</keyword>
            <keyword>open-loop tracking</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.2/</furl>
          <file>02.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>29-40</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">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Nikitin</surname>
              <initials>Kirill</initials>
              <email>execiter@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Recurrent neural network as dynamical system and approaches to its training</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper presents the results of analytical study of recurrent neural networks (RNN) and their summary classification, done from the position of dynamical systems with regard to a new type of RNN – reservoir RNN. Knowledge systematization in the subject field allowed to distinguish main dynamical regimes of RNN and to describe the most perspective trends in the development of training algorithms in terms of the detected advantages and drawbacks of existing approaches.</abstract>
        </abstracts>
        <codes>
          <udk>004.8.032.26, 681.513.8</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>recurrent neural network</keyword>
            <keyword>dynamical system</keyword>
            <keyword>training algorithms</keyword>
            <keyword>reservoir computing</keyword>
            <keyword>unstable dynamics</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.3/</furl>
          <file>03.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>41-46</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">Super resolution techniques for direction-finder antenna array with directional elements</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Super resolution technique is applied to the circular antenna array of shunt dipoles. Direction-finding accuracy and resolution ability are estimated experimentally. Method of the MUSIC algorithm improvement for the direction-finder is suggested.</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.34.4/</furl>
          <file>04.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>47-54</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kedrin</surname>
              <initials>Victor</initials>
              <email>kedrinvs@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Kuzmin</surname>
              <initials>Oleg</initials>
              <email>quzminov@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Frequency analysis of time series periodic functions by means assessment of the number of ranks</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article describes the features of the method of analysis for singular time series formed additive periodic. Proposed a method research of dynamic properties of the system based on the evaluation of the numerical rank.</abstract>
        </abstracts>
        <codes>
          <udk>519.876.5 + 681.5.015.87</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>time series</keyword>
            <keyword>periodic functions</keyword>
            <keyword>singular value decomposition</keyword>
            <keyword>numerical rank</keyword>
            <keyword>frequency analysis</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.5/</furl>
          <file>05.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>55-64</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Pisarev</surname>
              <initials>Aleksandr</initials>
              <email>apissarev@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <orgName>Norilsk State Industrial Institute</orgName>
              <surname>Sulyaev</surname>
              <initials>Ilgiz</initials>
              <email>ilgizfinland@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Neural emulator temperature mode of copper-nickel raw materials smelting in Vanyukov furnace</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">One of Vanyukov furnace smelting problems is large losses of non-ferrous metals with slag, which lead to lower process. Melt temperature significantly influences effective separation of melting products and consequently their chemical composition. The purpose of work is to create temperature smelting model of copper-nickel raw materials in Vanyukov furnace based on artificial neural networks and statistic data use. The elaborated model will create automatic control system supporting optimal temperature mode in furnace.</abstract>
        </abstracts>
        <codes>
          <udk>681.513</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>Vanyukov furnace</keyword>
            <keyword>neural network emulator</keyword>
            <keyword>temperature mode</keyword>
            <keyword>copper-nickel raw materials</keyword>
            <keyword>matte</keyword>
            <keyword>forecast</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.6/</furl>
          <file>06.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>65-70</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Petrosyan</surname>
              <initials>Grigoriy</initials>
              <email>gregory.petrosyan@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Language support for systematic error handling</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Runtime errors are divided into expected and unexpected; requirements for language support for systematic error handling are proposed. Popular approaches to error handing — exceptions and return codes – are analyzed. Automatic treatment of unexpected errors by means of restoring program state invariants is proposed. Based on the conducted analysis, several mechanisms of language support for systematic error handling which satisfy stated requirements are proposed.</abstract>
        </abstracts>
        <codes>
          <udk>004.432</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>programming languages</keyword>
            <keyword>error handling</keyword>
            <keyword>exceptions</keyword>
            <keyword>return codes</keyword>
            <keyword>invariants</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.7/</furl>
          <file>07.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>71-78</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Potlov</surname>
              <initials>Anton</initials>
              <email>zerner@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Proskurin</surname>
              <initials>Sergey</initials>
              <email>spros@tamb.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Color Doppler mapping algorithm of biological liquids’ directed flows using optical coherence tomography</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A new algorithm of color Doppler mapping of one specific velocity of biological liquids with shuttle flows using optical coherence tomography is presented. The algorithm does not have the disadvantage 2π-ambiguity of color Doppler images. It is realized using the separation of the raw data to two parts corresponding to positive and negative shifts of the carrier frequency. As a final result, the complexation of independently reconstructed structural image and 2D color-coded one specific velocity image is performed. The practical implementation of the algorithm was performed in the LabVIEW package using the stream programming. A blood vessel hydrodynamic phantom was used for testing and debugging the final software product.</abstract>
        </abstracts>
        <codes>
          <udk>004.421</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>color Doppler mapping</keyword>
            <keyword>one specific velocity</keyword>
            <keyword>optical coherence tomography</keyword>
            <keyword>images’ complexation</keyword>
            <keyword>flow of biological fluid</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.8/</furl>
          <file>08.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>79-86</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Igor</surname>
              <initials>G.</initials>
              <email>igcher@spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Practical optimization and nonconvex problems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Main aspects of optimization problem in real computing are described. Requirement to take into account such parameters of applied extremal problem as rigidity and nonconvexity of criterion functional is founded. It is established that classic Newtonian and quasi-Newtonian optimization procedures are strongly influenced by inaccuracies in this case and nonconvergent procedures may appear.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.06</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>optimization procedure</keyword>
            <keyword>nonconvex optimization problem</keyword>
            <keyword>Newtonian procedure</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.9/</furl>
          <file>09.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>87-94</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Bortyakov</surname>
              <initials>Danil</initials>
            </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>Solodilova</surname>
              <initials>N.A.</initials>
              <email>solodna@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Quality assurance of computer-aided design for production metalware based on distributed database of operating defects</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Production object database of operating defects on various enterprises in the North-West region of Russia is analyzed. The most problematic metalware and chronic defects are figured out as well as methods to resolve them. Traditional mathematic models of metalware estimation are modified for the purpose of quality assurance to computer-aided design.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.016</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>database</keyword>
            <keyword>operating defect</keyword>
            <keyword>metalware</keyword>
            <keyword>computer-aided design</keyword>
            <keyword>quality assurance</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.10/</furl>
          <file>10.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>95-101</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Pilipko</surname>
              <initials>M.M.</initials>
              <email>m_m_pilipko@rambler.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Time-mode delta-sigma modulator for an analog-to-digital converter</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Principle of time-mode analog-to-digital conversion is considered. Circuits utilizing this principle are presented. A differential structure of the time-mode delta-sigma modulator is proposed. Operability of the presented circuits has been confirmed by transistor-level simulation.</abstract>
        </abstracts>
        <codes>
          <udk>621.376.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>voltage-to-time converter</keyword>
            <keyword>delta-sigma modulator</keyword>
            <keyword>digital circuits</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.11/</furl>
          <file>11.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>103-110</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Bostonov</surname>
              <initials>Oskar</initials>
              <email>bostonov@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Zverev</surname>
              <initials>Gennady</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Semiotic integration and control of business processes in petroleum  organization</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper provides analysis of the current state of the issue regarding integration of information systems. The issue of integration and efficiency of the control and management in business processes is proposed to be solved by constructing an adequate hierarchical model of the company and its subsidiaries in the form of a network operating productions, estimation of statistical parameters of information flows and tasks.</abstract>
        </abstracts>
        <codes>
          <udk>004.4''22</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>integration</keyword>
            <keyword>information systems</keyword>
            <keyword>semiotics</keyword>
            <keyword>consistency</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.12/</furl>
          <file>12.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>112-122</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Makoha</surname>
              <initials>Anatoliy</initials>
              <email>anmakoha@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Research of canonical trivectors of eighth grade by means of theory of the graphs and groups of substitutions</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In the article using the graph theory investigated all types of canonical trivectors eighth grade for their unambiguous representation. In the event of ambiguities found substitutions groups trivectors transform one into the other.</abstract>
        </abstracts>
        <codes>
          <udk>514.743.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>grade trivectors</keyword>
            <keyword>canonical form trivectors</keyword>
            <keyword>hyperplane</keyword>
            <keyword>cyclomatic number of a graph</keyword>
            <keyword>substitution groups</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.13/</furl>
          <file>13.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>123-130</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Mnukhin</surname>
              <initials>Valery</initials>
              <email>mnukhin.valeriy@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Integral transform for symmetry recognition of gray-level images</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A transform for symmetry recognition in 2D gray-level images is considered. The transform is invariant under rotations and translations, but is not scale-invariant. The rigorous mathematical description of its properties is provided and a series of tests for symmetry recognition is produced. Some details of the discrete case realization are given and illustrated with experiment results.</abstract>
        </abstracts>
        <codes>
          <udk>528.854</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>symmetry recognition</keyword>
            <keyword>gray-level images</keyword>
            <keyword>symmetry group</keyword>
            <keyword>frequency domain</keyword>
            <keyword>integral transform</keyword>
            <keyword>Fourier–Mellin transform</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.14/</furl>
          <file>14.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>131-141</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>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Approximate method for determining the number sign in residue number system and it’s technical sales</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper proposes an approximate method for determining the sign of the number in the residue number systems. This method is based on fast approximate calculation of the relative magnitude of the number to the range of the system. Technical implementation of the proposed method, which is easy to implement. It is shown that the application of the proposed method significantly reduces the time to perform basic operations in the problem of residue number systems.</abstract>
        </abstracts>
        <codes>
          <udk>621.391</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>residue number system</keyword>
            <keyword>modular arithmetic</keyword>
            <keyword>positional characteristics</keyword>
            <keyword>approximate method</keyword>
            <keyword>number sign</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.15/</furl>
          <file>15.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>142-149</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Dichenko</surname>
              <initials>Sergey</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Eliseev</surname>
              <initials>Nikolai</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Finko</surname>
              <initials>Oleg</initials>
              <email>ofinko@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Error function generator binary PRS control implemented on arithmetic polynomials</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A method of improving safety of the cryptographic protection of information (CPS), in particular the formation of binary nodes pseudorandom sequence (PRS), operating in a noise generated by an attacker. System of Boolean equations realize linear characteristic polynomial arithmetic, allowing parallelize the process of calculating the elements of the PRS. “Arithmetization” logical accounts, in turn, allowed the use of redundant modular device codes for error control operation of generating units and to provide bandwidth, thus the necessary security of their operation in the CPS.</abstract>
        </abstracts>
        <codes>
          <udk>519.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>binary pseudorandom sequence</keyword>
            <keyword>parallel logical calculations by polynomials arithmetic</keyword>
            <keyword>modular arithmetic</keyword>
            <keyword>the error control operation of the cryptographic protection of information</keyword>
            <keyword>generation of hardware errors</keyword>
            <keyword>cryptography</keyword>
            <keyword>cipher scheme</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.16/</furl>
          <file>16.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>150-155</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Malofey</surname>
              <initials>Oleg</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Shchelkunova</surname>
              <initials>Yulia</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Approach to the creation of a structural code to write and include the deployment of data in a storage device infotelecommunication systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper presents way for generating of a structural code, the basis for treating of the method for recording and reading of data in the storage, which can decrease the size of memory in one and a half time and, consequently, increase its indexes of reliability, dimension and capacity of the energy in few times. The synthesis code securely corrects modular errors and can be applied for the control of workability of the units of memory. Also we can see here fault-tolerant structures of the memory for 8-, 16and 32-positional formats of the data notation.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.07</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>error correction codes</keyword>
            <keyword>device input/output</keyword>
            <keyword>finite fields</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.17/</furl>
          <file>17.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>156-159</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Korneyev</surname>
              <initials>Petr</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Zhuravleva</surname>
              <initials>Irina</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Constructing best mean-square polynomials approximating a function and its derivatives</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper proposes a direct method for constructing a polynomial of degree m-best mean approximation that approximates both the function and its derivatives up to the m-th order. These polynomials are close to polynomials of best uniform approximations.</abstract>
        </abstracts>
        <codes>
          <udk>17.518.82</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>approximation</keyword>
            <keyword>best uniform polynomial approximation</keyword>
            <keyword>polynomial approximations of the RMS</keyword>
            <keyword>Chebyshev norm functions</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2013.34.18/</furl>
          <file>18.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
