Rabbits, stoats and the predator problem: Why a strong animal rights position need not call for human intervention to protect prey from predators

Animal rights positions face the ‘predator problem’: the suggestion that if the rights of nonhuman animals are to be protected, then we are obliged to interfere in natural ecosystems to protect prey from predators. Generally, rather than embracing this conclusion, animal ethicists have rejected it, basing this objection on a number of different arguments. This paper considers but challenges three such arguments, before defending a fourth possibility. Rejected are Peter Singer’s suggestion that interference will lead to more harm than good, Sue Donaldson and Will Kymlicka’s suggestion that respect for nonhuman sovereignty necessitates non-interference in normal circumstances, and Alasdair Cochrane’s solution based on the claim that predators cannot survive without killing prey. The possibility defended builds upon Tom Regan’s suggestion that predators, as moral patients but not moral agents, cannot violate the rights of their prey, and so the rights of the prey, while they do exist, do not call for intervention. This idea is developed by a consideration of how moral agents can be more or less responsible for a given event, and defended against criticisms offered by thinkers including Alasdair Cochrane and Dale Jamieson.

A Scalable General Purpose System for Large-Scale Graph Processing

Graph analytics is an important and computationally demanding class of data analytics. It is essential to balance scalability, ease-of-use and high performance in large scale graph analytics. As such, it is necessary to hide the complexity of parallelism, data distribution and memory locality behind an abstract interface. The aim of this work is to build a scalable graph analytics framework that does not demand significant parallel programming experience based on NUMA-awareness.
The realization of such a system faces two key problems:
(i)~how to develop a scale-free parallel programming framework that scales efficiently across NUMA domains; (ii)~how to efficiently apply graph partitioning in order to create separate and largely independent work items that can be distributed among threads.