# Computer Sciences

## Genetic Algorithm for Placing Control Points in a Digital Device

The article considers the problem of placing control points in a digital device in order to increase its controlability. The previously known methods for solving this problem were based on a preliminary analysis of the device topology (structure) for the estimation of such parameters as controllability, observability and testability. The corresponding indicators in many well-known systems for analyzing compliance were calculated using software tools. Carrying out such an analysis is a rather laborious process.

## Inaccesible States in Dynamic Systems Associated with Paths and Cycles

Formulas are derived for calculation of the number of inaccesible states in dynamic systems formed by binary vectors encoding orientations of paths and cycles.

## On Lower Bound of Edge Number of Minimal Edge 1-Extension of Starlike Tree

For a given graph G with n nodes, we say that graph G∗ is its 1-edge extension if for each edge e of G∗ the subgraph G∗ −e contains graph G up to isomorphism. Graph G∗ is minimal 1-edge extension of graph G if G∗ has n nodes and there is no 1-edge extension with n nodes of graph G having fewer edges than G. A tree is called starlike if it has exactly one node of degree greater than two. We give a lower bound of edge number of minimal edge 1-extension of starlike tree and provide family on which this bound is achieved.

## Indices in Dynamical System (B, δ) of Binary Vectors

An algorithm is proposed for computation of indices of states in dynamical system (B, δ), whose states are binary vectors and evolutional function δ transforms vectors according to the following rules: the initial component 0 (if exists) is replaced by 1, every digram 10 by 01, and the final 1 (if exists) by 0. Correctness of the algorithm is proven..

## The Continuous Schedule with Two-Element Instructions

For two-element instructions conditions of existence of the continuous schedule of service are found.

## On the Solution of Chess Positions Using Computational Tree Logic

The paper describes a construction of four formulas of Computational tree logic corresponding to an arbitrary chess position. At least one of these formulas is satisfiable and leads to the solution of chess position: value of position (a draw or a victory of one of the sides) and necessary strategy for getting this value is constructed using the formula model.

## The Application of Artificial Neural Networks to Identification of Some Amino Acids in Binary Mixtures

The paper develops the technique of applying the method of artificial neural networks for processing of the spectrophotometric data in order to determine the phenylalanine and tyrosine in undivided binary mixtures of these amino acids at microgramm concentrations. Calculated error in the determination is: minimum of 1%, the maximum does not exceed 10%. The maximum error is observed for mixtures in which the content components differ by an order or more.

## Experiments with Non-Stationary Bilinear Discrete Systems

The existence conditions of synchronizing, homing and diagnostic sequences for the non-stationary bilinear systems are found. Methods for synthesis of mentioned sequences are suggested.

## On One Algorithm for Finding of a Mask of Diagnostic Information

This paper describes an approach to reduction of a diagnostic information with a help of masks. The new algorithm for finding of a mask is proposed. The algorithm has appropriate time characteristics and small memory requirements. The experimental results show an effectiveness of proposed algorithm on fault dictionaries of circuits in ISCAS’89 benchmark set.

## The Construction of Supervisory Test with the Use of the Genetic Algorithm

The article describes a control test generation method for discrete devices based on the genetic algorithm. The method operability and effectiveness have been checked by means of creating tests for circuits listed in the ISCAS’ 89 catalogue. The C++( Visual Studio 2005) program has been implemented in order to simulate circuit and generate tests. Faults are simulated by programmatically setting an appropriate object in storage to a special state, in which it acts as a faulty component.