This paper provides an assessment of the most recent empirical research into the effectiveness of argument visualization tools. In particular, the methodological quality of the reported experiments and the conclusions drawn from them are critically examined. Their validity is determined and the methodological differences between them are clarified. The discrepancies in intended effects of use e...

We give an argument for deriving analytically the infrared “Abelian” dominance in a gauge invariant way for the Wilson loop average in SU(2) Yang– Mills theory. In other words, we propose a possible mechanism for realizing the dynamical Abelian projection in the SU(2) gauge-invariant manner without breaking color symmetry. This supports validity of the dual superconductivity picture for quark c...

Recently, a simple scaling argument was introduced that allows us to map, with some precautions, Brownian and Monte Carlo dynamics for spherical particles. Here, we extend the scaling to study systems that have orientational degrees of freedom and carefully asses its validity over a wide region of temperature and density. Our work allows us to devise a Brownian Monte Carlo algorithm that produc...

Problem solving has been increasingly used as an important approach to learning especially in ill-structured domains. It is assumed that knowledge can be better consolidated and extended through problem-solving experience. However, many learners do not have the ability to separate general knowledge from specific cases, which inhibits successful transfer of knowledge to new situations. This stud...

Understanding an utterance in an argument crucially requires determining the evidential relations it bears to prior and subsequent propositions in the argument (Birnbaum et al., 1980; Cohen, 1981). The memory representation of an argument should, accordingly, indicate which propositions a given proposition counts as evidence for (a support relation) or against (an attack relation), and which pr...

In this paper we consider hot-potato packet routing on trees. As a lower bound, for all sufficiently large n we construct a permutation routing problem on an n-node tree for which an oblivious greedy hot-potato algorithm requires at least 2n o(n) time steps. This lower bound is also valid for the minimumdistance heuristic. Applying the charging argument of Borodin et al. [8] we establish that a...

By way of conclusion to Rethinking Maps we want to set out a manifesto for map studies for the coming decade. Its goal is to generate ideas and enthusiasm for scholarship that advances our understanding of the philosophical underpinnings of maps, and also enhances the practices of mapping. This is not a call for ever more introspective intellectual navel gazing about maps. Instead it traces rou...