Let Γ=(V,E) be a graph and ‎W_(‎a)={w_1,…,w_k } be a subset of the vertices of Γ and v be a vertex of it. The k-vector r_2 (v∣ W_a)=(a_Γ (v,w_1),‎…‎ ,a_Γ (v,w_k)) is the adjacency representation of v with respect to W in which a_Γ (v,w_i )=min{2,d_Γ (v,w_i )} and d_Γ (v,w_i ) is the distance between v and w_i in Γ. W_a is called as an adjacency resolving set for Γ if distinct vertices of ...

One of the purposes of consciousness is to acquire knowledge. The models of this task traditionally assume a division between the known and the knower, a division that leads into doubtful reasoning about some kind of (frequently disguised) homunculus. The current paper tries to avoid such fallacies by viewing the adaptation of the mind as an evolutionary process, a process distinct (but not ind...

To develop a theory of small-group interaction in CSCL settings, we need an approach to analyzing the structure of computer-mediated discourse. Conversation Analysis examines informal face-to-face talk in terms of a fine structure of adjacency pairs, but needs to be adapted to online textual interaction and extended to analyze longer sequences built on adjacency pairs. This paper presents a cas...

Experience with the handling of spatial data on a computer led to the identification of a variety of ‘'awkward” problems, including interpolation, error estimation and dynamic polygon building and editing. Many of the problems encountered could be classified as “‘spatial adjacency” issues. The Voronoi diagram of points and line segments in the Euclidean plane is shown to give a functional defin...

An american expert on Jewish medical ethics explained the nuances of these rules during a recent address in Ottawa. Although Jewish and secular rules concerning medical ethics often coincide, they diverge in several important areas, including the subject of patient autonomy.