14,052 research outputs found

    The BOSS system for on-line submission and assessment of computing assignments

    Get PDF
    Practical computing courses which involve significant amounts of programming continue to suffer from increasing student numbers. This makes their delivery and management more difficult to achieve effectively with the available resources. One solution to this problem is to develop methods for automating the submission and testing of student programs to support the marking effort and to enable the division of marking tasks among several individuals while ensuring consistency and rigour throughout. We have developed such methods in our system, called BOSS, and have successfully deployed different versions of it on several courses over a number of years. Here, we describe the original system and its recent enhancements, and discuss the benefits it has provided us with, both in terms of administration and in improving the learning process

    On the number of transversals in a class of Latin squares

    No full text
    Denote by Apk\mathcal{A}_p^k the Latin square of order n=pkn=p^k formed by the Cayley table of the additive group (Zpk,+)(\mathbb{Z}_p^k,+), where pp is an odd prime and kk is a positive integer. It is shown that for each pp there exists Q>0Q>0 such that for all sufficiently large kk, the number of transversals in Apk\mathcal{A}_p^k exceeds (nQ)np(p1)(nQ)^{\frac{n}{p(p-1)}}

    Good potentials for almost isomorphism of countable state Markov shifts

    Full text link
    Almost isomorphism is an equivalence relation on countable state Markov shifts which provides a strong version of Borel conjugacy; still, for mixing SPR shifts, entropy is a complete invariant of almost isomorphism. In this paper, we establish a class of potentials on countable state Markov shifts whose thermodynamic formalism is respected by almost isomorphism

    Almost isomorphism for countable state Markov shifts

    Full text link
    Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamical systems. In this paper, we investigate their almost isomorphism and entropy conjugacy and obtain a complete classification for the especially important class of strongly positive recurrent Markov shifts. This gives a complete classification up to entropy conjugacy of the natural extensions of smooth entropy expanding maps, including all smooth interval maps with non-zero topological entropy
    corecore