Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. The method is based on regular equivalence in graphs and uses spectral properties of a bipartite adjacency matrix to estimate similarity in both d...

We present the beginnings of an account of how representations and processes developed for the purposes of reflective reasoning provide a basis for reflexive reasoning as well. Specifically, we show how the symbolic-connectionist representations that underlie the DORA model (Doumas & Hummel, 2005), and the comparison based routines that DORA exploits in the service of addressing reflective prob...

The article discusses the definition of reflection as an activity and examines main factors that determine kinds reflection. According to author article, can be defined by following formula: direction attention EXPERIENCE for “detection” its FORMS their fixation means certain SEMIOTIC TOOLS carried out sake achieving some PURPOSE. In this formulation, terms “experience”, “form”, “semiotic tools...

We show that there exists a separable reflexive Banach space into which every separable uniformly convex Banach space isomorphically embeds. This solves a problem of J. Bourgain. We also give intrinsic characterizations of separable reflexive Banach spaces which embed into a reflexive space with a block q-Hilbertian and/or a block p-Besselian finite dimensional decomposition.

We study reflexive modules over one dimensional Cohen-Macaulay rings. Our key technique exploits the concept of I I -Ulrich modules.