Computer Sciences

Method for Analysis of Closed Queueing Networks with Discrete Time, Batch Movements of Customers and Dynamic Control of Service Rates

Authors: Mitrophanov Y. I., Dolgov V. I., Rogachko E. S., Stankevich E. P.

The closed queueing networks with single class of customers, discrete time and batch movements of customers are considered. Queues include multiple identical servers with geometric distribution of service times. A method for dynamic control of service rates in queues is proposed. The control is realized by use of different service rates during fixed time intervals in process of networks operation. When this method is used in queueing networks of considered type, close to given customer allocation among queueing systems is provided.

The Algorithm for Checking Transitivity of Mappings Associated with the Finite State Machines from the Groups ASp

Authors: Karandashov M. V.

The paper deals with a question of determining the property of transitivity for mappings defined by finite automata. A criterion of transitivity for mappings defined by finite automata on the words of finite length in terms of finite automata and trees of deterministic functions is presented. It is shown that for finite automata from groups ASp an algorithm can be constructed for checking transitivity. To prove this fact some properties of Abelian groups of permutations are used.

Indices of States in Dynamical System of Binary Vectors Associated with Palms Orientations

Authors: Zharkova A. V.

Dynamical system of binary vectors associated with palms orientations is considered. A tree is called a palm with s + c edges if it is a union of c + 1 paths with common end vertex and all of these paths except perhaps one (with s edges) have a length 1. The system splits into finite subsystems according to the dimension of states. States of a finite dynamical system (B s+c ,γ) are all possible orientations of a given palm with s + c edges.

Adaptive Algorithm of Parametric Synthesis of Hybrid Dynamical Systems

Authors: Andreichenko D. K., Andreichenko K. P., Melnichuk D. V., Portenko M. S.

Hybrid dynamical systems (HDS) are connected by means of the boundary conditions and the constraint’s conditions systems of ordinary differential equations and partial differential equations with the corresponding initial conditions. Under the parametric synthesis we understand the algorithm for selecting parameters of feedbacks of controlled HDS, providing the required quality of transients.

On the Directional Movement of a Collective of Automata without a Compass on a One-dimensional Integer Lattice

Authors: Kurganskyy A. N., Sapunov S. V.

A collective of finite automata has to preserve unidirectional movement on one-dimensional integer lattice whose elements (vertices) are unlabelled. The automata does not distinguish between equally labelled vertices by their coordinates of direction (that means each automaton has no compass). We considered collectives consisting of an automaton and some pebbles, i.e. automata of the simplest form, whose positions are completely determined by automaton.

Morphismes Based on Compatible Tolerances of Finite Automata

Authors: Mangusheva I. P.

It is suggested a method of a construction with the help of some triple of tolerances defined on the sets of states, input and output symbols of an finite definite automaton an another automaton which is connected with the original automaton by a certain morphism.
Considered construction generalizes the known method of finding of the homomorphic images of an automaton with the help of a triple of equivalences, which satisfies to the certain conditions.

Hash Functions for Diagnostic Information Reduction

Authors: Goldshteyn V. B., Mironov S. V.

In this paper we present a new approach for the solution of problem of the diagnostic information reduction. This approach is based on use of hash functions delivering a compact signature for records in a fault dictionary. The experimental results show a considerable decrease in the storage requirement of diagnostic information reduced with the help of such functions.

One Model for Representation of Production Knowledge Base

Authors: Ivanov A. S.

We offer a new approach to structure of production knowledge bases. In our approach the knowledge base is modeled by multigraph. We offer a deduction algorithm for such a model. The experimental results show the effectiveness of proposed methods.

The Tasks of Interactive Processing of Search Queries in the Set Theory Formalization

Authors: Polykov V. N.

In the paper description in the set theory of main mechanisms of query processing is fullfiled. Focusing and widening of fullnes are described as query processing. The methods are used in the project of Intelligent Search Engine. Newness of the approach consists that there is the first systematization of interactive methods of word sense disambiguation in man-machine complex «user-search engine». Engineer realization of the methods was done in SQL.

Solving Some Problems of Automata Behaviour Analysis

Authors: Tyapaev L. B.

In the context of the geometrical approach and by means of geometrical methods automaton behaviour is studied as curves on the plane. The attention is called to a new way of setting the finite-state machines as a functional curve on the plane. Also within the limits of the geometrical approach problems of automaton analysis, synthesis, diagnosis and transformation have been also investigated. 

Pages