Computer Sciences

Simultaneous Approximation of Polynomial Functions and Its Derivatives by Feedforward Artificial Neural Networks with One Hidden Layer N. S.

 In this paper we propose the algorithm for finding weights of feedforward artificial neural networks with one hidden layer to approximate polynomial functions and its derivatives with a given error. We use the rational sigmoidal function as a transfer function. 

Discrete Dynamical Systems Defined Geometrical Images of Automata

 The object of study is the dynamic system defined by geometrical images of automata. The phase space of the system is determined by orthogonal and affine transformations of geometric images. Compositions of dynamical systems of a given type and their characteristics are studied. 

On Diagnostic Experiments for Fuzzy Automata

The concept of a generalized diagnostic experiment for fuzzy automata is introduced. A method constructing diagnostic experiments for fuzzy automata is proposed. The method is based on diagnostic tree structure. It is establish that the problem of diagnostic experiment synthesis is a multi-criteria optimization problem. 

Automata on algebraic structures

A survey of results obtained in investigations of automata determined over finite algebraic structures. The objects of research are automata over some finite ring, automata determined in terms of ideals, automata over varieties, and families of hash-functions determined by automata without output function. Computational security, complexity of simulation and homomorphisms of investigated automata are characterized. 

Combining de Bruijn graphs, overlap graphs and microassembly for de novo genome assembly

 In this paper we present a method for de novo genome assembly that splits the process into three stages: quasicontig assembly; contig assembly from quasicontigs; contig postprocessing with microassembly. The first stage uses de Bruijn graph, the second one uses overlap graph. We have carried out experiments of assembling the E. Coli genome (size ≈4.5 Mbp) andMaylandia zebra genome (size ≈1 Gbp). Advantage of proposed method is a low memory consumption. 

The ordered set of connected parts of a polygonal graph

Under a polygonal graph is meant an oriented graph obtained from a cycle by some orientation of its edges. The set of all abstract (i.e. pairwise non-isomorphic) connected parts of a polygonal graph is ordered by graph embedding. Polygonal graphs are characterized for which this ordered set is a lattice. 

Models of multi-criteria optimization with quality criteria

We consider mathematical models of multi-criteria optimization with quality criteria. The main problem is a construction of preference relations on the set of alternatives and an investigation of its mathematical properties. Two methods for contraction of Pareto-optimal set are proposed. The first method is based on introduction of a partial order relation on the set of criteria and the second leans selection of the most important groups of criteria. 

Representation of universal planar automata by autonomous input signals

Universal planar automata are universally attracted objects in the category of automata, whose sets of states and output signals are endowed with structures of planes. The main result of the paper shows that any universal planar automaton is isomorphic to a many-sorted algebraic system canonically constructed from autonomous input signals of the automaton. 

Queueing networks with batch movements of customers, blocking and clusters

 Two types queueing networks with batch movements of customers – networks with blocking and networks with clusters are investigated. Product form stationary distribution for networks with blocking of transitions in states, in which the number of customers in queueing systems exceeds given values, is derived. For queueing networks with disjoint clusters of systems the problem of analyzing is solved and the product form stationary distribution is found. Examples of analysis of the network with blocking and the network with clusters are presented. 

Identification of a state machine structure with finites fragment of behavior

 Identification of a state machine structure with finite fragments of behavior is discussed. The state machine behavior is a set of various finite-sequential (f.-s.) functions realized in a state machine, and under a finite fragment of behavior we mean traces of f.-s. functions and state machines. The concept of an identifying trace for a state machine irredundant over its realization is introduced.

Pages