282 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

    Establishing norms with metanorms over interaction topologies

    Get PDF
    Norms are a valuable means of establishing coherent cooperative behaviour in decentralised systems in which there is no central authority. Axelrod’s seminal model of norm establishment in populations of self-interested individuals provides some insight into the mechanisms needed to support this through the use of metanorms, but considers only limited scenarios and domains. While further developments of Axelrod’s model have addressed some of the limitations, there is still only limited consideration of such metanorm models with more realistic topological configurations. In response, this paper tries to address such limitation by considering its application to different topological structures. Our results suggest that norm establishment is achievable in lattices and small worlds, while such establishment is not achievable in scale-free networks, due to the problematic effects of hubs. The paper offers a solution, first by adjusting the model to more appropriately reflect the characteristics of the problem, and second by offering a new dynamic policy adaptation approach to learning the right behaviour. Experimental results demonstrate that this dynamic policy adaptation overcomes the difficulties posed by the asymmetric distribution of links in scale-free networks, leading to an absence of norm violation, and instead to norm emergence

    Hydrochloric acid modification and lead removal studies on naturally occurring zeolites from Nevada, New Mexico, and Arizona

    Get PDF
    Four naturally occurring zeolites were examined to verify their assignments as chabazites AZLB-Ca and AZLB-Na (Bowie, Arizona) and clinoptilolites NM-Ca (Winston, New Mexico) and NV-Na (Ash Meadows, Nevada). Based on powder X-ray diffraction, NM-Ca was discovered to be mostly quartz with some clinoptilolite residues. Treatment with concentrated HCl (12.1 M) acid resulted in AZLB-Ca and AZLB-Na, the chabazite-like species, becoming amorphous, as confirmed by powder X-ray diffraction. In contrast, NM-Ca and NV-Na, which are clinoptilolite-like species, withstood boiling in concentrated HCl acid. This treatment removes calcium, magnesium, sodium, potassium, aluminum, and iron atoms or ions from the framework while leaving the silicon framework intact as confirmed via X-ray fluorescence and diffraction. SEM images on calcined and HCl treated NV-Na were obtained. BET surface area analysis confirmed an increase in surface area for the two zeolites after treatment, NM-Ca 20.0(1) to 111(4) m2/g and NV-Na 19.0(4) to 158(7) m2/g.29Si and27Al MAS NMR were performed on the natural and treated NV-Na zeolite, and the data for the natural NV-Na zeolite suggested a Si:Al ratio of 4.33 similar to that determined by X-Ray fluorescence of 4.55. Removal of lead ions from solution decreased from the native NM-Ca, 0.27(14), NVNa, 1.50(17) meq/g compared to the modified zeolites, 30 min HCl treated NM-Ca 0.06(9) and NVNa, 0.41(23) meq/g, and also decreased upon K+ ion pretreatment in the HCl modified zeolites

    Establishing norms with metanorms in distributed computational systems

    Get PDF
    Norms provide a valuable mechanism for establishing coherent cooperative behaviour in decentralised systems in which there is no central authority. One of the most influential formulations of norm emergence was proposed by Axelrod (Am Political Sci Rev 80(4):1095–1111, 1986). This paper provides an empirical analysis of aspects of Axelrod’s approach, by exploring some of the key assumptions made in previous evaluations of the model. We explore the dynamics of norm emergence and the occurrence of norm collapse when applying the model over extended durations . It is this phenomenon of norm collapse that can motivate the emergence of a central authority to enforce laws and so preserve the norms, rather than relying on individuals to punish defection. Our findings identify characteristics that significantly influence norm establishment using Axelrod’s formulation, but are likely to be of importance for norm establishment more generally. Moreover, Axelrod’s model suffers from significant limitations in assuming that private strategies of individuals are available to others, and that agents are omniscient in being aware of all norm violations and punishments. Because this is an unreasonable expectation , the approach does not lend itself to modelling real-world systems such as online networks or electronic markets. In response, the paper proposes alternatives to Axelrod’s model, by replacing the evolutionary approach, enabling agents to learn, and by restricting the metapunishment of agents to cases where the original defection is observed, in order to be able to apply the model to real-world domains . This work can also help explain the formation of a “social contract” to legitimate enforcement by a central authority

    Tractor hydraulic power data acquisition system

    Get PDF
    Tractor hydraulic power is used on a wide range of agricultural implements; however, the availability of operational hydraulic data at points other than full engine throttle position is limited. Operators could utilize this hydraulic data to maximize field efficiency and minimize machinery costs when determining suitable machinery for field operations. A field usable hydraulic test apparatus capable of measuring tractor hydraulic pressure and flow rate data was developed. The goal of this study was to determine if a hydraulic flow and pressure measurement device could be installed on the rear of a tractor to provide implement hydraulic power consumption at different hydraulic hose orientations. The measurement system installed allowed hydraulic lines from the tractor hydraulic remote ports to be attached to the flowmeter and pressure sensors at multiple angles of 0°, 45°, and 90° in different configuration layouts. Tests were performed at different flows and pressures for each hose configuration. The pressures were compared across configurations to a base line reading from a hydraulic pressure and flow rate measurement apparatus used by the Nebraska Tractor Test Laboratory (NTTL). Pressure deviations from the base line were small and ranged between 10.56 kPa and 32.2 kPa. Flow rate differences (\u3c167 mL min–1) were determined to be negligible (\u3c0.5%). Calculated power differences (\u3c33 W) were less than 1% full scale power measured. This small power loss suggested that using the hydraulic measurement apparatus developed as part of this study would enable accurate measurements of tractor hydraulic power provided to implements regardless of hydraulic hose bend angles

    Using reputation and adaptive coalitions to support collaboration in competitive environments

    Get PDF
    Internet-based scenarios, like co-working, e-freelancing, or crowdsourcing, usually need supporting collaboration among several actors that compete to service tasks. Moreover, the distribution of service requests, i.e., the arrival rate, varies over time, as well as the service workload required by each customer. In these scenarios, coalitions can be used to help agents to manage tasks they cannot tackle individually. In this paper we present a model to build and adapt coalitions with the goal of improving the quality and the quantity of tasks completed. The key contribution is a decision making mechanism that uses reputation and adaptation to allow agents in a competitive environment to autonomously enact and sustain coalitions, not only its composition, but also its number, i.e., how many coalitions are necessary. We provide empirical evidence showing that when agents employ our mechanism it is possible for them to maintain high levels of customer satisfaction. First, we show that coalitions keep a high percentage of tasks serviced on time despite a high percentage of unreliable workers. Second, coalitions and agents demonstrate that they successfully adapt to a varying distribution of customers' incoming tasks. This occurs because our decision making mechanism facilitates coalitions to disband when they become non-competitive, and individual agents detect opportunities to start new coalitions in scenarios with high task demand. © 2015 Elsevier Ltd. All rights reserved.The first author thanks the grant Formación de Profesorado Universitario (FPU), reference AP2010-1742. Arcos and Rodriguez-Aguilar thank projects COR (TIN2012-38876-C02-01/02) and Generalitat of Catalunya (2014 SGR-118). Work supported by the European Regional Development Fund (ERDF) and the Galician Regional Government under agreement for funding the Atlantic Research Center for Information and Communication Technologies (AtlantTIC)Peer Reviewe

    Aperiodic Ising Quantum Chains

    Full text link
    Some years ago, Luck proposed a relevance criterion for the effect of aperiodic disorder on the critical behaviour of ferromagnetic Ising systems. In this article, we show how Luck's criterion can be derived within an exact renormalisation scheme for Ising quantum chains with coupling constants modulated according to substitution rules. Luck's conjectures for this case are confirmed and refined. Among other outcomes, we give an exact formula for the correlation length critical exponent for arbitrary two-letter substitution sequences with marginal fluctuations of the coupling constants.Comment: 27 pages, LaTeX, 1 Postscript figure included, using epsf.sty and amssymb.sty (one error corrected, some minor changes

    Invaded cluster algorithm for critical properties of periodic and aperiodic planar Ising models

    Full text link
    We demonstrate that the invaded cluster algorithm, recently introduced by Machta et al, is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising models in two dimensions. The algorithm is shown to reproduce the known values of the critical temperature on various periodic and quasiperiodic graphs with an accuracy of more than three significant digits. On two quasiperiodic graphs which were not investigated in this respect before, the twelvefold symmetric square-triangle tiling and the tenfold symmetric T\"ubingen triangle tiling, we determine the critical temperature. Furthermore, a generalization of the algorithm to non-identical coupling strengths is presented and applied to a class of Ising models on the Labyrinth tiling. For generic cases in which the heuristic Harris-Luck criterion predicts deviations from the Onsager universality class, we find a magnetic critical exponent different from the Onsager value. But also notable exceptions to the criterion are found which consist not only of the exactly solvable cases, in agreement with a recent exact result, but also of the self-dual ones and maybe more.Comment: 15 pages, 5 figures; v2: Fig. 5b replaced, minor change
    corecore