The starting point of the paper is the (well-known)observation that the “classical” Rough Set Theory as introduced by PAWLAK is equivalent to the S5 Propositional Modal Logic where the reachability relation is an equivalence relation. By replacing this equivalence relation by an arbitrary binary relation (satisfying certain properties, for instance, reflexivity and transitivity) we shall obtain...

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another ...

Editorial Summary In her contribution »Reflexive, Reflexivity, and the Concept of Reflexive Design« Margitta Buchert frames notion reflexive design research, pitting various underlying concepts against one another forming framework for research. As such, she emphasizes punctuated distinction reflection as an integrated component research reflexion alignment attitude. this sense highlights recip...

Reflexive saccades (fast eye movements) and voluntary saccades activate overlapping parts of the oculomotor system. It is assumed that striatal dopamine depletion in Parkinson's disease (PD) only affects the voluntary saccadic system and that the often-reported facilitation of the reflexive saccadic system in PD is secondary to impairment of the voluntary saccadic system. If this assumption is ...

An iterative algorithm is constructed to solve the linear matrix equation pair AXB E, CXD F over generalized reflexive matrix X. When the matrix equation pair AXB E, CXD F is consistent over generalized reflexive matrix X, for any generalized reflexive initial iterative matrix X1, the generalized reflexive solution can be obtained by the iterative algorithm within finite iterative steps in the ...

We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unordered or ordered and not necessarily carrying the same labels. The trees to be compared are first represented in the form of matrices whose entries are in the interval [O,1] and the actual comparison strategy then relies...