Zobrazeno 1 - 6
of 6
pro vyhledávání: '"O. V. Shylo"'
Publikováno v:
Український антарктичний журнал, Iss 16, Pp 158-166 (2018)
Objective: to carry out a comparative study of structural and functional responses of rats and hamsters RBCs when the animals entered and left an artificial hypobiosis state under conditions of hypothermia-hypoxia-hypercapnia. Methods: RBCs of rats a
Externí odkaz:
https://doaj.org/article/72afe7043e0d4b45b00888cb6d5c94b3
Autor:
O V Shylo, V V Lomako
Publikováno v:
Advances in Gerontology. 9:298-302
The dynamics of transformation and osmotic fragility (OF) of erythrocytes in the blood of rats of different ages (6, 12 and 24 months) were studied using small-angle light scattering method and the indices of erythrocytes transformation were calculat
Autor:
V V, Lomako, O V, Shylo
Publikováno v:
Advances in gerontology = Uspekhi gerontologii. 32(1-2)
The dynamics of transformation and osmotic fragility (OF) of erythrocytes in the blood of rats of different ages (6, 12 and 24 months) were studied using small-angle light scattering method and the indices of erythrocytes transformation were calculat
Publikováno v:
Cybernetics and Systems Analysis. 48:563-567
A new algorithm based on the global equilibrium search (GES) is developed to solve the weighted max-cut problem and is compared with currently the best solution algorithms. The advantages of the GES algorithm both in the performance and in the possib
Autor:
O. V. Shylo, V. P. Shylo
Publikováno v:
Cybernetics and Systems Analysis. 47:889-897
A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in
Autor:
O. V. Shylo, V. P. Shylo
Publikováno v:
Cybernetics and Systems Analysis. 46:744-754
The authors propose an approach to the solution of the maxcut problem. It is based on the global equilibrium search method, which is currently one of the most efficient discrete programming methods. The efficiency of the proposed algorithm is analyze