This paper presents a study to estimate the composition of an electric load, i.e. to determine the amount of each load class by the direct measurements of the total electric current waveform from instrument reading. Kalman filter algorithm is applied to estimate the electric load composition on a consumer side of a distributed power system. The electric load supplied from the different voltage ...

A graph is Y Y-reducible if it can be reduced to a vertex by a sequence of series-parallel reductions and Y Y-transformations. Terminals are distinguished vertices which cannot be deleted by reductions and transformations. In this paper we show that four-terminal planar graphs are Y Y-reducible when at least three of the vertices lie on the same face. Using this result we characterize Y Y-reduc...

Recently, the industry is more and more interested in fractional slot concentrated windings (FSCW), because of many advantages such as high power density and low manufacturing costs. Novel FSCWs often consist of several winding systems. This structure allows the creation of good MMF distributions with low space harmonic contents and reduces undesirable side effects, such as localized core satur...

This paper provides a new approach for power flow and modeling analysis of three phase unbalanced radial distribution systems (URDS) using the simple forward/backward sweep-based algorithm. A three phase load flow solution is proposed considering voltage regulator and transformer with detailed load modeling, for the transformer modeling symmetrical components theory is used and zero sequence-vo...

This chapter presents some key concepts relevant to an understanding of psychobiological and psychosocial processes in health and illness. Although the focus of this book is on psychobiological processes, the two are very closely related, so it is important to acknowledge the role of psychosocial processes before proceeding further. The biopsychosocial model of health is introduced and contrast...

Let Δ ≥ 1 and δ ≥ 0 be real numbers. A tree T = (V,E′) is a distance (Δ, δ)–approximating tree of a graph G = (V,E) if dH(u, v) ≤ Δ dG(u, v) + δ and dG(u, v) ≤ Δ dH(u, v) + δ hold for every u, v ∈ V . The distance (Δ, δ)-approximating tree problem asks for a given graph G to decide whether G has a distance (Δ, δ)-approximating tree. In this paper, we consider unweighted graphs and show that the...

The goal of the present paper is study some algebraic invariants Stanley–Reisner rings Cohen–Macaulay simplicial complexes dimension d−1. We prove that inequality d≤reg(Δ)⋅type(Δ) holds for any (d−1)-dimensional complex Δ satisfying Δ=core(Δ), where reg(Δ) (resp. type(Δ)) denotes Castelnuovo–Mumford regularity type) ring k[Δ]. Moreover, given integers d,r,t r,t≥2 and r≤d≤rt, we construct a Δ(G)...