Analysis of publications of the journal kibernetika during 35 years
An analysis of publications of the journal Cybernetics and Systems Analysis during 35 years is presented. Some data characterizing subjects of the journal, its editorial board, and the development of the scientific schools of V. M. Glushkov and V. ...
Deductive tools of an algebraic programming system
A mathematical environment is a system of tools supporting interactive manipulation of knowledge represented in the form of (formalized) mathematical texts. A theoretical substantiation of a project proposed is the theory of interaction of agents ...
Foundations of programmology
An explication of the intuitive concept of programming is given in the form of explicative programming, which is a modern form of composition programming. It is based on a pragmatically finite system of principles. On this basis, an explication of ...
Quantum model of computations: Underlying principles and achievements
A quantum Turing machine is considered. A review of basic methodological principles and achievements in the field of quantum computations is given. Some problems of construction of correct quantum computations and their complexity are considered. ...
To the 70th anniversary of academician V. S. Mikhalevich academician V. S. Mikhalevich as a scientist and science organizer
The article is devoted to the 70th birthday of Academician V. S. Mikhalevich and presents a survey of his fruitful activity as scientist and science organizer.
On the status and prospects of systems analysis methods in ukraine
The paper deals with the role and place of systems analysis methods in the solution of complex problems in various spheres of human activity in Ukraine. The social and socio-economic prerequisites for development of theory and applied methods are ...
Models with conjugation conditions and high-accuracy methods of their discretization
New classes of problems with discontinuous solutions are considered. Corresponding generalized problems are obtained. Increased-accuracy computational schemes for their discretization are proposed. Numerical schemes are proposed with asymptotic ...
On estimation of the probability of absence of collisions of some random mappings
Let X and Y be finite sets and φ: (X,Y) →Y be a mapping. Consider a random mapping i → φ(xi,yi), where xi are arbitrarily chosen from the set X, whereas (yi) is a random sample from Y without replacement. A two-sided bound is derived for the ...
Approximate solution of a class of optimal control problems in domains of arbitrary form
A combination of both fictitious domain and net methods is used for solution of optimal-control problems for elliptic systems. The proposed difference scheme has an order of accuracy ofO(h1/2) in the net norm L2.
Global optimization in the class of stochastically unimodal functions
Generalization of the global optimization problem based on a stochastic approach is considered. The concept of a stochastic (or unimodal in the mean) fuction is introduced. To find the optimal solution, a heuristic self-organization procedure is ...
Service networks with multichannel nodes in a random environment
Service networks with multichannel nodes of semi-Markovian type are considered. The parameters of a source of demands depend on the state of the Markovian random environment. For the process of servicing demands, the conditions of existence of a ...
Programs with restoration of computations
In this article, the notion of a program with restoration of computations is introduced, i.e., such a program that makes it possible to renew interrupted computations from any intermediate value obtained before an interruption of its operation. As ...
