Beyond TRIPS: Why the WTO's Doha Round is Unhealthy

OA Monitor ExerciseOA Monitor ExerciseOA Monitor ExerciseThe current round of World Trade Organization (wto) negotiations—the Doha Round—has significant implications for global health which have received insufficient attention from the global health community. All too often the health implications of global trade agreements are examined only after their conclusion, and are concerned only with intellectual property rights. This paper seeks to move beyond this narrow focus and elucidate the wider health implications of the Doha Round. It explores the negative effect of the Round on state capacity to provide and regulate health services in low-income countries, and the impact it will have on livelihoods among the poor and their ability to access health services. Overall the paper makes the case for greater engagement from the health community with the wto and the Doha Round negotiations beyond the customary focus on intellectual property rights

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

Pre/post conditioned slicing

Th paper shows how analysis of programs in terms of pre- and postconditions can be improved using a generalisation of conditioned program slicing called pre/post conditioned slicing. Such conditions play an important role in program comprehension, reuse, verification and reengineering. Fully automated analysis is impossible because of the inherent undecidability of pre- and post- conditions. The method presented reformulates the problem to circumvent this. The reformulation is constructed so that programs which respect the pre- and post-conditions applied to them have empty slices. For those which do not respect the conditions, the slice contains statements which could potentially break the conditions. This separates the automatable part of the analysis from the human analysis

VADA: A transformation-based system for variable dependence analysis

Variable dependence is an analysis problem in which the aim is to determine the set of input variables that can affect the values stored in a chosen set of intermediate program variables. This paper shows the relationship between the variable dependence analysis problem and slicing and describes VADA, a system that implements variable dependence analysis. In order to cover the full range of C constructs and features, a transformation to a core language is employed Thus, the full analysis is required only for the core language, which is relatively simple. This reduces the overall effort required for dependency analysis. The transformations used need preserve only the variable dependence relation, and therefore need not be meaning preserving in the traditional sense. The paper describes how this relaxed meaning further simplifies the transformation phase of the approach. Finally, the results of an empirical study into the performance of the system are presented

Fighting HIV/AIDS: Reconfiguring the State?

The author wishes to thank the anonymous reviewers of the article and the ESRC for funding part of this research

Extraction of the electron mass from gg factor measurements on light hydrogenlike ions

The determination of the electron mass from Penning-trap measurements with $^{12}$C$^{5+}$ ions and from theoretical results for the bound-electron $g$ factor is described in detail. Some recently calculated contributions slightly shift the extracted mass value. Prospects of a further improvement of the electron mass are discussed both from the experimental and from the theoretical point of view. Measurements with $^4$He$^+$ ions will enable a consistency check of the electron mass value, and in future an improvement of the $^4$He nuclear mass and a determination of the fine-structure constant

ConSUS: A light-weight program conditioner

Program conditioning consists of identifying and removing a set of statements which cannot be executed when a condition of interest holds at some point in a program. It has been applied to problems in maintenance, testing, re-use and re-engineering. All current approaches to program conditioning rely upon both symbolic execution and reasoning about symbolic predicates. The reasoning can be performed by a ‘heavy duty’ theorem prover but this may impose unrealistic performance constraints. This paper reports on a lightweight approach to theorem proving using the FermaT Simplify decision procedure. This is used as a component to ConSUS, a program conditioning system for the Wide Spectrum Language WSL. The paper describes the symbolic execution algorithm used by ConSUS, which prunes as it conditions. The paper also provides empirical evidence that conditioning produces a significant reduction in program size and, although exponential in the worst case, the conditioning system has low degree polynomial behaviour in many cases, thereby making it scalable to unit level applications of program conditioning

Practical Combinatorial Interaction Testing: Empirical Findings on Efficiency and Early Fault Detection

Combinatorial interaction testing (CIT) is important because it tests the interactions between the many features and parameters that make up the configuration space of software systems. Simulated Annealing (SA) and Greedy Algorithms have been widely used to find CIT test suites. From the literature, there is a widely-held belief that SA is slower, but produces more effective tests suites than Greedy and that SA cannot scale to higher strength coverage. We evaluated both algorithms on seven real-world subjects for the well-studied two-way up to the rarely-studied six-way interaction strengths. Our findings present evidence to challenge this current orthodoxy: real-world constraints allow SA to achieve higher strengths. Furthermore, there was no evidence that Greedy was less effective (in terms of time to fault revelation) compared to SA; the results for the greedy algorithm are actually slightly superior. However, the results are critically dependent on the approach adopted to constraint handling. Moreover, we have also evaluated a genetic algorithm for constrained CIT test suite generation. This is the first time strengths higher than 3 and constraint handling have been used to evaluate GA. Our results show that GA is competitive only for pairwise testing for subjects with a small number of constraints