<?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>150</altNumber>
    <dateUni>2012</dateUni>
    <pages/>
    <articles>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>7-12</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Rogov</surname>
              <initials>Sergey</initials>
              <email>sarogov@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Sergeev</surname>
              <initials>Denis</initials>
              <email>enter_in_@rambler.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Skorohod</surname>
              <initials>Vladimir</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Increase signal-to-noise ratio in acousto-optic spectrum analyzer with use astigmatic optics</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Shows the calculation of signal to noise ratio in acoustooptic spectrum analyzer with use astigmatic optical system to match the size of optical and ultrasonic beams. Improved method for calculating noise in optical systems with two-dimensional signals that are not functions with separable variables. The possibility of optimizing scheme of the spectrum analyzer to increase signal to noise ratio.</abstract>
        </abstracts>
        <codes>
          <udk>535.241.13:534:621.391.83.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>acousto-optic spectrum analyzer</keyword>
            <keyword>astigmatic optical system</keyword>
            <keyword>increase signal-to-noise ratio</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.1/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>13-17</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Shashikhin</surname>
              <initials>Vladimir</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Bogach</surname>
              <initials>Nataliya</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Chuprov</surname>
              <initials>Viktor</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A calculation of cryptographic properties for an encryption algorithm using chaotic tent map</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Cryptographic properties calculation based on auto and cross correlation functions is proposed. The key space, number of rounds and symmetry parameter dependencies are analyzed. An algorithm to calculate the key clusters is given.</abstract>
        </abstracts>
        <codes>
          <udk>004.932./004.056.55</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>chaos-based cryptosystem</keyword>
            <keyword>dynamical chaos</keyword>
            <keyword>tent map</keyword>
            <keyword>key space dimension</keyword>
            <keyword>correlation property</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.2/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>17-23</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>Kharaldin</surname>
              <initials>Nikolay</initials>
              <email>kharaldin@rambler.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Planning and optimization of robot program motion by method of configuration space</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">An algorithm for the synthesis of robot motion in an environment of obstacles with the active participation of the operator is considered. The algorithm is based on the method of configuration space, which allows significantly expand the ability of visualization the process of synthesis. The basic steps of the synthesis solution and the current sample, confirming the effectiveness of the algorithms are presented.</abstract>
        </abstracts>
        <codes>
          <udk>681.51</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>robot</keyword>
            <keyword>environment with obstacles</keyword>
            <keyword>synthesis of motion program</keyword>
            <keyword>method of configuration space</keyword>
            <keyword>operator</keyword>
            <keyword>visualization</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.3/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>23-27</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Shashikhin</surname>
              <initials>Vladimir</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Bogach</surname>
              <initials>Nataliya</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Chuprov</surname>
              <initials>Sergey</initials>
              <email>sergey3007@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">An encryption algorithm using chaotic tent map security evaluation</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A general security evaluation guideline is given for cryptosystems using simple chaotic maps. We provide the experimental results to reveal the details for tent map cryptosystem features estimation (such as avalanche property and key dimension).</abstract>
        </abstracts>
        <codes>
          <udk>004.932./004.056.55</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>chaos-based cryptosystem</keyword>
            <keyword>dynamical chaos</keyword>
            <keyword>tent map</keyword>
            <keyword>avalanche property</keyword>
            <keyword>security evaluation</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.4/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>27-36</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Grigoriev</surname>
              <initials>Lev</initials>
              <email>griglev@gmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Kudryavtsev</surname>
              <initials>Dmitry</initials>
              <email>dmitry.ku@gmail.com</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Zablotsky</surname>
              <initials>Aleksey</initials>
              <email>alexey-zablotskiy@yandex.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The technology for ontology instance data authoring</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Ontologies and semantic web technologies are the leading means for knowledge-base development nowadays. The article suggests the classifiers and matrix language for ontology instance data authoring together with corresponding software. The language and tool allow users to visualize hierarchical relationships between ontology individuals, to distinguish instance types using icons and to represent links between elements from hierarchical list using matrix. The article also maps the suggested language to web ontology language (OWL), provides mechanism for knowledge-base editor interface design, lists implementation examples and makes evaluation of the suggested technology.</abstract>
        </abstracts>
        <codes>
          <udk>007:681.512.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>knowledge base</keyword>
            <keyword>ontology</keyword>
            <keyword>ontology population</keyword>
            <keyword>a-box</keyword>
            <keyword>knowledge representation</keyword>
            <keyword>knowledge structuring</keyword>
            <keyword>instance data</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.5/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>37-40</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Aksyonov</surname>
              <initials>Konstantin</initials>
              <email>Wiper99@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Kamelskiy</surname>
              <initials>Vladislav</initials>
              <email>kusnizza@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The analysis of business processes dynamic models for development of simulation service</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this work is considered the analysis of business processes dynamic models and development of simulation Internet service.</abstract>
        </abstracts>
        <codes>
          <udk>004.896</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>business process</keyword>
            <keyword>simulation</keyword>
            <keyword>internet service</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.6/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>41-46</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">
              <surname>Kostin</surname>
              <initials>Evgeniy</initials>
              <email>kostin_engenii@bk.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The method of optimal control of the smelting process of copper nickel-containing raw materials in furnaces Vanyukov</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this paper we propose an algorithm of optimal control of melting process of copper nickel raw material in furnaces Vanyukov based on the method of Bellman's dynamic programming. To construct a multi-step management process developed by the authors used neural network model of the melting furnaces Vanyukov. The criterion selected for optimality for a minimum loss of non-ferrous metals smelting process. To reduce the amount of calculations the authors propose to enter the grouping of states of the process by loss of non-ferrous metals at a fixed time.</abstract>
        </abstracts>
        <codes>
          <udk>681.5.017</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>optimal control</keyword>
            <keyword>dynamic programming</keyword>
            <keyword>Bellman</keyword>
            <keyword>neural network model</keyword>
            <keyword>the furnace Vanyukov</keyword>
            <keyword>the criterion for optimal control</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.7/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>47-52</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Nedovodeev</surname>
              <initials>Konstantin</initials>
              <email>parallelgeek@gmail.com</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A macro-flow graph generation technique, supporting automatic synthesis оf parallel programs for heterogeneous multicore processors</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A new technique for generation of coarse-grained dataflow graphs is proposed. The graphs mentioned represent parallel programs, processing large blocked numerical matrices on heterogeneous multicore processors with explicitly-managed memory hierarchies. The technique proposed allows removing of overheads related to dynamic trasks generation and data dependency tracking, which arise when existing approaches to software library construction are used.</abstract>
        </abstracts>
        <codes>
          <udk>004.4'242</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>software libraries</keyword>
            <keyword>macro-flow graphs</keyword>
            <keyword>heterogeneous multicore processors</keyword>
            <keyword>parallel programming</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.8/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>53-56</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">Multi objective selection based on t-sorting method</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Method making possible to build a procedure of reduction of Pareto multitude of multi objective task on the base of user's ordinal information is proposed. This method is more efficient then well known P-sorting method for a nonempty set of tasks.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.06(075.8)</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>multiobjective optimization</keyword>
            <keyword>Pareto multitude</keyword>
            <keyword>t-sorting method</keyword>
            <keyword>Podinovski method</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.9/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>56-59</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Belyavsky</surname>
              <initials>Grigoriy</initials>
              <email>beliavsky@hotmail.com</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Niconenko</surname>
              <initials>Nataliya</initials>
              <email>nnatd@rambler.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Computation algorithm of arbitrage free price of financial commitment based on up to state sampling of Levy processes</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The problem of computation of conditional expectation is solved. We use method which is called «Up to state sampling of Levy process» for the approximate solution.</abstract>
        </abstracts>
        <codes>
          <udk>519.2</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>conditional expectation</keyword>
            <keyword>Levy process</keyword>
            <keyword>the characteristic function</keyword>
            <keyword>up to state sampling of Levy process</keyword>
            <keyword>arbitrage free price of financial commitment</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.10/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>59-66</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Mazin</surname>
              <initials>Valery</initials>
              <email>masin@list.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">A presentation of physical quantity in the pseudo-Euclidean plane</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">A presentation of a physical quantity by a vector of the pseudo-Euclidean plane including on a level with the quantity value it degree of uncertainty is proposed. 4 new matters appearing by such presentation are discussed.</abstract>
        </abstracts>
        <codes>
          <udk>530.14</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>pseudo-euclidean plane</keyword>
            <keyword>uncertainty</keyword>
            <keyword>vector of the unit</keyword>
            <keyword>total vector</keyword>
            <keyword>pseudo-euclidean angle</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.11/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>66-72</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">Relaxation function of gradient methods</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">Set of relaxation functions (RF) for analysis of matrix gradient scheme of computer optimization is developed. Analytic dependence between RF and matrix factor of gradient scheme allows constructing of optimization method with determined relaxation properties corresponding to given RF. Generally speaking, this is a «generator» of new gradient-type methods.</abstract>
        </abstracts>
        <codes>
          <udk>681.3.06(075.8)</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>matrix gradient scheme</keyword>
            <keyword>relaxation functions</keyword>
            <keyword>relaxation ability conditions</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.12/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>72-79</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Burlov</surname>
              <initials>Vyacheslav</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Zenina</surname>
              <initials>Evgeniya</initials>
              <email>janezen@mail.ru</email>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Matveev</surname>
              <initials>Aleksandr</initials>
              <email>fcvega_10@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The synthesis of the model and the methods of functioning of the system in conflict situations</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In this article authors considered the method by solution of conflict with position of the principle of systematic. There was received the mathematical formalization of the synthesis of system which reach the target destination in the conditions of opposition.</abstract>
        </abstracts>
        <codes>
          <udk>510.67</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>conflict</keyword>
            <keyword>modelling</keyword>
            <keyword>synthesis of system</keyword>
            <keyword>efficiency</keyword>
            <keyword>principle of systematic</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.13/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>79-82</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Staypshin</surname>
              <initials>Аnatoliy</initials>
              <email>info@pr.surgu.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The ontologic campaign to modelling of the city infrastructure</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In article the ontologic approach to modelling of an infrastructure of municipal economy is presented. The work purpose were generalization and ordering of the data in the field of a city infrastructure, definition of base for construction of its ontology.</abstract>
        </abstracts>
        <codes>
          <udk>004.021:004.023</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>city</keyword>
            <keyword>infrastructure</keyword>
            <keyword>ontology</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.14/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>82-88</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Khodyrev</surname>
              <initials>Ivan</initials>
              <email>kivan-mih@yandex.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Popova</surname>
              <initials>Svetlana</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Searching for forks in process models</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In presented paper authors focus on the problem of searching forks in process models for the task of simulation using logs of information systems. The analysis of modern approach is given and the improvement of algorithms is proposed.</abstract>
        </abstracts>
        <codes>
          <udk>004.021</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>process mining</keyword>
            <keyword>log</keyword>
            <keyword>Petri nets</keyword>
            <keyword>decision points</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.15/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>89-92</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kvyatkovskaya</surname>
              <initials>Irina</initials>
              <email>i.kvyatkovskaya@astu.org</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Sibikina</surname>
              <initials>Irina</initials>
              <email>isibikina@bk.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">The entropic approach in the problem of systemic characteristic determination of competence model.</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The problem deals with the model of competence. Two systemic characteristic of the model are singled out in the research work: integrity of the competence and significance of this branch of science. An informational approach to calculating quantitative meanings of systemic characteristic of competence was suggested.</abstract>
        </abstracts>
        <codes>
          <udk>[681.511:536.75]:378.14</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>competence</keyword>
            <keyword>graphs’ model</keyword>
            <keyword>entropy</keyword>
            <keyword>degree of importance of disciplines</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.16/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>93-99</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Rybak</surname>
              <initials>Viktor</initials>
              <email>6774338@tut.by</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Analysis and optimization of the anthropogenic influence on the environment</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In article the methodology of quality management of the environment, consisting of techniques of an estimation of influence of anthropogenic influence on an environment of the urbanized territories, scientifically-methodical principles of creation and use of means of support of decision-making and a technique of calculation of ecological-economic efficiency of nature protection actions is described. Application of the offered methods allows to provide steady and ecologically safe wildlife management.</abstract>
        </abstracts>
        <codes>
          <udk>504.064:004.9</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>environment</keyword>
            <keyword>anthropogenous influence</keyword>
            <keyword>management</keyword>
            <keyword>genetic algorithms</keyword>
            <keyword>efficiency of nature protection actions</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.17/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>99-105</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Khanova</surname>
              <initials>Anna</initials>
              <email>akhanova@mail.ru</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Conceptual structure of business management on the basis of multiaspect modelling (on the example of cargo port)</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">The conceptual structure of business management on the basis of methods of the indicator analysis, a double contour of management on the basis of the multiaspect integrated models is described. Possibility of integration and convergence of ontologic, process, imitating, situational, cognitive models is shown. And their place in the scheme to development of management decisions in cargo port.</abstract>
        </abstracts>
        <codes>
          <udk>004.9:[656.625.078.89.004.12:658.012]</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>management structure</keyword>
            <keyword>management decision</keyword>
            <keyword>multiaspect modelling</keyword>
            <keyword>cargo port</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.18/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>106-110</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Kriger</surname>
              <initials>Liliya</initials>
              <email>kriger_l@mail.ru</email>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Kvyatkovskaya</surname>
              <initials>Irina</initials>
              <email>i.kvyatkovskaya@astu.org</email>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Formalization of standard situations in problems of traffic control of public transport</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In article consider the problem of traffic of public transport and increase its effectiveness. An approach of fuzzy situational control movement of public transport on the basis of fuzzy inclusion situations.</abstract>
        </abstracts>
        <codes>
          <udk>(004.83:519.816):656(1-21)</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>fuzzy case management</keyword>
            <keyword>fuzzy situation management</keyword>
            <keyword>fuzzy situation network</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.19/</furl>
          <file/>
        </files>
      </article>
      <article>
        <artType>RAR</artType>
        <langPubl>RUS</langPubl>
        <pages>110-114</pages>
        <authors>
          <author num="001">
            <individInfo lang="ENG">
              <surname>Golub</surname>
              <initials>Yulia</initials>
            </individInfo>
          </author>
          <author num="002">
            <individInfo lang="ENG">
              <surname>Novikov</surname>
              <initials>Alexander</initials>
            </individInfo>
          </author>
          <author num="003">
            <individInfo lang="ENG">
              <surname>Loginova</surname>
              <initials>Diana</initials>
            </individInfo>
          </author>
        </authors>
        <artTitles>
          <artTitle lang="ENG">Principles of formation of database for monitoring and evaluation process of science cluster development</artTitle>
        </artTitles>
        <abstracts>
          <abstract lang="ENG">In article main principles of working out of databases and property by managements of them are considered. The problems connected with formation of a database for monitoring and an estimation of processes high technology cluster of the development are considered.</abstract>
        </abstracts>
        <codes>
          <udk>004.413.4</udk>
        </codes>
        <keywords>
          <kwdGroup lang="ENG">
            <keyword>database</keyword>
            <keyword>indicators</keyword>
            <keyword>monitoring</keyword>
            <keyword>principle of construction</keyword>
          </kwdGroup>
        </keywords>
        <files>
          <furl>https://infocom.spbstu.ru/article/2012.27.20/</furl>
          <file/>
        </files>
      </article>
    </articles>
  </issue>
</journal>
