<?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>6</number>
    <altNumber>210</altNumber>
    <dateUni>2014</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-15</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Raychuk</surname>
              <initials>Dmitry</initials>
              <email>vicerector.sc@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <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="003">
            <individInfo lang="ENG">
              <surname>Nosnitsyn</surname>
              <initials>Semen</initials>
              <email>semen.nosnitsyn@gmail.com</email>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Khmelkov</surname>
              <initials>Igor</initials>
              <email>IKhmelkov@ibs.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A Set of Mobile Applications to Support the Education Process</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper describes a set of mobile applications that support the education process. The set includes applications for attendance monitoring, academic performance monitoring, schedule management, classroom interaction, final grading, education materials access and individual homework management. All these applications rely on the mobile device management (MDM) system. The MDM system provides a common authentication service and mobile software distribution. Applications use and modify the data from relevant corporate information systems. As each university has its own set of custom information systems, the MDM system also provides the common interface to these services. A set of applications is connected to the information system via an adapter program.</abstract>
        </abstracts>
        <codes>
          <udk>004.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>mobile device management</keyword>
            <keyword>mobile services</keyword>
            <keyword>education process</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.1/</furl>
          <file>1.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>16-23</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Ermakov</surname>
              <initials>Alexey</initials>
              <email>a.ermakov@sut.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Improving the Efficiency of the University Through the Creation of an Informationtelecommunication System</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The article discusses the aspects of improving the efficiency of the university using the functionality of a specially designed information and telecommunication system. A methodological approach to the evaluation of its effectiveness is proposed that takes into account the qualitative changes in the triad including the learning process, research, and administration. For each element of the triad efficiency is determined with the help of expert estimations. The resulting estimation of the efficiency is calculated as the arithmetic mean or as a module of a three-dimensional vector.</abstract>
        </abstracts>
        <codes>
          <udk>338.46:378</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>information and telecommunication system</keyword>
            <keyword>digital university</keyword>
            <keyword>efficiency</keyword>
            <keyword>learning process</keyword>
            <keyword>scientific research</keyword>
            <keyword>administration</keyword>
            <keyword>expert estimations</keyword>
            <keyword>scalar quantity</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.2/</furl>
          <file>2.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>24-32</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Raychuk</surname>
              <initials>Dmitry</initials>
              <email>vicerector.sc@spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <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="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Timofeev</surname>
              <initials>Dmitry</initials>
              <email>dtim@dcn.icc.spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Lukin</surname>
              <initials>Andrey</initials>
              <email>andrey.a.lukin@gmail.com</email>
            </individInfo>
          </author>
          <author num="005">
            <individInfo lang="ENG">
              <surname>Khmelkov</surname>
              <initials>Igor</initials>
              <email>IKhmelkov@ibs.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">An Approach to Automated Attendance Checking of Events Participants</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Attendance checking is a time-consuming, yet important activity in many kinds of events. Most approaches to attendance checking automation require specialized equipment to be installed. A more appealing approach is to use mobile devices such as smartphones that are ubiquitous nowadays. We propose a context-aware attendance checking service based on a mobile device management (MDM) system. This approach may be used during a wide spectrum of events, and requires a limited set of equipment that is commonly available when a conference or a lecture takes place. The service can identify an attendee’s mobile device using QR-codes, Bluetooth, or Wi-Fi. User authentication is provided by the underlying MDM system.</abstract>
        </abstracts>
        <codes>
          <udk>004.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>attendance checking</keyword>
            <keyword>mobile devices</keyword>
            <keyword>mobile devices management</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.3/</furl>
          <file>3.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>33-42</pages>
        <authors>
          <author num="001">
            <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="002">
            <individInfo lang="ENG">
              <surname>Suzhaev</surname>
              <initials>Oleg</initials>
              <email>oleg.suzhaev@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Timofeev</surname>
              <initials>Dmitry</initials>
              <email>dtim@dcn.icc.spbstu.ru</email>
              <address>Polytechnicheskaya, 29, St.Petersburg, 195251, Russia</address>
            </individInfo>
          </author>
          <author num="004">
            <individInfo lang="ENG">
              <surname>Rogov</surname>
              <initials>Petr</initials>
              <email>petr.rogov@spbstu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Tools for Load Testing Mobile Device Management Systems</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">This paper deals with the problem of load testing mobile device management (MDM) systems. MDM systems should cope with peak loads generated by hundreds and thousands of mobile devices at a time. It is too hard and expensive to test the capabilities of an MDM system with so many real devices operating simultaneously. A much more convenient approach is to use load testing software that emulates numerous mobile devices. We state a set of requirements for the software designed for load testing MDM server, and propose the architecture of a load testing tool. This architecture allows emulating the main mobile platforms (Android, iOS, Windows Phone) and can be modified to support new platforms or operating system versions.</abstract>
        </abstracts>
        <codes>
          <udk>004.7</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>load testing</keyword>
            <keyword>architecture</keyword>
            <keyword>mobile device management</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.4/</furl>
          <file>4.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>43-48</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Khurshudov</surname>
              <initials>Artem</initials>
              <email>art1783@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Markov</surname>
              <initials>Vitaliy</initials>
              <email>vinitar@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Unsupervised Learning of Hierarchical 2D Features for Image Classification</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">One of the key problems of image classification and pattern recognition domains is that of feature detection. The desired features are expected to be robust and invariant to a number of spatial transformations, compact enough to evade the «curse of dimensionality» which is a frequent obstacle when dealing with large natural images, and provide a characteristic relation to a classification category with high probability. There exists a number of approaches developed to reach the stated goals, including a variety of deep learning models, such as Restricted Boltzman Machines, convolutional networks, autoencoders, PCA, Deep Belief Networks, etc. However, most applications of the above-mentioned algorithms are often concentrated on obtaining the most accurate features for a chosen dataset rather than trying to extract the inner structure of the data. This paper suggest a slightly different approach, namely a method for building a hierarchy of meaningful features with each level composed of the features from a previous layer. Such model has multiple applications — it can serve as a composite feature detector in an unsupervised pre-training step of learning, or be itself a metric that answers the question of whether the same spatial structure is present across the dataset. The proposed approach exploits the idea of local connectivity supposing that multiple adjacent image parts which contain some meaningful features might present another, more high-level feature when composed together. We also discuss the advantages of a hierarchical feature model, such as the ability to guess a high-level feature presence by discovering a collection of low-level features concentrated in the same area, or its stability against noise and distortion which happens due to the fact that each feature level accepts a certain degree of deviation accumulating those to the top of the hierarchy. The resulting model operates on 2D images, but can be easily extended in order to extract 3D features from a continuous data input, such as a movie, which promises to be a good way to deal with 3D transformations, which can drastically change the appearance of an object while preserving its identity.</abstract>
        </abstracts>
        <codes>
          <udk>004.93'12</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>hierarchical model</keyword>
            <keyword>deep learning</keyword>
            <keyword>unsupervised feature learning</keyword>
            <keyword>feature detection</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.5/</furl>
          <file>5.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>49-58</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Peter the Great St.Petersburg Polytechnic University</orgName>
              <surname>Burdakov</surname>
              <initials>Sergey</initials>
              <email>control2@compmech.spbstu.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Sizov</surname>
              <initials>Pavel</initials>
              <email>p.a.sizov@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The Mobile Robot Motion Control Algorithms for the Pursuit Problem</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The paper suggests the mobile wheeled robot motion control algorithms for the pursuit problem which allow implementing control when the information about the pursued robot motion is incomplete. Kinematic equations with state variables are used as the control target. Linear and angular velocities are considered as the pursuing robot controls. Linear and angular velocities are perturbations of uncertain nature for the pursued robot. Algorithms with feedback are based on the method of compensation and classical approach to control systems astatism. Lyapunov’s methods are used in the stability analysis for the closed loop system, as well as to adjust the control algorithms. The theoretical results are confirmed by computer simulation. The trajectories and plots of the processes in the closed loop system are presented for the case of the random maneuvers of the pursued robot. There are shown the reversionary trajectories of the pursued robot in case the pursuing robot does not reach the target.</abstract>
        </abstracts>
        <codes>
          <udk>681.5</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>mobile robot</keyword>
            <keyword>pursuit problem</keyword>
            <keyword>Lyapunov’s method</keyword>
            <keyword>control algorithms</keyword>
            <keyword>incomplete information</keyword>
            <keyword>robustness</keyword>
            <keyword>simulation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.6/</furl>
          <file>6.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>59-66</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Rostov</surname>
              <initials>Nikolay</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Synthesis and Multiobjective Optimization of Nonlinear Quasi Time–Optimal Digital Controllers</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper some formulations of synthesis and multiobjective parameter optimization problems of digital servo systems with quasi time-optimal controllers are discussed and computer-aided techniques based on searching the Pareto-solutions are proposed. A practical example is given to demonstrate the multiobjective parameter tuning of nonlinear digital controller for servo system with linear plant.</abstract>
        </abstracts>
        <codes>
          <udk>681.3 (075.8)</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>robot motion control systems</keyword>
            <keyword>inverse kinematic problems</keyword>
            <keyword>iterative methods</keyword>
            <keyword>algorithm convergence</keyword>
            <keyword>regularization</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.7/</furl>
          <file>7.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>67-80</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Martsenyuk</surname>
              <initials>Mikhail</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Seletkov</surname>
              <initials>Il`ya</initials>
              <email>iseletkov@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Convesion of Fuzzy Finite Automata to Fuzzy Combinational Circuit</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper finite logical automata and combinational circuit models using fuzzy logic are considered. It is shown that fuzzy finite automata and fuzzy combinational circuit simplify the programming of material area and are more flexible than their traditional non-fuzzy analogs. The comparison of automata and circuit implemented with the help of a specific example demonstrates that a fuzzy circuit generates the same output much faster than fuzzy automata.</abstract>
        </abstracts>
        <codes>
          <udk>62.50 + 517.11 + 519.92</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>fuzzy logic</keyword>
            <keyword>fuzzy automata</keyword>
            <keyword>fuzzy combinational circuit</keyword>
            <keyword>Mamdani’s alghoritm</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.8/</furl>
          <file>8.pdf</file>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>81-94</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <orgName>Solomenko Institute of Transport Problems  of the Russian Academy of Sciences, University National Technology Initiative 2035</orgName>
              <surname>Seliverstov</surname>
              <initials>Yaroslav</initials>
              <email>maxwell_8-8@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Starichenkov</surname>
              <initials>Aleksey</initials>
              <email>allstar72@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Construction of an Urban Trafic Control Model Under the Conditions of Information Uncertainty</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A formal model of the urban transport system is made with the logic-algebraic interpretation, it bound to the graph-analytical model of the urban transport network, after it a model of functionally complete operator basis of control of the urban transport system based on function of control of movement of the urban population is introduced here. Function of control of traffic consists of two principles Wardrop and two new principles, which are described here. The model for controlling the dynamic traffic of the metropolis is consistently built here. The adequacy of the models is demonstrated by numerical examples.</abstract>
        </abstracts>
        <codes>
          <udk>656, 004.8, 007.5, 51-7, 510.67</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>MODEL CONTROL SYSTEMS OF DYNAMIC TRAFFIC</keyword>
            <keyword>INTELLIGENT TRANSPORTATION SYSTEMS</keyword>
            <keyword>TRAFFIC CONTROL</keyword>
            <keyword>CONTROL OF URBAN MOBILITY</keyword>
            <keyword>URBAN TRANSPORT SYSTEMS</keyword>
            <keyword>SELF-ORGANIZING MODEL TRANSPORT FLOWS</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2014.42.9/</furl>
          <file>9.pdf</file>
        </files>
      </article>
    </articles>
  </issue>
</journal>
