In this paper we study spaces in which each compact subset is a Gδ-set and compare them to H. W. Martin’s c-semi-stratifiable (CSS) spaces, i.e. spaces in which compact sets are Gδ-sets in a uniform way. We prove that a (countably) compact subset of a Hausdorff space X is metrizable and a Gδ-subset of X provided X has a δθ-base, or a point-countable, T1-point-separating open cover, or a quasi-G...

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...

Argument structure patterns can be used to represent classes of safety arguments. Such patterns can become quite complex, making use of loops and choices, posing a potential challenge for comprehension and evaluation, offsetting the likely gains that might follow from creating arguments using them. We show how complex patterns can be constructed by composition of simpler patterns. We provide a ...

A conjecture of V. Sós [3] is proved that any set of 34 (n 3 ) + cn2 triples from an n-set, where c is a suitable absolute constant, must contain a copy of the Fano configuration (the projective plane of order two). This is an asymptotically sharp estimate. Given a 3-uniform hypergraph F , let ex3(n,F) denote the maximum possible size of a 3-uniform hypergraph of order n that does not contain a...

Background and Aim: One of the key aspects of maternal care is observing the progress of labor. Careful assessment of labor progress could provide mothers to be referred on time and could decrease the maternal and neonatal morbidity. This study aimed to compare diagnostic accuracy of purple line with transvers diagonal of Michaelis sacral rhomboid to predict labor progress in nulliparous and mu...

In a typical communications problem, Toeplitz matrices Φ arise when modeling the task of determining an unknown impulse response a from a given probe signal φ. When a is sparse, then whenever Φ formed from the probe signal φ satisfy the Restricted Isometry Property (RIP), a can be robustly recovered from its measurements via l1-minimization. In this paper, we derived the RIP for compressive Toe...