<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection: 2008 г.</title>
  <link rel="alternate" href="http://ea.donntu.ru/handle/123456789/5443" />
  <subtitle>2008 г.</subtitle>
  <id>http://ea.donntu.ru/handle/123456789/5443</id>
  <updated>2026-04-22T22:12:10Z</updated>
  <dc:date>2026-04-22T22:12:10Z</dc:date>
  <entry>
    <title>Моделирование опасных событий, связанных с загрязнением атмосферного воздуха в городах</title>
    <link rel="alternate" href="http://ea.donntu.ru/handle/123456789/8136" />
    <author>
      <name>Звягинцева, А.В.</name>
    </author>
    <id>http://ea.donntu.ru/handle/123456789/8136</id>
    <updated>2012-03-14T00:02:22Z</updated>
    <published>2008-07-04T00:00:00Z</published>
    <summary type="text">Title: Моделирование опасных событий, связанных с загрязнением атмосферного воздуха в городах
Authors: Звягинцева, А.В.
Abstract: The algorithm of dangerous occurrences modelling, related to atmospheric air pollution in cities is offered. &#xD;
It is shown that a risk estimation on the average annual concentrations of harmful matters in the high &#xD;
dispersion variation case information on atmosphere pollution does not give the reliable estimation of the &#xD;
real negative affecting on the people.</summary>
    <dc:date>2008-07-04T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Дискретизация функционально заданных поверхностей</title>
    <link rel="alternate" href="http://ea.donntu.ru/handle/123456789/8131" />
    <author>
      <name>Вяткин, С.И.</name>
    </author>
    <id>http://ea.donntu.ru/handle/123456789/8131</id>
    <updated>2012-03-14T00:02:17Z</updated>
    <published>2008-07-04T00:00:00Z</published>
    <summary type="text">Title: Дискретизация функционально заданных поверхностей
Authors: Вяткин, С.И.
Abstract: Surface discretization (triangulation) is a well-&#xD;
known topic of computational geometry. A triangulation of a set of points is a way of connecting them to form &#xD;
a simple triangle. The existing algorithms of triangulation differ in terms of their computational complexity, &#xD;
the frequency of the function evaluation (sampling), and the resulting mesh quality. High efficiency of a &#xD;
triangulation algorithm can be achieved by the use of optimization techniques, which can reduce the &#xD;
complexity of the basic algorithm. A new approach for accurate triangulation of functionally defined surfaces &#xD;
using perturbation functions is proposed. For analyzing how close the evolving meshes approaches the &#xD;
functionally defined surface two error metrics and uniformity are used. The metrics measure deviations of the &#xD;
vertices from the functionally defined surface and deviations of mesh normal from the normal of the &#xD;
functionally defined surface.</summary>
    <dc:date>2008-07-04T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Модель процесса построения динамической сцены в аэронавигационных геоинформационных системах реального времени</title>
    <link rel="alternate" href="http://ea.donntu.ru/handle/123456789/8118" />
    <author>
      <name>Васюхин, М.И.</name>
    </author>
    <author>
      <name>Гулевец, В.Д.</name>
    </author>
    <author>
      <name>Креденцар, С.М.</name>
    </author>
    <id>http://ea.donntu.ru/handle/123456789/8118</id>
    <updated>2012-03-14T00:02:14Z</updated>
    <published>2008-07-04T00:00:00Z</published>
    <summary type="text">Title: Модель процесса построения динамической сцены в аэронавигационных геоинформационных системах реального времени
Authors: Васюхин, М.И.; Гулевец, В.Д.; Креденцар, С.М.
Abstract: In the paper model of dynamic scene creating &#xD;
process in aeronavigation geoinformation real-time systems is proposed. This model is based on &#xD;
set description of scene components.</summary>
    <dc:date>2008-07-04T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Уменьшение аппаратурных затрат схемы МПА Мура при реализации в   базисе CPLD</title>
    <link rel="alternate" href="http://ea.donntu.ru/handle/123456789/8114" />
    <author>
      <name>Цололо, С.А.</name>
    </author>
    <id>http://ea.donntu.ru/handle/123456789/8114</id>
    <updated>2012-03-14T00:02:13Z</updated>
    <published>2008-07-04T00:00:00Z</published>
    <summary type="text">Title: Уменьшение аппаратурных затрат схемы МПА Мура при реализации в   базисе CPLD
Authors: Цололо, С.А.
Abstract: Method of Moore’s circuit &#xD;
optimization is proposed. Method based on features of CPLD architecture and Moore’s FSM model. An &#xD;
example of application of proposed method is given</summary>
    <dc:date>2008-07-04T00:00:00Z</dc:date>
  </entry>
</feed>

