# Ilya Golovinskiy

Date of birth: 30.01.1951

Age: 65

Citizenship: Russia

**Background**

While studying in school, he won prizes at All-Union Mathematical Olympiads.

1968-1973 - Mechanics and Mathematics Faculty of Moscow State University, with honors

1975-1978 - Graduate School, Institute of History of Science and Technology of the USSR Academy of Sciences (supervisor - Yushkevich)

1979 - dissertation of the candidate of physical and mathematical sciences on the history of finite difference methods

Since 1992 - in the Institute of Electricity

At the present time - leading researcher VNIIE.

In the history of mathematics:

Built classification interpolation series in the works of Newton, Taylor, Laplace and Abel

He showed the origin of the Laplace transform of the integral representations of the gamma function and beta function

He described the construction of interpolation Laplace series by means of bi-orthogonal systems of functions

The convergence of Euler`s Summation Formula-Buhl and established its relationship with the formula of Euler-Maclaurin summation

Establish communication Cauchy interpolation method with different classes of functional series, with the objectives and results of Chebyshev and Markov

For the first time investigated and described the early history of iterations of analytic and functional equations, setting the connection method of computing logarithms Briggs with the Koenigs function

Systematized the different approaches to the justification of the method of least squares in Legendre, Gauss and Chebyshev

In the field of digital control and artificial intelligence:

It identifies the main classes of rules management technology in electrical networks and formalized their semantic structure. The suggested method of syntactic patterns, based on which, together with AV Bobrov created program automatically convert the semantic structures of rules of natural language texts

Formulate the principles of emergency management of complex technical systems. Applying them to the study on a computer model of the accident at the substation Chagino Mosenergo occurs 24-25 May 2005

He formulated the concept of ASKUP - Automated system monitoring and control switching in electrical networks

The suggested model of professional intelligence dispetchera.Na its basis developed methods for statistical evaluation of the program and professional qualifications of the controllers

Developed (together with VM Maximov and N. Kucherov, with the participation of leading specialists of JSC "FGC UES") of the Russian Federation of draft national standards for operational switching in electrical networks

Introduced increment operation and closure of graphs, which in combination with other operations graph algebra (union, intersection and difference) provide an algebraic formalization of algorithms for structural and structural and situational analysis graph models of complex technological systems. I construct an analogue of the algebra for hypergraphs and used it to analyze the hypergraph models of electrical networks

He formulated the principle of semantic boundaries, as a general principle of search and inference in the graph (binary) models and semantic networks. On the basis of defined functions and predicates of semantic boundaries, which simplifies the use of algorithms for structural and structural and situational analysis graph models isemanticheskih networks

The mathematical formalization of the operation as a generalization of the contraction of the graph model. Apply it to the integration of different types of computer models of the electrical network

For ASKUP created an integrated computer model with simultaneous operation of the static model of the electric mode and switching discrete model driven technological system of rules

Establish the conditions of consistency of integration of various graph models a technological system

The mathematical formalization of a class of discrete control problems - problems with constraints on the order of switching. Established that the diagram of the general solution of this problem have any distributive lattice. Also established that every finite distributive lattice is a diagram of the general solution of a problem of this class. He defined switching algebra and gave a general method for constructing common solutions to problems of this class, as the conversion of the plurality of predetermined constraints in the algebraic formula for the general solution