71,489 research outputs found

    Brood sow management

    Get PDF
    PDF pages:

    Police powers and human rights in the context of terrorism

    Get PDF
    Purpose – The object of the paper is to analyse the justifications for the modification of police powers in response to terrorist threats, placing this issue in a European context. Design/methodology/approach – The paper consists of a critical examination of provisions relating to terrorism emanating from the European Union and the Council of Europe (European Convention on Human Rights (ECHR)), and the relevant English law on police powers of stop and search, arrest, and detention. Findings – Nothing in European law requires the amendments to police powers contained in English law; European law requires respect for human rights, even in dealing with terrorism; a shoot-to-kill policy is prohibited by the ECHR; and balance is an unsatisfactory method of resolving conflicts in this area. Research limitations/implications – The research was limited in its scope to certain areas of police powers, and to certain fundamental European documents. Future research should consider the issue in relation to wider areas. Originality/value – It challenges the idea of balance between liberty and security, proposing a test based on necessity instead

    Volitional control of anticipatory ocular smooth pursuit after viewing, but not pursuing, a moving target: evidence for a re-afferent velocity store

    Get PDF
    Although human subjects cannot normally initiate smooth eye movements in the absence of a moving target, previous experiments have established that such movements can be evoked if the subject is required to pursue a regularly repeated, transient target motion stimulus. We sought to determine whether active pursuit was necessary to evoke such an anticipatory response or whether it could be induced after merely viewing the target motion. Subjects were presented with a succession of ramp target motion stimuli of identical velocity and alternating direction in the horizontal axis. In initial experiments, the target was exposed for only 120 ms as it passed through centre, with a constant interval between presentations. Ramp velocity was varied from +/- 9 to 45 degrees/s in one set of trials; the interval between ramp presentations was varied from 640 to 1920 ms in another. Subjects were instructed either to pursue the moving target from the first presentation or to hold fixation on another, stationary target during the first one, two or three presentations of the moving display. Without fixation, the first smooth movement was initiated with a mean latency of 95 ms after target onset, but with repeated presentations anticipatory smooth movements started to build up before target onset. In contrast, when the subjects fixated the stationary target for three presentations of the moving target, the first movement they made was already anticipatory and had a peak velocity that was significantly greater than that of the first response without prior fixation. The conditions of experiment 1 were repeated in experiment 3 with a longer duration of target exposure (480 ms), to allow higher eye velocities to build up. Again, after three prior fixations, the anticipatory velocity measured at 100 ms after target onset (when visual feedback would be expected to start) was not significantly different to that evoked after the subjects had made three active pursuit responses to the same target motion, reaching a mean of 20 degrees/s for a 50 degrees/s target movement. In a further experiment, we determined whether subjects could use stored information from prior active pursuit to generate anticipatory pursuit in darkness if there was a high expectancy that the target would reappear with identical velocity. Subjects made one predictive response immediately after target disappearance, but very little response thereafter until the time at which they expected the target to reappear, when they were again able to re-vitalize the anticipatory response before target appearance. The findings of these experiments provide evidence that information related to target velocity can be stored and used to generate future anticipatory responses even in the absence of eye movement. This suggests that information for storage is probably derived from a common pre-motor drive signal that is inhibited during fixation, rather than an efference copy of eye movement itself. Furthermore, a high level of expectancy of target appearance can facilitate the release of this stored information in darkness

    A modified parallel tree code for N-body simulation of the Large Scale Structure of the Universe

    Full text link
    N-body codes to perform simulations of the origin and evolution of the Large Scale Structure of the Universe have improved significantly over the past decade both in terms of the resolution achieved and of reduction of the CPU time. However, state-of-the-art N-body codes hardly allow one to deal with particle numbers larger than a few 10^7, even on the largest parallel systems. In order to allow simulations with larger resolution, we have first re-considered the grouping strategy as described in Barnes (1990) (hereafter B90) and applied it with some modifications to our WDSH-PT (Work and Data SHaring - Parallel Tree) code. In the first part of this paper we will give a short description of the code adopting the Barnes and Hut algorithm \cite{barh86} (hereafter BH), and in particular of the memory and work distribution strategy applied to describe the {\it data distribution} on a CC-NUMA machine like the CRAY-T3E system. In the second part of the paper we describe the modification to the Barnes grouping strategy we have devised to improve the performance of the WDSH-PT code. We will use the property that nearby particles have similar interaction list. This idea has been checked in B90, where an interaction list is builded which applies everywhere within a cell C_{group} containing a little number of particles N_{crit}. B90 reuses this interaction list for each particle pCgroup p \in C_{group} in the cell in turn. We will assume each particle p to have the same interaction list. Thus it has been possible to reduce the CPU time increasing the performances. This leads us to run simulations with a large number of particles (N ~ 10^7/10^9) in non-prohibitive times.Comment: 13 pages and 7 Figure
    corecore