Begell House Inc.
Journal of Automation and Information Sciences
JAI(S)
1064-2315
37
8
2005
On a Method for Results Refinement for Pseudo Inverse Modelling of Initial Boundary Effects in Dynamics of Systems with Distributed Parameters
1-13
10.1615/J Automat Inf Scien.v37.i8.10
Vasiliy V.
Skopetsky
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kyiv, Ukraine
Vladimir Antonovich
Stoyan
Kyiv National Taras Shevchenko University, Kyiv, Ukraine
Iurii G.
Kryvonos
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kiev, Ukraine
We present solutions of problems of dynamics of systems with distributed parameters under incomplete data about their initial boundary state. The state function of the considered systems is modeled by imaginary external dynamic perturbations, which act beyond bounds of the considered space-time domains. We solve problems of control of dynamics of such systems. Technique of refinement of results of root-mean-square modelling of known part of initial boundary conditions was suggested.
Investigation of Stationary Convective Flows in a Cylindrical Domain by the Galerkin Method
14-25
10.1615/J Automat Inf Scien.v37.i8.20
Nikolay N.
Salnikov
Institute of Space Research of National Academy of Sciences of Ukraine and National Space Agensy of Ukraine, Kyiv, Ukraine
We consider solving of stationary equations of convection in Boussinesq approximation by the Galerkin method. On the basis of the suggested trial functions we obtain solutions for wide range of problem parameters, Prandtl and Grashoff numbers. For the considered boundary conditions the solutions of the Boussinesq equations practically coincide with ones obtained by neglecting nonlinear terms in these equations.
Solving the Problem of Linear Programming on the Basis of Multiplex Approach
26-33
10.1615/J Automat Inf Scien.v37.i8.30
Mikhail M.
Lychak
Institute of Space Research of National Academy of Sciences of Ukraine and National Space Agency of Ukraine, Kyiv, Ukraine
Vladimir N.
Shevchenko
Institute of Space Research of National
Academy of Sciences of Ukraine and State
Space Agency of Ukraine, Kiev
Nina P.
Tsaruk
Institute of Space Research of National Academy of Sciences of Ukraine and National Space Agency of Ukraine, Kiev, Ukraine
A technique of solving linear programming (LP) problem on a set of arguments is suggested. The set is prescribed by a system of linear inequalities. The technique uses construction of a finite sequence of simplified estimates in the form of cones by goal-oriented adjunction and rejection of corresponding half-spaces. An iterative algorithm of enumerating of constraints, which are adjuncted, is substantiated and derived. A new software module for solving LP problem in MATLAB environment is created. Its comparison with a standard MATLAB function (linprog) demonstrated significant advantages both in quick-action (not less, than eight times faster) and in possibility of solving large-dimension LP problems (more, than one hundred variables).
On the Base Class of Controlled Queueing Processes (Application)
34-43
10.1615/J Automat Inf Scien.v37.i8.40
Igor P.
Sinitsyn
Research Institute of Automated Computer Systems “Ekotekh”, Kiev, Ukraine
We consider the practical use of the important base class of models of queueing controlled discrete processes, which earlier have been singled out by the author into the well known class of the models, admitting numerical optimization. The base class has the following advantage: on the one hand it involves many real discrete queueing processes, and on the other hand, it can be studied theoretically and realized in the software tools system of numerical optimization.
Development and Investigation of the Robust lgorithms of Ellipsoidal Estimation of the Inertia Characteristics of a Spacecraft Controlled by Powered Gyroscopes
44-57
10.1615/J Automat Inf Scien.v37.i8.50
Victor V.
Volosov
Institute of Space Research of National Academy of Sciences of Ukraine and National Space Agency of Ukraine, Kyiv
Igor A.
Kutsenko
Kyiv National Taras Shevchenko University, Kyiv, Ukraine
Yuriy A.
Selivanov
Institute of Space Research of National Academy of Sciences of Ukraine and National Space Agency of Ukraine, Kiev, Ukraine
The recursive algorithms of ellipsoidal estimation of the inertia characteristics of an orbital spacecraft (SC), its attitude being controlled by powered gyroscopes (PG), are proposed. It is assumed, that that SC is subjected to the action of uncontrolled bounded disturbing moments. The problems of determination of the SC inertia tensor in its center of mass and position of the center of mass itself are considered. For solving the first problem information about the angular velocity of SC, quaternion of attitude and kinetic moment of PG is used. For solving the second problem information about the angular velocity of SC and acceleration in an arbitrary given point is used. The algorithms use the method of ellipsoids for solving the systems of quadratic inequalities. The effectiveness of the proposed algorithms, their nonsensitivity (robustness property) regarding violation of a priori assumptions about properties of the controlled object and, besides, about the intensity of the hindrances of measuring, is illustrated by the results of computer modeling of estimation of the inertia tensor in the closed loop control system of SC attitude.
Determination of Nanosatellite Attitude in the Regime of Noncontrolled Motion
58-68
10.1615/J Automat Inf Scien.v37.i8.60
Alexander I.
Tkachenko
International Research and Training Center of Information Technologies and Systems of National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine, Kyiv
The problem of determining attitude of a small spacecraft under conditions, when limitations of energy resources, mass and size of the object force one to refuse controlling its motion with respect to the mass-center. The suggested solution is based on readings of the on-board magnetometer and the familiar from literature means of imitation of solar sensor by comparison of values of electric potential checked on the elements of solar batteries panels.
Complementarity Relationships in Encoding Bases Along One Chain in DNA Chromosomes
69-73
10.1615/J Automat Inf Scien.v37.i8.70
Alexandra A.
Vagis
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kiev, Ukraine
It is found, that the frequencies of complementary bases, as well as the frequencies of the like complementary n sets of letters, coincide on every separate DNA chain.