Given a prime power q, define c (q) as the minimum cardinality of a subset H of F 3 q which satisfies the following property: every vector in this space di ff ers in at most 1 coordinate from a multiple of a vector in H. ...

Abstract. A systematic study on approximation operators in covering based rough sets and some relations with relation based rough sets are presented. Two different frameworks of approximation operators in covering based ...

We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a set of colours (instead of just one colour). We give bounds for ...

We show that there exists a correspondence between the equivalence classes of coverings of a polyhedron and the equivalence classes of coverings of its poset of simplices. The same is true for a poset and its order complex. ...

In this paper, a methodology based on Unconstrained Binary Programming (UBP) model and Genetic Algorithms (GAs) is proposed for estimating fault sections in automated distribution substations. The UBP model, established ...

In this paper, a methodology based on Unconstrained Binary Programming (UBP) model and Genetic Algorithms (GAs) is proposed for estimating fault sections in automated distribution substations. The UBP model, established ...

For a finite dimensional connected Lie group G with Lie algebra g, we consider a Lie-generating Lie wedge W [...] g. If S is a Lie subsemigroup of G with subtangent wedge W we give sufficient conditions for S to be free ...