Intellectual synergy is a major source of high competitive power for an organization. Through our research project, we have been developing an environment, Kfarm, to support creating/inheriting organizational intellect. Characteristic features of Kfarm include a Dual Loop Model which represents ideal processes of knowledge-level communication among personnel to create/inherit organizational kno...

In this paper, we focus on the organization of activities that produce graphical representations on the shared whiteboard of a CSCL system with dual interaction spaces called VMT Chat, and the ways those representations are used as interactional resources by small groups during their collaborative math problem solving work. In particular, we will investigate how actions performed in one medium ...

In this work, we consider matroid theory. After presenting three different (but equivalent) definitions of matroids, we mention some of the most important theorems of such theory. In particular, we note that every matroid has a dual matroid and that a matroid is regular if and only if it is binary and includes no Fano matroid or its dual. We show a connection between this last theorem and octon...

IT devices such as computers, tablets, smartphones as well as Internet are playing extremely important role in both work and non-work fields. Meanwhile, IT facilities also blurred the boundary between work and non-work. With the ubiquity of IT devices and Internet at workplace, organizational employees nowadays increasingly engage in online activities for personal purposes, which are not relate...

We review multilevel hierarchies under the special aspect of their potential for abstraction and grouping. Motivated by claims to ’bridge the representational gap between image and model features’ and by the growing importance of topological properties we discuss several extensions to dual graph pyramids: structural simplification should preserve important topological properties and content abs...

A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G there corresponds a circle. If two vertices are connected by an edge in G then the corresponding circles intersect with an intersection angle in (0, π) and these intersection points can be associated to the dual graph G. Two sequences of circle patterns are ...