condition monitoring of bldc motors due to their important applications is gaining more and more significance. rotor eccentricity is one of the most important sources of faults in these motors. up to now, detection methods of this fault under nonstationary conditions are limited to complicated and time-consuming methods using wavelets and cohen class algorithms which are difficult to implement ...

Even if a mesh is valid and all of the elements are approximately the same size, the quality, as measured by parameters such as aspect ratio, skew, and Jacobian quality metrics, may be poor. Theoretically, the FE solution should approach the exact solution as the size of the largest element approaches zero. It has been demonstrated, however, that if dihedral angles approach π as the element siz...

We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest permissible time step. A bound expressed in terms of the ratio of the diagonal entries of the stiffness and mass matrices is shown to be tight within a small fa...

The notation "" for OR is bad and misleading. Just think that in the context of boolean functions, the author uses  instead of ∨.The integers modulo 2, that is Z2  0,1, have an addition where 1  1  0 while 1 ∨ 1  1. A set A is partially ordered by a binary relation ≤, if this relation is reflexive, that is a ≤ a holds for every element a ∈ S, it is transitive, that is if a ≤ b and b ≤ c...

Let v ( k , λ ) be the maximum number of vertices a connected -regular graph with second largest eigenvalue at most . The Alon-Boppana Theorem implies that is finite when > 2 + 4 In this paper, we show for fixed ≥ 1 there exists constant C such ≤

The inspiration for this paper is a result proved by Michael Smyth which states that Gordon Plotkin's category SFP is the largest cartesian closed category of domains. Although this category is easily enough motivated from concepts in domain theory and category theory, it is clearly harder to describe and less \elementary" than the most popular categories of domains for denotational semantics. ...