Time-in-area represents foraging activity in a wide-ranging pelagic forager

Successful Marine Spatial Planning depends upon the identification of areas with high importance for particular species, ecosystems or processes. For seabirds, advancements in biologging devices have enabled us to identify these areas through the detailed study of at-sea behaviour. However, in many cases, only positional data are available and the presence of local biological productivity and hence seabird foraging behaviour is inferred from these data alone, under the untested assumption that foraging activity is more likely to occur in areas where seabirds spend more time. We fitted GPS devices and accelerometers to northern gannets Morus bassanus and categorised the behaviour of individuals outside the breeding colony as plunge diving, surface foraging, floating and flying. We then used the locations of foraging events to test the efficiency of 2 approaches: time-in-area and kernel density (KD) analyses, which are widely employed to detect highly-used areas and interpret foraging behaviour from positional data. For KD analyses, the smoothing parameter (h) was calculated using the ad hoc method (KDad hoc), and KDh=9.1, where h = 9.1 km, to designate core foraging areas from location data. A high proportion of foraging events occurred in core foraging areas designated using KDad hoc, KDh=9.1, and time-in-area. Our findings demonstrate that foraging activity occurs in areas where seabirds spend more time, and that both KD analysis and the time-in-area approach are equally efficient methods for this type of analysis. However, the time-in-area approach is advantageous in its simplicity, and in its ability to provide the shapes commonly used in planning. Therefore, the time-in-area approach can be used as a simple way of using seabirds to identify ecologically important locations from both tracking and survey data

Wild fish consumption can balance nutrient retention in farmed fish

Contributions D.F.W., R.N., W.M., B.K., D.L, A.L, B.d.R and J.P.W.R participated in study design and data collection. J.P.W.R. analysed the data and produced the figures. D.F.W. and J.P.W.R. wrote the final paper. All authors reviewed and approved the paper before submission.Peer reviewe

Parameterized complexity of DPLL search procedures

We study the performance of DPLL algorithms on parameterized problems. In particular, we investigate how difficult it is to decide whether small solutions exist for satisfiability and other combinatorial problems. For this purpose we develop a Prover-Delayer game which models the running time of DPLL procedures and we establish an information-theoretic method to obtain lower bounds to the running time of parameterized DPLL procedures. We illustrate this technique by showing lower bounds to the parameterized pigeonhole principle and to the ordering principle. As our main application we study the DPLL procedure for the problem of deciding whether a graph has a small clique. We show that proving the absence of a k-clique requires n steps for a non-trivial distribution of graphs close to the critical threshold. For the restricted case of tree-like Parameterized Resolution, this result answers a question asked in [11] of understanding the Resolution complexity of this family of formulas

Reef fishes weaken dietary preferences after coral mortality, altering resource overlap

The direct and indirect effects of climate change can affect, and are mediated by, changes in animal behaviour. However, we often lack sufficient empirical data to assess how large-scale disturbances affect the behaviour of individuals, which scales up to influence communities. Here, we investigate these patterns by focusing on the foraging behaviour of butterflyfishes, prominent coral-feeding fishes on coral reefs, before and after a mass coral bleaching event in Iriomote, Japan. In response to 65% coral mortality, coral-feeding fishes broadened their diets, showing a significant weakening of dietary preferences across species. Multiple species reduced their consumption of bleaching-sensitive Acropora corals, while expanding their diets to consume a variety of other coral genera. This resulted in decreased dietary overlap among butterflyfishes. Behavioural changes in response to bleaching may increase resilience of coral reef fishes in the short term. However, coral mortality has reduced populations of coral-feeders world-wide, indicating the changes in feeding behaviour we document here may not be sufficient to ensure long-term resilience of butterflyfishes on coral reefs

Population Dynamics and Non-Hermitian Localization

We review localization with non-Hermitian time evolution as applied to simple models of population biology with spatially varying growth profiles and convection. Convection leads to a constant imaginary vector potential in the Schroedinger-like operator which appears in linearized growth models. We illustrate the basic ideas by reviewing how convection affects the evolution of a population influenced by a simple square well growth profile. Results from discrete lattice growth models in both one and two dimensions are presented. A set of similarity transformations which lead to exact results for the spectrum and winding numbers of eigenfunctions for random growth rates in one dimension is described in detail. We discuss the influence of boundary conditions, and argue that periodic boundary conditions lead to results which are in fact typical of a broad class of growth problems with convection.Comment: 19 pages, 11 figure

Studies of transverse and longitudinal relaxations of 55^{55}Mn in molecular cluster magnet Mn12_{12}Ac

The transverse and longitudinal relaxation rates 1/$T_2$ and 1/$T_1$ of $^{55}$Mn in molecular cluster magnet Mn$_{12}$Ac have been measured al low temperatures down to 200mK and in the fields upto 9T. Both of 1/$T_2$ and 1/$T_1$ exhibit remarkable decreases with decreasing temperature and with increasing field, with the relative relation $T_1/T_2 \approx 200$. In the analysis, we adopt a simple model that the thermal fluctuation of the cluster spin $S$=10 associated with the spin-phonon interactionis, is only due to the excitation to the first excited state from the ground state with the average life-times $\tau_ 1$ and $\tau_0$ ($\tau_ 0$$\gg$$\tau_1$). We show that 1/$T_2$ is interpreted in terms of the strong collision regime as given by 1/$\tau_ 0$, and that 1/$T_1$ is understood by the high-frequency limit based on standard perturbation treatment for the step-wise fluctuating field, thus being proportional to 1/$\tau_0\omega_N^2$.Comment: 12 pages, 11 fugures, revtex

Dissipation and noise in adiabatic quantum pumps

We investigate the distribution function, the heat flow and the noise properties of an adiabatic quantum pump for an arbitrary relation of pump frequency $\omega$ and temperature. To achieve this we start with the scattering matrix approach for ac-transport. This approach leads to expressions for the quantities of interest in terms of the side bands of particles exiting the pump. The side bands correspond to particles which have gained or lost a modulation quantum $\hbar \omega$. We find that our results for the pump current, the heat flow and the noise can all be expressed in terms of a parametric emissivity matrix. In particular we find that the current cross-correlations of a multiterminal pump are directly related a to a non-diagonal element of the parametric emissivity matrix. The approach allows a description of the quantum statistical correlation properties (noise) of an adiabatic quantum pump

Computational Indistinguishability between Quantum States and Its Cryptographic Application

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor