Results 271 to 280 of about 2,775,940 (306)
Some of the next articles are maybe not open access.
Optimization of zero-sequence voltage compensation for zero-sequence directional elements
Electric Power Systems Research, 2021Abstract Compensating zero-sequence voltage measured is an effective measure to improve the sensitivity of zero-sequence directional overcurrent protections. However, when applied to double circuit power supply system, it may lead to misjudgment of zero-sequence directional elements.
Hao Xu +6 more
openaire +1 more source
New Sequences with Zero Autocorrelation
Problems of Information Transmission, 2002The authors give a new construction method for unimodular delta-correlated sequences of length \(p\) (a prime). This method uses so-called Gauss periods. In the case \(p=3f+1\) it is shown that the elements are defined by roots of a polynomial of degree 12 over \(\mathbb{Z}\) (the integers) for one family and by roots of a polynomial of degree 6 for ...
Ernst M. Gabidulin, Vitaly V. Shorin
openaire +1 more source
Zeros of polynomials embedded in an orthogonal sequence
Numerical Algorithms, 2010Let $\{x_{k,n}\}_{k=1}^n$ and $\{x_{k,n+1}\}_{k=1}^{n+1}$ , n????, be two given sets of real distinct points with x 1,n?+?1? ?0, which are chosen arbitrarily, that define p n?+?2 via the three term recurrence relation $$ p_{n+2}(x)=(x-b_{n+1})p_{n+1}(x)-\lambda_{n+1}p_n(x). $$
Alan F. Beardon +2 more
openaire +2 more sources
Search for sequences with zero autocorrelation
1988It exists sequences of length N of constant amplitude and zero autocorrelation over 2n symbols, provided that each sequence be preceeded by n symbols and followed by n other symbols. Methods for obtaining these N + 2n symbols are proposed and examples are given.
openaire +2 more sources
Multiplication of sequences with zero autocorrelation
Australas. J Comb., 1994This paper may be regarded as a continuation of the paper by the authors [On sequences with zero autocorrelation, Des. Codes Cryptography 4, No. 4, 327-340 (1994; Zbl 0808.05021)]. Main results of the present paper may be stated as follows: A set of near normal sequences of length \(n= 4m+ 1\) is defined as a quadruple of \((- 1,0,1)\)-sequences of ...
Koukouvinos, Christos +4 more
openaire +2 more sources
On integer-valued zero autocorrelation sequences
2013 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2013A systematic way to construct Integer-valued zero autocorrelation sequences is proposed. This method only uses fundamental theorems of discrete Fourier transform(DFT) and some number theories.
Soo-Chang Pei, Kuo-Wei Chang
openaire +1 more source
Generalized zero-sequence and anti-zero-sequence performance of induction machines
Archiv für Elektrotechnik, 1981The present paper derives a new general zero-sequence steady state ladder equivalent circuit of threephase induction machines where zero-sequence currents can simultaneously flow in both the stator and rotor windings. A general expression for the zero-sequence torque is also derived.
openaire +1 more source
The convergence to zero of Gaussian sequences
Mathematical Notes of the Academy of Sciences of the USSR, 1977Conditions for Gaussian sequences to converge to zero with unit probability are examined. A comparison theorem is proved, on the basis of which sufficient conditions are derived for the convergence to zero of Gaussian sequences, including, in particular, the previously known ones.
Buldygin, V. V., Douchenko, V. S.
openaire +1 more source
Overconvergence and Zeros of sequences of rational functions
Approximation Theory and its Applications, 1993Summary: We consider sequences of rational functions with a bounded number of free poles converging uniformly with a maximum geometric rate to a holomorphic function on a regular set, and we examine the limiting distribution of the zeros and its relations with the phenomenon of overconvergence. Our results further extend the well known classical theory
openaire +2 more sources
On cross numbers of minimal zero sequences
Australas. J Comb., 1996Let \(G\) be an (additively written) finite abelian group. Let us say that \(S=\{g_1,\dots,g_t\}\) is a minimal zero sequence if \(\sum_{1\leq i\leq t}g_i=0\) and there is not a proper subset \(I\subset \{1,2,\dots,t\}\) for which \(\sum_{i\in I}g_i=0\). The cross number \(k(S)\) is defined by \(k(S)=\sum^t_{i=1} [\text{ord } g_i]^{-1}\).
Scott T. Chapman, Alfred Geroldinger
openaire +2 more sources