Computer Sciences

T-irreducible extension for union of paths and cycles

 A graphH with nodes is an extension of a graph G with nnodes if each maximal subgraph of H contains G. Trivial extension of a graph G is the connection of graph G and the singleton graph (i.e. we add one node to the graph G and this node join with each node of G). T-irreducible extension of graph G is an extension of the graph G which is obtained by removing maximal set of edges from the trivial extension of G. One of T-irreducible extensions is constructed for an arbitrary union of cycles and paths. 

Ordered automata and tolerant images of FDA

Finite deterministic automaton (FDA) with partially ordered (an ordered automaton) sets of states, input and output symbols is described in the article. The mapping of FDA on an ordered automaton, which is named "p-morphism" is defined. It is shown that so called tolerant images, which are constructed with the help of compatible tolerances on the set of states of FDA, are particular case of ordered automata, which are connected with the original automaton by a p-morphism.

Using parallel computing technologies for modeling of metallic photonic crystals

This article presents opportunities of using parallel computing technologies Message Passing Interface and Open Computing Language for modeling of metallic photonic crystals with the method of Green's functions and integral equations. The efficiency of these technologies is analized and the results are presented. 

Numerical Modelling and the Analysis of Impact of Distortions on OFDM/QAM-signal

In this work mathematical models of communication channels with various interferences, their influence on constellation diagrams’

points in systems with OFDM/QAM signals are considered, recommendations about channel monitoring are made.

Minimal Edge Extensions of Palm Trees

Minimal edge extension of graphs can be regarded as a model of optimal edge fault tolerant implementation of a system. The problem

of finding the minimal edge extensions of an arbitrary graph is NP-complete, that’s why it is of interest to find classes of graphs for

which it is possible to build a minimal edge extension analytically. This paper is about of the one-edge extensions of a graphs from

a special class named palm trees. In this paper presents a kind of one-edge extension for some palm trees and the proof that it is

minimal.

On the Error of Approximation by Means of Scenario Trees with Depth 1

Let¤n denote the set of scenario trees with depth 1 and n scenarios. LetX = (0 · x1 < . . . < xn · 1) and let¤n(X) denote

the set of all scenario trees of depth 1 with the scenarios X = (0 · x1 < . . . < xn · 1). Let G be a probability distribution

defined on [0, 1] and H be a subset of measurable functions defined on [0, 1]. Let dH,X(G) = inf ˜G∈¤n(X) dH(G, ˜ G) and

dH(G) = inf ˜G∈¤n

dH(G, ˜ G), where dH(G, ˜ G) := suph∈H

¯¯¯

R h dG − R h d˜G

¯¯¯

. The main goal of the paper is to estimate

The Effectiveness Analysis of Several Parallel Algorithms Based on Simulated Annealing Method of Global Optimization Problem Solving

This article presents the results of the development of a parallel computing system and testing its capabilities applied to solving

scientific and educational problems. Three parallel variants of the simulated annealing algorithm are proposed and implemented

for multiextreme criterion function of two variables with explicit constraints. The reliability and performance of parallel versions of

the algorithm, depending on their parameters and the number of working nodes in parallel computing system, is investigated. It is

Комплексный контроль ресурсов сложных человекомашинных систем

Исследуется природа возникновения аварийных ситуаций и катастроф в сложных человекомашинных системах. В целях комплексной оценки и прогнозирования аварийных ситуаций предлагается рассматривать ресурс системы в виде набора показателей, включающего человеческие ресурсы и ресурсы машин. Прогнозирование аварий предлагается осуществлять с проверкой логических условий безопасности, которые объединяют разнородные ресурсы системы.

Pages