
Main / Andrey Vladimirovich Tsyganov
Author: "Andrey Vladimirovich Tsyganov"
Andrei Vladimirovich Tsyganov, Ulyanovsk State Pedagogical University named after I.N. Ulyanov, Candidate of Physics and Mathematics, Associate Professor at Ulyanovsk State Pedagogical University named after I.N. Ulyanov; an author of papers, monographs, and textbooks; holds State Registration Certificates of computer programs; interested in metaheuristic and hybrid algorithms of stochastic and discrete minimization. [email: andrew.tsyganov@gmail.com]A. Tsyganov, Innokentiy Vasilyevich Semushin, Ulyanovsk State University, Doctor of Science in Engineering, Professor of Information Technologies Department at Ulyanovsk State University; an author of papers, monographs, and textbooks; holds patents for inventions; interested in filtering and control under uncertainty. [email: kentvsem@yandex.ru]I. Semushin, Iuliia Vladimirovna Tsyganova, Ulyanovsk State University, Candidate of Physics and Mathematics, Associate Professor of the Information Technologies Department at Ulyanovsk State University; an author of papers, a monograph, and textbooks; holds State Registration Certificates of computer programs; interested in parameter identification, adaptive filtering, and numerically efficient algorithms for stochastic systems. [email: tsyganovajv@gmail.com]I. Tsyganova, Aleksei Vladimirovich Golubkov, Ulyanovsk State Pedagogical University named after I.N. Ulyanov, Candidate for the Master’s Degree of Ulyanovsk State Pedagogical University named after I.N. Ulyanov; an author of papers; holds State Registration Certificates of computer programs; interested in mathematical modelling and programming. [email: kr8589@gmail.com]A. Golubkov, Stanislav Dmitriievich Vinokurov, Ulyanovsk State Pedagogical University named after I.N. Ulyanov, Postgraduate Student at Ulyanovsk State Pedagogical University named after I.N. Ulyanov; an author of papers; holds State Registration Certificates of computer programs; interested in mathematical modelling and programming. [email: phoenixdragonvista@ya.ru]S. Vinokurov


Metaheuristic Algorithms in the Issue of Identification of the Moving Object Mathematical Model Parameters
The article considers issues on the calculation of an aircraft range capability on the basis of tactical radius data within different altitude and speed ranges. In some cases, it is necessary to calculate the enemy’s aircraft range capability. As a rule, such calculations do not have any documents, parameters (fuel flow rate and consumption per kilometre), and methodologies for fuel consumption calculation. Usually, open information sources also do not have any information about the enemy’s aircraft flight distance and time. Due to this fact, the need in indirect and approximate estimation of the enemy’s aircraft range capability with the use of information from public and common data is driven. Information about tactical radiuses within the enemy’s aircraft different altitude and speed ranges is the example of such public data. The proposed methodology for calculation of the enemy’s aircraft range capability allows to estimate the enemy’s capabilities in target attacks with 10% ratio error and can be used in combat management systems of surface ships and shorebased complexes. The methodology is also of great interest for operational and approximate estimation of own forces capabilities in case of the operational loading choice. More accurate calculations should be carries out on the basis of manuals on flight operation and time if such opportunity exists.



Sections: Mathematical modeling
Subjects: Mathematical modeling. 
Andrey Vladimirovich Tsyganov, Ulyanovsk State Pedagogical University named after Ilya N. Ulyanov, Candidate of Physics and Mathematics; Associate Professor at the Chair of Higher
Mathematics of Ulyanovsk State Pedagogical University named after Ilya N. Ulyanov; author of scientific publications,
a monograph, teaching guides and certificates of program registration in the fields of parallel heuristic algorithms
and algorithms for minimizing nondeterministic finite automata [email: andrew.tsyganov@gmail.com]A. Tsyganov


Parallel Algorithm for Constructing Comautomaton Using Techniques Openmp and Mpi
Complete (COM) automaton which is one of the regular language invariants, is used in nondeterministic finite automata
minimization algorithms, but the algorithm for its construction from canonical automata has an exponential complexity. One
of the ways to speed up the construction of a COMautomaton is to use parallelism. In the present paper, the author considers
the parallel algorithm for constructing COMautomaton using parallel programming techniques OpenMP and MPI, which is
implemented in a software tool for minimizing nondeterministic finite automata called ReFaM. The author also provides a
description of the algorithm and its implementation as well as the results of numerical experiments. Nondeterministic finite automata, state minimization, complete automaton, parallelism, openmp, mpi.



Sections: Software and mathematical support of computers, computer systems and networks
Subjects: Mathematical modeling, Automated control systems, Information systems. 
