Computer Sciences

Quantum Computers and Quantum Algorithms. Part 1. Quantum Computers

The paper presents the principles of operation of quantum computers. Competitive advantages of quantum computing are shown and some variants of a construction of an ideal quantum computer proposed. We analyze also the computational process in a quantum computer from the point of view of the complexity of algorithms. Implementation of nodes of a quantum computer is exemplified based on quantum communication schemes. The operation of Bloch sphere and visualization of the state of the qubit are described. Major obstacles to the creation of quantum computers are considered.

The Development of Software Components for Streaming Audio Content Filtering Through the Use of Hidden Markov Models

The results of the development of efficient algorithms for streaming voice recognition using stochastic models based on the use of hidden Markov models are shown in this work. The article provides basic theoretical information for the hidden Markov model of the discrete system and the necessary parameters to define it are distinguished. Also there are three main tasks considered that need to be solved for the successful application of hidden Markov models in speech recognition systems.

T-irreducible Extensions for Starlike Trees

We deal with a sort of optimal extensions of graphs, so called T-irreducible extensions. T-irreducible extension of a graph G is an extension of G obtained by removing a maximal set of edges from the trivial extension of G. A difficult starlike tree is a starlike tree that has at least one difficult node. T-irreducible extensions for nondifficult starlike trees were constructed by M. B. Abrosimov, T-irreducible extensions for palms (one of subclasses of starlike trees) were constructed by S. G. Kurnosova.

Reconstruction of a Labeled Graph by a Graph-walking Mobile Agent

The problem of construction of graph-like operational environment by a mobile agent is considered. The model of environment is defined as a simple undirected vertex labeled graph. We propose a polynomial time algorithm of graph reconstruction and labeling for the collective consisting of agent-explorer and agent-supervisor.

Parallelization of Parametric Synthesis by «Problems Portfolio» Scheme Based on MPI Technology

We propose a prototype of a parallelization scheme «problems portfolio» by standard means of MPI technology with application to problems of parametric synthesis of controlled hybrid dynamical systems. Parametric synthesis of the stabilization system of a controlled mobile object was performed. Efficiency of the proposed algorithm of dynamical balancing of computational load is shown.

Principal Ideals in the Congruence Semilattice of a Path

It is proven that principal ideals generated by congruences of a path having the same type are isomorphic lattices. The number of elements, atoms and coatoms is found for the principal ideal generated by a given congruence of a path.

The Application of a Genetic Algorithm to Global Optimization Problem Solving on Parallel and Distributed Computing Systems

This article presents the results of the adaptation of method of searching the global minimum of multiextremal criterion function of multiple variables with constraints based on genetic algorithm for parallel and distributed computing systems. Two variants of genetic algorithm parallelization are proposed. The reliability and performance of parallel versions of an algorithm, depending on its parameters and the number of nodes in parallel computer system is investigated.

On Varieties of Groupoids of Binary Relations

In the paper, the bases of identities of varieties generated by classes of groupoids of the binary relations are found.

Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata

Universal planar automata are universally attracted objects in the category of automata, for which sets of states and output signals are endowed with structures of planes. The main results of the paper give us necessary and sufficient conditions under which an arbitrary automaton is isomorphic to a universal planar automaton and an arbitrary semigroup is isomorphic to the semigroup of input signals of a universal planar automata.

 

Models of Information K-Channels with Memory

Analysis of non-binary (K-ary, K > 3) information channels (IC) with memory as complex stochastic structures is rather complicated mathematically. Of significant interest is the synthesis of simplified mathematical models for such channels that allow clarifying relatively simply the most important regularities occurring in real processes. Modeling of IC (K-channels) with memory is a vital problem that has both theoretical and practical importance.

Pages