1. . 48596 , G01N27/22. / .. , .. , .. -
(). - 2001107200; . 23.10.2001; . 16.08.2004, . 1. - 2 .
2. . 51222 , G01N27/22. / .. , .. , .. (-
). - 2002020867; . 04.02.2002; . 15.10.2004, . 10. - 2 .
3. . 62125 , G01N27/22. / .. , .. , .. (-
). - 20021210070; . 13.12.2002; . 15.12.2003, . 12. - 2 .
4. ., .. . - .: ,
1972. - 79 .
5. , G01N27/22. / .. -
, .. ( ). - 94030042; . 09.08.1994; . 20.06.1996, . 25. - 4 .
------------------ ---------------------
, : , ,
----------------------------------
, -
: , ,
----------------------------------
A method of impedance measuring, which allows to determine the value of impedance at different frequencies with known parameters of the nonreciprocal two-port by measuring the signal power at the output of the two-port with its direct and inverse connection is proposed Key words: nonreciprocal two-port, the method of measuring, impedance ------------------ ---------------------
621.317.3



..
, - . , 87, . , , 21100 .: (0432) 53-05-27 -mail: L_Fil1@mail.ru
..
, * .: (0432) 35-63-29 -mail: pktavntu@mail.ru
.. *
.: (0432) 68-85-65 -^: chehroma@yandex.ru * , 95; . , , 21021
1.
, , , - [1]. , ReZx, ImZx Zx,
. ( ) [2]. [3]. [4] [5].
3
( 10%), .
2.
, .
, ReZx , . 1. , , ReZ12, ImZ12 0, , 1 2 Zx .
, , ,
3.
[6], , (. 1),
[z-]=
Z 1 I Z1
Z 21 Z ]22
Z11 + Zx Z21 + Zx
Z -Z
12 x
Z -Z
22 x
(1)
Zxx, Z12, Z21, Z22 - .
. 1. Zx
(1)
K=
Z 21 Z21 + Zx
Z 2 Z12 - Zx
ZZ
21 + x ZZ
0
1 - Z
Z12Kms0 + Zx
Z -Z
12 x
(2)
0 = |Z21/Z12| - - , Z = 0
[7].
, , (2), :
K -K
ReZx = ReZ12-------^
x 12 1+K.
(3)
, Kms =^/ [8], (3)
ReZ = ReZ,
]: Kms0 VP
VPBX + V
(4)
- , , : = const, ZH = Zr.
(4) , , -
Z Z Z
ї ^ ^ ї1, Z21 ї Z ї Z,
7 7 7 21 x 1.
Z12 Z12 Z12
(2) :
K
Z
Z
V Re2Z21 + Im2 Z21 ^Re2 Zx + Im2 Zx
(6), :
ReZ = ReZi, ImZ = ^-Z2-
x x

PP ReZ = ReZ21 I , ImZ = ImZ21 '
x VP x VP

(5)
(6)
(7)
. (8)
(8) , , . , [5], , ,
.
4.
, . - [9]:
[ZB ] =
1 + (1 - ):

irnC
irnC
(9)
1 , 2 - , - ,
=---- -
1+ jf/f
, 0 - , - .
640 (9) : 1 = 1,21 , 2 = 2,79 ,


1
F
=0,5 , 0 = 0,98, .= 3 [10]. (. 1) , , (5), = 10 + 100i .
(. 1) 0,1 = 10,03.
(7) (9)
ReZ * = =

1^ * = ImZ,^
103,896 10,03 1095
= 10,359 ,

10,03
= 109,172 .
, :
- :
ReZ -ReZ 8 = 100% = 3,6% ReZx
- :
= ^ - 14 .1000% = 9,2%. ImZ.
. 2.
)
. 2. () () Zx () ()
, (0,25+ 0,35)^ 10% .
, , 15% (0,1 +0,14)^. .
5.
1. ReZx , , .
2. Zx , , , . Z21ї Zx ї Z12 .
3. , = 0,1 3,6% - 9,2% - .
4. , (5).

1. : . / . . .
, . . . - . : , 1980. - 302 .
2. , . . -
: , / . . . - . : , 1982. - 223 .
3. . . 1644048 , G 01 R 27/26. / .. (). - 3453753/24-09 ; . 19.12.89 ; . 23.04.91, . 15 - 3.
4. , . . / . . , . . . - . : . , 1980. - 360 .
5. , . . / . . , . . . - : --, 2006. - 188 .- . : . 186-187. - ISBN 966641-168-7.
6. . , / . . . , . . , . . . - . : . , 1968. - 504.
7. , . . - / . . , . . , . . . - : , 2009. - 274 . - . : . 272-273. - ISBN 97 8-966-641-332-4.
8. , . . - / . . , . .
, . . . : , 2010. - 176 . - . : . 173-175. - ISBN 978-966-641-342-3.
9. , . . / . . , . . - . : , 1978. - 344 .
10. , . . : / . . , . . , . . . ; . . . . - . : , 1981. - 656 .


: , , , Lempel-Ziv-Welch (LZW)
------------------------------------

: , , , Lempel-Ziv-Welch (LZW)
------------------------------------
This paper describes the possibility of Kolmogorov algorithmic complexity method using for definition of heart rate complexity Keywords: Kolmogorov complexity, the heart rate dynamics, nonlinear dynamics, Lempel-Ziv-Welch compression algorithm (LZW)
Q
612.17
HEART RATE COMPLEXITY DEFINITION USING KOLMOGOROV ALGORITHMIC COMPLEXITY METHOD
O. Kyselova
Senior Lecturer in Computer Science* Tel.: +38-050-443-02-82 E-mail: olga.mmif@gmail.com
Ie. Nastenko
Dr.Sci.Biol., Head of Informatics and Computational
Physiology Department Amosov National Institute of Cardiovascular Surgery of National Academy of Medical Science of Ukraine 6, Amosov street, 252601 GSP, Kyiv, Ukraine E -mail: nastenko@inbox.ru
M. Gerasymchuk*
E-mail: maxgerasimchuk@gmail.com *Department of Therapeutical Diagnostic Complexes Intercollegiate College of Medical Engineering National Technical University of Ukraine Kyiv Polytechnic
Institute
prospect Peremogy, 37, Kyiv, Ukraine, 03056
Introduction
The Kolmogorov algorithmic complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. Kolmogorov complexity of a bit string x is the length of the shortest program that computes x and halts.
One can draw an analogy with the archiving. Thus we understand the complexity of the file as the size of the smallest archive that after unpacking is this file. In other
words Kolmogorov complexity is the minimum number of bits into which a string can be compressed without losing information.
The Kolmogorov complexity decline especially when combined with a variability of a numerical sequence reduction is rather serious indication of the body regulatory redundancy reduce. And it can be regarded as indication of increasing probability of sudden cardiac death occurrence. Such situations are often observed in coronary care units in patients with high severity of conditions