Computer Sciences

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

Authors: Ukolova E. V.

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.

Synthesis of Pseudorandom Test Patterns for the Discrete Device

Authors: Ukolov I. V.

In article the pseudorandom method of test patterns generation for discrete devices applicable for both to combinational devices and to sequential devices is considered. The entropy approach for search of optimum distribution of probabilities of input vectors is used that allows reducing average length of generated tests. For definition of the mentioned probabilities the multivariate problem of search of a maximum of output entropy with application of genetic algorithm is solved.

Methods and Algorithms of Identification of External Heat Exchange Parameters for Heat and Mass Tranfer Processes

Authors: Tkachenko V. N., Ivanova A. A., Shuba O. V.

The methods and algorithms of identification of external heat exchange parameters based on least square method are proposed. The comparative analysis of distributerd parameters identification methods is performed.

O РАЗРЕШИМОСТИ ОБРАТНОЙ ЗАДАЧИ ШТУРМА – ЛИУВИЛЛЯ В СИММЕТРИЧНОМ СЛУЧАЕ

Authors: Mazur T. V.

Necessary and sufficient conditions are provided for the solvability of the inverse problem of recovering Sturm – Liouville operator from its spectrum in the central symmetry case.

Conditions for Functions on Semilattices to be Realized by Networks with Stable Behaviour under Hazards

Authors: Pankratova I. A.

The notion of functional stability under hazards is introduced for networks realizing functions defined on finite upper semilattices. Some constructive conditions are established for such functions to be realized by stable networks composed of any elements or of transistors and switches.

About One Approach to the Reconstruction of Behavior of Finite Automaton with Circularity of the Change of States

Authors: Ermoshina O. S.

The article deals with one of the possible approaches to the problem of reconstruction of determined finite automaton behavior, based on the information about the current (defective) and specified (correct) laws of functioning with the help of periodic sequences. A model of finite automaton circularity was built for the purpose of analyzing the behavior of a finite automaton in a circularity mode.