PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Identification of failure transformers 22/0,4 KV and 110/23 KV using SFRA method
Brandt M., Michalík J.
TTS Technika Transportu Szynowego
|
2013
|
R. 20, nr 10
3505--3512
EN
The article deals with the identification type of faults in power transformer using the method SFRA. The results taken from this transformer are compared with the results taken from experimental distribution transformer.
2
Content available remote Mechanical effects of short-circuit currents analysis on autotransformer windings
Gutten M., Jurcik J., Brandt M., Polansky R.
Przegląd Elektrotechniczny
|
2011
|
R. 87, nr 7
272-275
EN
This article deals with a description of methods of an experimental analysis (SFRA method, monitoring, thermovision) concerning the actual reliability of windings and magnetic circuit of the transformer, which is required in power transmission and power distribution companies all over the world.
PL
Artykuł opisuje eksperymentalną analizę badania niezawodności uzwojeń i obwodu magnetycznego transformatora mocy.
3
Diagnostic measurements of 3-phase 25MVA transformer and their analysis
Brandt M., Michalik J., Sewald R., Sedlak J.
Logistyka
|
2011
|
nr 6
EN
This paper describes measurements of 25 MVA transformer, which is operated by company SSE a.s. in substation Handlova, by diagnostic methods like Sweep frequency response analysis (SFRA), measurement of capacity and loss factor tand , and insulation resistance measurement.
4
Content available remote Coinductive axiomatization of recursive type equality and subtyping
Brandt M., Henglein F.
Fundamenta Informaticae
|
1998
|
Vol. 33, nr 4
309-338
EN
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via simulation and bisimulation, respectively. The main novelty of the axiomatization is the fixpoint rule (or coinduction principle). It states that from A,Pý P one may deduce Aý P, where P is either a type equality t = t1 or type containment t
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.