Psychological and pedagogical foundations for a computer-based learning environment with a language-deficient domain

In a language-deficient domain such as buoyancy, students generally find it difficult to explain phenomena that daily saturate their lives such as sinking and floating. To address this problem, we propose a simple and object-related articulation and reflection tool which is embedded in the BSL System (B stands for Body while S and L are for String and Liquid respectively). An analysis of the findings reveals that generally, the use of the tool decreased with respect to time. Evidence also shows that contents in the tool is either adapted or misused. Finally, evidence suggests positive changes in students’ conceptual knowledge of B and S but not L

An expressive hybrid model for the composition of cardinal directions

In our previous paper (Kor and Bennett, 2003), we have shown how the nine tiles in the projection-based model for cardinal directions can be partitioned into sets based on horizontal and vertical constraints (called Horizontal and Vertical Constraints Model). In order to come up with an expressive hybrid model for direction relations between two-dimensional single-piece regions (without holes), we integrate the well-known RCC-8 model with the above-mentioned model. From this expressive hybrid model, we derive 8 atomic binary relations and 13 feasible as well as jointly exhaustive relations for the x and y directions respectively. Based on these atomic binary relations, we derive two separate 8x8 composition tables for both the expressive and weak direction relations. We introduce a formula that can be used for the computation of the composition of expressive and weak direction relations between ‘whole or part’ regions. Lastly, we also show how the expressive hybrid model can be used to make several existential inferences that are not possible for existing models

A Hybrid Reasoning Model for “Whole and Part” Cardinal Direction Relations

We have shown how the nine tiles in the projection-based model for cardinal directions can be partitioned into sets based on horizontal and vertical constraints (called Horizontal and Vertical Constraints Model) in our previous papers (Kor and Bennett, 2003 and 2010). In order to come up with an expressive hybrid model for direction relations between two-dimensional single-piece regions (without holes), we integrate the well-known RCC-8 model with the above-mentioned model. From this expressive hybrid model, we derive 8 basic binary relations and 13 feasible as well as jointly exhaustive relations for the x- and y-directions, respectively. Based on these basic binary relations, we derive two separate composition tables for both the expressive and weak direction relations. We introduce a formula that can be used for the computation of the composition of expressive and weak direction relations between “whole or part” regions. Lastly, we also show how the expressive hybrid model can be used to make several existential inferences that are not possible for existing models

Composition for cardinal directions by decomposing horizontal and vertical constraints

In this paper, we demonstrate how to group the nine cardinal directions into sets and use them to compute a composition table. Firstly, we define each cardinal direction in terms of a certain set of constraints. This is followed by decomposing the cardinal directions into sets corresponding to the horizontal and vertical constraints. We apply two different techniques to compute the composition of these sets. The first technique is an algebraic computation while the second is the typical technique of reasoning with diagrams. The rationale of applying the latter is for confirmation purposes. The use of typical composition tables for existential inference is rarely demonstrated. Here, we shall demonstrate how to use the composition table to answer queries requiring the common forward reasoning as well as existential inference. Also, we combine mereological and cardinal direction relations to create a hybrid model which is more expressive

A survey of epistemology and its implications on an organisational information and knowledge management model

This is a theoretical paper which aims to integrate various epistemologies from the philosophical, knowledge management, cognitive science, and educational perspectives. From a survey of knowledge-related literature, we have collated diverse views of knowledge. This is followed by categorising as well as ascribing attributes to the different types of knowledge. We have developed a novel Organisational Information and Knowledge Management Model which seeks to clarify the distinctions between information and knowledge by introducing a novel information and knowledge conversions; followed by providing mechanisms for individual knowledge creation and information sharing within an organisation

Pictorial Socratic dialogue and conceptual change

Counter-examples used in a Socratic dialogue aim to provoke reflection to effect conceptual changes. However, natural language forms of Socratic dialogues have their limitations. To address this problem, we propose an alternative form of Socratic dialogue called the pictorial Socratic dialogue. A Spring Balance System has been designed to provide a platform for the investigation of the effects of this pedagogy on conceptual changes. This system allows learners to run and observe an experiment. Qualitative Cartesian graphs are employed for learners to represent their solutions. Indirect and intelligent feedback is prescribed through two approaches in the pictorial Socratic dialogue which aim to provoke learners probe through the perceptual structural features of the problem and solution, into the deeper level of the simulation where Archimedes’ Principle governs

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Garay et al. \cite{GKP98,KP98} devised an algorithm with running time $O(D + \sqrt{n} \cdot \log^* n)$, where $D$ is the hop-diameter of the input $n$-vertex $m$-edge graph, and with message complexity $O(m + n^{3/2})$. Peleg and Rubinovich \cite{PR99} showed that the running time of the algorithm of \cite{KP98} is essentially tight, and asked if one can achieve near-optimal running time **together with near-optimal message complexity**. In a recent breakthrough, Pandurangan et al. \cite{PRS16} answered this question in the affirmative, and devised a **randomized** algorithm with time $\tilde{O}(D+ \sqrt{n})$ and message complexity $\tilde{O}(m)$. They asked if such a simultaneous time- and message-optimality can be achieved by a **deterministic** algorithm. In this paper, building upon the work of \cite{PRS16}, we answer this question in the affirmative, and devise a **deterministic** algorithm that computes MST in time $O((D + \sqrt{n}) \cdot \log n)$, using $O(m \cdot \log n + n \log n \cdot \log^* n)$ messages. The polylogarithmic factors in the time and message complexities of our algorithm are significantly smaller than the respective factors in the result of \cite{PRS16}. Also, our algorithm and its analysis are very **simple** and self-contained, as opposed to rather complicated previous sublinear-time algorithms \cite{GKP98,KP98,E04b,PRS16}