Results 1 to 10 of about 5,995,861 (234)

A Single-Phase-to-Ground Fault Detection Method Based on the Ratio Fluctuation Coefficient of the Zero-Sequence Current and Voltage Differential in a Distribution Network

open access: yesIEEE Access, 2023
Because the traditional zero-sequence overcurrent protection method is not effective in detecting single-phase-to-ground faults (SPGF) in a low-resistance grounded system (LRGS), this paper analyzes the fault characteristics of a 10-kV LRGS in detail ...
Huamin Liang, Haifeng Li, G. Wang
semanticscholar   +1 more source

Linear recurrence sequences without zeros [PDF]

open access: yesCzechoslovak Mathematical Journal, 2014
There are two main results in the paper. In order to quote them we recall the following. Given a positive integer \(d\) and \(2d\) fixed integers \(a_0,\dots ,a_{d-1}\) and \(x_0,\dots ,x_{d-1}\) with nonzero \(a_0\); a linear recurrent sequence \((x_n)\) of order \(d\) is defined by these data if \[ x_{n+d}=\sum_{j=0}^{d-1}a_jx_{n+j} \] for all ...
Dubickas, Artūras, Novikas, Aivaras
openaire   +1 more source

Zero sums in restricted sequences [PDF]

open access: yesDiscrete Mathematics, 2021
A sequence $\bfx=(x_1,\ldots,x_m)$ of elements of $\Z_n$ is called an \textit{$A$-weighted Davenport Z-sequence} if there exists $\bfa:=(a_1,\ldots,a_m)\in (A\cup\{0\})^m\setminus\bfzero_m$ such that $\sum_i a_ix_i=0$. Here $\bfzero_m=(0,\ldots,0)\in\Z_n^m$.
Balachandran, Niranjan, Mazumdar, Eshita
openaire   +2 more sources

A Simple Zero-Sequence Voltage Injection Method for Carrier-Based Pulsewidth Modulation of the Three-Level NPC Inverter

open access: yesIEEE Journal of Emerging and Selected Topics in Power Electronics, 2021
This article proposes a simple zero-sequence voltagei injection method for the carrier-based pulsewidth modulation (CBPWM) of the three-level neutral-point-clamped (NPC) inverter.
Fa Chen, W. Qiao, Hongmei Wang, Liyan Qu
semanticscholar   +1 more source

On Short Zero-Sum Subsequences of Zero-Sum Sequences [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2012
Let $G$ be a finite abelian group of exponent $\exp(G)$. By $D(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a nonempty zero-sum subsequence. By $\eta(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a zero-sum ...
Fan, Yushuang   +4 more
openaire   +3 more sources

Complex zero decreasing sequences [PDF]

open access: yesMethods and Applications of Analysis, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Craven, Thomas, Csordas, George
openaire   +1 more source

Zeros of recurrence sequences [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1991
We give an upper bound for the number of zeros of recurrence sequences defined over an algebraic number field in terms of their order, the degree of their field of definition and the number of prime ideal divisors of the characteristic roots of the sequence.
van der Poorten, A. J.   +1 more
openaire   +2 more sources

The structure of maximal zero-sum free Sequences [PDF]

open access: yes, 2008
Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero.
Bhowmik, Gautami   +2 more
core   +3 more sources

Inductive Methods and Zero-Sum Free Sequences [PDF]

open access: yesIntegers, 2009
AbstractA fairly long-standing conjecture is that the Davenport constant of a groupWe also prove the conjecture for groups of the form ...
Bhowmik, Gautami   +2 more
openaire   +4 more sources

Analytical Optimal Currents for Multiphase PMSMs Under Fault Conditions and Saturation [PDF]

open access: yes, 2014
An original analytical expression is presented in this paper to obtain optimal currents minimizing the copper losses of a multi-phase Permanent Magnet Synchronous Motor (PMSM) under fault conditions.
FLIELLER, Damien   +3 more
core   +5 more sources

Home - About - Disclaimer - Privacy