Issues of partial credit in mathematical assessment by computer

The CALM Project for Computer Aided Learning in Mathematics has operated at Heriot‐Watt University since 1985. From the beginning CALM has featured assessment in its programs (Beevers, Cherry, Foster and McGuire, 1991), and enabled both students and teachers to view progress in formative assessment The computer can play a role in at least four types of assessment: diagnostic, self‐test, continuous and grading assessment. The TLTP project Mathwise employs the computer in three of these roles. In 1994 CALM reported on an educational experiment in which the computer was used for the first time to grade, in part, the learning of a large class of service mathematics students (Beevers, McGuire, Stirling and Wild ,1995), using the Mathwise assessment template. At that time the main issues identified were those of ‘partial credit’ and communication between the student and the computer. These educational points were addressed in the next phase of the CALM Project in which the commercial testing program Interactive PastPapers was developed. The main aim of this paper is to describe how Interactive Past Papers has been able to incorporate some approaches to partial credit which has helped to alleviate student worries on these issues. Background information on other features in Interactive Past Papers is also included to provide context for the discussion

Analysis of pivot sampling in dual-pivot Quicksort: A holistic analysis of Yaroslavskiy's partitioning scheme

The final publication is available at Springer via http://dx.doi.org/10.1007/s00453-015-0041-7The new dual-pivot Quicksort by Vladimir Yaroslavskiy-used in Oracle's Java runtime library since version 7-features intriguing asymmetries. They make a basic variant of this algorithm use less comparisons than classic single-pivot Quicksort. In this paper, we extend the analysis to the case where the two pivots are chosen as fixed order statistics of a random sample. Surprisingly, dual-pivot Quicksort then needs more comparisons than a corresponding version of classic Quicksort, so it is clear that counting comparisons is not sufficient to explain the running time advantages observed for Yaroslavskiy's algorithm in practice. Consequently, we take a more holistic approach and give also the precise leading term of the average number of swaps, the number of executed Java Bytecode instructions and the number of scanned elements, a new simple cost measure that approximates I/O costs in the memory hierarchy. We determine optimal order statistics for each of the cost measures. It turns out that the asymmetries in Yaroslavskiy's algorithm render pivots with a systematic skew more efficient than the symmetric choice. Moreover, we finally have a convincing explanation for the success of Yaroslavskiy's algorithm in practice: compared with corresponding versions of classic single-pivot Quicksort, dual-pivot Quicksort needs significantly less I/Os, both with and without pivot sampling.Peer ReviewedPostprint (author's final draft

Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm

There is excitement within the algorithms community about a new partitioning method introduced by Yaroslavskiy. This algorithm renders Quicksort slightly faster than the case when it runs under classic partitioning methods. We show that this improved performance in Quicksort is not sustained in Quickselect; a variant of Quicksort for finding order statistics. We investigate the number of comparisons made by Quickselect to find a key with a randomly selected rank under Yaroslavskiy's algorithm. This grand averaging is a smoothing operator over all individual distributions for specific fixed order statistics. We give the exact grand average. The grand distribution of the number of comparison (when suitably scaled) is given as the fixed-point solution of a distributional equation of a contraction in the Zolotarev metric space. Our investigation shows that Quickselect under older partitioning methods slightly outperforms Quickselect under Yaroslavskiy's algorithm, for an order statistic of a random rank. Similar results are obtained for extremal order statistics, where again we find the exact average, and the distribution for the number of comparisons (when suitably scaled). Both limiting distributions are of perpetuities (a sum of products of independent mixed continuous random variables).Comment: full version with appendices; otherwise identical to Algorithmica versio

Dungeness crab research program: Report for the Year 1976

All larval stages of the 1976 year class, with the exception of the 5th zoeal stage, were found in Gu1f waters January through March. The first post-larval stage was collected in San Pablo Bay in May. Fifty percent of 1976 year class crabs entered the Bay complex as compared to nearly 80% in 1975. The 1976 year class appears relatively weak. No electrophoretic polymorphism was found in Cancer magister to be of value in Dungeness crab population determinations. Multi-variate correlations comparing crab landings with an array of oceanographic parameters and the crab density dependent factor were computer-run for both northern and central California. The most significant correlating factors at the time late stage larvae prevail were sea level and atmospheric pressure for central California and, for northern California, the density dependent factor and sea surface temperature. Female crabs held at controlled temperatures indicated gonad maturation and spawning may be induced by increased temperature. Analyses of crab tissues revealed burdens of petroleum hydrocarbons, silver, selenium, cadmium, and PCB's higher in central California crabs, while DDE was found in higher amounts in northern California crab tissue. Thru-flow culture systems were developed which should yield about 163 megalopae of Dungeness crabs in 63 days from 1,200 laboratory hatched zoeae.(46pp.

Measuring Electric Fields From Surface Contaminants with Neutral Atoms

In this paper we demonstrate a technique of utilizing magnetically trapped neutral Rb-87 atoms to measure the magnitude and direction of stray electric fields emanating from surface contaminants. We apply an alternating external electric field that adds to (or subtracts from) the stray field in such a way as to resonantly drive the trapped atoms into a mechanical dipole oscillation. The growth rate of the oscillation's amplitude provides information about the magnitude and sign of the stray field gradient. Using this measurement technique, we are able to reconstruct the vector electric field produced by surface contaminants. In addition, we can accurately measure the electric fields generated from adsorbed atoms purposely placed onto the surface and account for their systematic effects, which can plague a precision surface-force measurement. We show that baking the substrate can reduce the electric fields emanating from adsorbate, and that the mechanism for reduction is likely surface diffusion, not desorption.Comment: 7 pages, 6 figures, published in Physical Review

Study of fault-tolerant software technology

Presented is an overview of the current state of the art of fault-tolerant software and an analysis of quantitative techniques and models developed to assess its impact. It examines research efforts as well as experience gained from commercial application of these techniques. The paper also addresses the computer architecture and design implications on hardware, operating systems and programming languages (including Ada) of using fault-tolerant software in real-time aerospace applications. It concludes that fault-tolerant software has progressed beyond the pure research state. The paper also finds that, although not perfectly matched, newer architectural and language capabilities provide many of the notations and functions needed to effectively and efficiently implement software fault-tolerance

Dynamical Hartree-Fock-Bogoliubov Theory of Vortices in Bose-Einstein Condensates at Finite Temperature

We present a method utilizing the continuity equation for the condensate density to make predictions of the precessional frequency of single off-axis vortices and of vortex arrays in Bose-Einstein condensates at finite temperature. We also present an orthogonalized Hartree-Fock-Bogoliubov (HFB) formalism. We solve the continuity equation for the condensate density self-consistently with the orthogonalized HFB equations, and find stationary solutions in the frame rotating at this frequency. As an example of the utility of this formalism we obtain time-independent solutions for quasi-two-dimensional rotating systems in the co-rotating frame. We compare these results with time-dependent predictions where we simulate stirring of the condensate.Comment: 13 pages, 11 figures, 1 tabl