A tight lower bound for job scheduling with cancellation

Abstract The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a tight lower bound of 5 for the competitive ratio of any deterministic online algorithm for this problem, for the case where all jobs have the same processing time

Confidentiality and public protection: ethical dilemmas in qualitative research with adult male sex offenders

This paper considers the ethical tensions present when engaging in in-depth interviews with convicted sex offenders. Many of the issues described below are similar to those found in other sensitive areas of research. However, confidentiality and public protection are matters that require detailed consideration when the desire to know more about men who have committed serious and harmful offences is set against the possibility of a researcher not disclosing previously unknown sensitive information that relates to the risk of someone being harmed.</p