The Dual Feminisation of HIV/AIDS

This is an Accepted Manuscript of an article published by Taylor & Francis in Globalizations on 2011, available online: http://wwww.tandfonline.com/10.1080/14747731.2010.49302

Analysing assessment practice: how useful is the summative/formative divide as a tool?

A view of assessment as 'naturally' divided into the categories of formative and summative has become a taken-for-granted way of thinking about, talking about and organising assessment in universities, at least in the UK where the division is inscribed in national, institutional and departmental policy and guidance (eg. Quality Assurance Agency, http://www.qaa.ac.uk). In these documents summative and formative assessment tend to be understood as serving separate purposes with summative assessment understood as summing up the level of performance and formative assessment as feeding into future learning. We question the utility of the division in terms of better understanding assessment practices on the basis of an empirical study undertaken in a higher education institution in the UK. The aim of the Assessment Environments & Cultures project is to gain a better understanding of how academics assess and why they assess in the ways that they do. Interview and observational data have been collected from academics working in three subject areas: Design, Business and Applied Sciences. Initial analysis has focussed on the discourses in use and the subject positions taken up by academics when they talk about and undertake assessment. Analysis of our data suggests that, whilst academics used the categories of formative and summative to talk about their assessment practices, the distinction between assessment purposes may be 'messier' than the separate categories imply. Various examples from the project will be introduced to illustrate this point. This raises a number of questions in terms of researching assessment practices that will be raised for discussion at the roundtable. For example:Might it be useful to understand formative and summative assessment as occupying a shared and contested space rather than as distinct categories

Pareto optimal search based refactoring at the design level.

Refactoring aims to improve the quality of a software systems’ structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be challenging, search based techniques can automatically discover useful refactorings. Current search based refactoring approaches require metrics to be combined in a complex fashion, and produce a single sequence of refactorings. In this paper we show how Pareto optimality can improve search based refactoring, making the combination of metrics easier, and aiding the presentation of multiple sequences of optimal refactorings to users

Does Long-Term Macrophyte Management in Lakes Affect Biotic Richness and Diversity?

We hypothesize that the richness and diversity of the biota in Lake Moraine (42°50’47”N, 75°31’39”W) in New York have been negatively impacted by 60 years of macrophyte and algae management to control Eurasian watermilfoil ( Myriophyllum spicatum L.) and associated noxious plants. To test this hypothesis we compare water quality characteristics, richness and selected indicators of plant diversity, zooplankton, benthic macroinvertebrates and fish in Lake Moraine with those in nearby Hatch Lake (42°50’06”N, 75°40’67”W). The latter is of similar size and would be expected to have similar biota, but has not been subjected to management. Measurements of temperature, pH, oxygen, conductivity, Secchi transparency, calcium, total phosphorus and nitrites + nitrates are comparable. Taxa richness and the diversity indices applied to the aquatic macrophytes are similar in both lakes. (PDF has 8 pages.

Heuristics in Multi-Winner Approval Voting

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote for as many candidates as they wish. Winners are chosen by tallying up the votes and choosing the top-$k$ candidates receiving the most votes. An agent may manipulate the vote to achieve a better outcome by voting in a way that does not reflect their true preferences. In complex and uncertain situations, agents may use heuristics to strategize, instead of incurring the additional effort required to compute the manipulation which most favors them. In this paper, we examine voting behavior in multi-winner approval voting scenarios with complete information. We show that people generally manipulate their vote to obtain a better outcome, but often do not identify the optimal manipulation. Instead, voters tend to prioritize the candidates with the highest utilities. Using simulations, we demonstrate the effectiveness of these heuristics in situations where agents only have access to partial information

Loop squashing transformations for amorphous slicing

Program slicing is a source code extraction technique that can be used to support reverse engineering by automatically extracting executable subprograms that preserve some aspect of the original program's semantics. Although minimal slices are not generally computable, safe approximate algorithms can be used to good effect. However, the precision of such slicing algorithms is a major factor in determining the value of slicing for reverse engineering. Amorphous slicing has been proposed as a way of reducing the size of a slice. Amorphous slices preserve the aspect of semantic interest, but not the syntax that denotes it, making them generally smaller than their syntactically restricted counterparts. Amorphous slicing is suitable for many reverse engineering applications, since reverse engineering typically abandons the existing syntax to facilitate structural improvements. Previous work on amorphous slicing has not attempted to exploit its potential to apply loop-squashing transformations. This paper presents an algorithm for amorphous slicing of loops, which identifies induction variables, transformation rule templates and iteration-determining compile-time expressions. The algorithm uses these to squash certain loops into conditional assignments. The paper also presents an inductive proof of the rule templates and illustrates the application of the algorithm with a detailed example of loop squashing