INVESTIGATION OF IMPEDANCE-DIFFERENTIAL PROTECTION’S ALGORITHM AS A FAULT LOCATOR FOR DOUBLE-CIRCUIT TRANSMISSION LINE

This paper deals with an analysis of impedance-differential protection algorithm applied to locate faults on a double-circuit transmission line. In particular, the study of fault location accuracy for the case of using the relation between currents for negative-sequence not for zero-sequence, as it was presented so far, is provided. It results from the well-known fact that zero-sequence impedances are in practice considered as quite unreliable data. Therefore, one has to limit usage of zero-sequence impedance parameters as much as possible. Such approach was applied in this paper and therefore the use of the additional relation of currents for negative-sequence is under investigation. The fault signals from ATP-EMTP simulation on the sample double-circuit transmission line was applied for evaluating the fault location accuracy. References 8, figures 4, table 1.

Being and Ground

This chapter focuses on grounding. In what sense might grounding be primitive? Perhaps conceptually or methodologically, but not metaphysically. Several ways of defining up a relation of grounding in terms of some kind of ontological superiority plus other connecting relations are explored. The chapter argues that the grounding pluralist, who accepts many metaphysically important grounding relations, and the grounding monist have reasons to believe in an additional relation of ontological superiority. The pluralist does because she needs to account for the unity of the generic relation of ground; it is not a mere disjunction, and so it is either a determinable or an analogous property. But these distinctions were accounted for in terms of naturalness, which is a kind of ontological superiority. The monist about grounding needs some way to defuse grounding variantism, a view analogous to quantifier variantism, and here again appealing to naturalness does the job.

Intrinsic bounds on complexity and definability at limit levels

We show that for every computable limit ordinal α, there is a computable structure that is categorical, but not relatively categorical (equivalently, it does not have a formally Scott family). We also show that for every computable limit ordinal α, there is a computable structure with an additional relation R that is intrinsically on , but not relatively intrinsically on (equivalently, it is not definable by a computable Σα formula with finitely many parameters). Earlier results in [7], [10], and [8] establish the same facts for computable successor ordinals α.

Free products of locally indicable groups with a single relator

The method of proof of Magnus introduced in 1930 is adapted to prove the following theorem of Howie. If A and B are groups for which every finitely generated subgroup has an infinite cyclic image, and if one adds an additional relation (with obvious exceptions), then in the resultant group both A and B appear isomorphically.