Set agreement and the loneliness failure detector in crash-recovery systems

The set agreement problem states that from n proposed values at most n-1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but not recover, where processes have different identities, and where all processes initially know the membership. In this paper we study the set agreement problem and the weakest failure detector L used to solve it in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities) and without a complete initial knowledge of the membership.

An information reconciliation protocol for secret-key agreement with small leakage

We report on a variant of the so-called Cascade protocol that is well-known for its usage as information reconciliation protocol in quantum cryptography. A theoretical analysis of the optimal size of the parity check blocks is provided. We obtain a very small leakage which is for block sizes of 2^16 typically only 2.5% above the Shannon limit, and notably, this holds for a QBER between 1% and 50%. For a QBER between 1% and 6% the leakage is only 2% above the Shannon limit. As comparison, the leakage of the original Cascade algorithm is 20% (40%) above the Shannon limit for a QBER of 10% (35%).

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

3.5 The Missouri State Supreme Court Conferred a Honorary Law License for Lloyd Gaines.

On September 28th, 2006, the Missouri State Supreme Court conferred a posthumous law license for Mr. Gaines.

Use of ovary culture techniques in reproductive toxicology

Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved. Acknowledgements The author's studies in this field are supported by MRC grants G1002118 (NS and RAA) and G110357 (RAA), MR/L010011/1 (PAF), the European Community's Seventh Framework Programme (FP7/2007–2013) under grant agreement no. 212885 (PAF) and the Wellcome Trust (080388 to PAF). AS was funded by a BBSRC CASE Studentship co-funded by AstraZeneca.

In utero exposure to cigarette chemicals induces sex-specific disruption of one-carbon metabolism and DNA methylation in the human fetal liver

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. Acknowledgements: We thank Ms Margaret Fraser, Ms Samantha Flannigan, and Dr Wing Yee Kwong for their expert assistance. The staff at Grampian NHS Pregnancy Counselling Service were essential for collecting fetuses. We thank Professor Geoffrey Hammond and Dr Marc Simard, University of British Colombia for helpful comments on the manuscript. Supported by grants as follows: Scottish Senior Clinical Fellowship (AJD); Chief Scientist Office (Scottish Executive, CZG/1/109 to PAF, & CZG/4/742 (PAF & PJOS); NHS Grampian Endowments 08/02 (PAF, SB & PJOS); the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no 212885 (PAF & SMR); the Medical Research Council grants MR/L010011/1 (PAF & PJOS) and MR/K018310/1 (AJD). None of the funding bodies played any role in the design, collection, analysis, and interpretation of data, in the writing of the manuscript, nor in the decision to submit the manuscript for publication

The effect of flow speed and food size on the capture efficiency and feeding behaviour of the cold-water coral Lophelia pertusa

Acknowledgements The authors acknowledge L. Wicks and B. de Francisco for helping in coral sampling and coral care in the aquaria facilities at SAMS. Thanks to C. Campbell and the CCAP for kind support and help. Scientific party and crew on board the RVs Calanus and Seol Mara, as well as on board the RRS James Cook during the Changing Oceans cruise (JC_073) are greatly acknowledged. Thanks to colleagues at SAMS for their support during our stay at SAMS. We are in debt with A. Olariaga for his help modifying the cylindrical experimental chambers used in the experiments, and C.C. Suckling for assistance with the flume experiment. Many thanks go to G. Kazadinis for preparing the POM used in the feeding experiments. We also thank two anonymous reviewers and the editor for their constructive comments, which contribute to improve the manuscript. This work has been supported by the European Commission through two ASSEMBLE projects (grant agreement no. 227799) conducted in 2010 and 2011 at SAMS, as well as by the UK Ocean Acidification Research Programme's Benthic Consortium project (awards NE/H01747X/1 and NE/H017305/1) funded by NERC. [SS]

Hunger and Satiety Mechanisms and Their Potential Exploitation in the Regulation of Food Intake

Acknowledgments Tehmina Amin is the Project Manager and Julian Mercer is Project Coordinator for Full4Health. Both are funded by the Full4Health project (grant agreement no. 266408) under the EU Seventh Framework Programme (FP7/2007–2013). Julian Mercer is funded by the Scottish Government, Rural and Environment Science and Analytical Services Division, Food, Land and People programme. He is also a partner in FP7 projects: NeuroFAST (grant agreement no. 245099) and SATIN (grant agreement no. 289800).

A Toolbox for Quantitative Gene Expression in Varroa destructor : RNA Degradation in Field Samples and Systematic Analysis of Reference Gene Stability

Funding: This project has received funding from the European Union’s Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 613960 (SMARTBEES) (http://www.smartbees-fp7.eu/) and Veterinary Medicines Directorate, Department for Environment Food & Rural Affairs (Project # VM0517) (https://www.gov.uk/government/organisations/veterinary-medicines-directorate). CHM was supported by a Biosciences Knowledge Transfer Network Biotechnology and Biological Sciences Research Council (KTN-BBSRC CASE) Studentship (BB/L502467/1) (http://www.bbsrc.ac.uk/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Acknowledgments We gratefully acknowledge Mr Sebastian Bacz’s expert help and advice with beekeeping.

Maternal smoking dysregulates protein expression in second trimester human fetal livers in a sex-specific manner

Acknowledgments The staff at Grampian National Health Service Pregnancy Counseling Service were essential for collecting fetuses. We thank the Aberdeen Proteomics Core Facility (University of Aberdeen) for their expert assistance. Support for the study was provided by the Chief Scientist Office (Scottish Executive, CZG/1/109, & CZG/4/742), National Health Service Grampian Endowments (08/02), the European Community's Seventh Framework Programme (FP7/2007–2013) under grant agreement no 212885, and the Medical Research Council, UK (MR/L010011/1).

Isolation of 'Candidatus Nitrosocosmicus franklandus', a novel ureolytic soil archaeal ammonia oxidiser with tolerance to high ammonia concentration

Acknowledgements. The authors would like to thank Mr Kevin Mackenzie and Mrs Gillian Milne (University of Aberdeen) for technical support with scanning electron microscopy, and Dr Robin Walker for access to the Woodlands Field experimental plots at the SRUC,Craibstone Estate, Aberdeen. This work was financially supported by Natural Environmental Research Council (standard grants NE/I027835/1 and NE/L006286/1 and fellowship NE/J019151/1), EC Marie Curie ITN NORA, Grant Agreement No. 316472, the AXA Research Fund and the Centre for Genome Enabled Biology and Medicine, University of Aberdeen.

Draft Genome Sequence of Aneurinibacillus migulanus NCTC 7096

ACKNOWLEDGMENTS This project was funded by the Government of Kuwait (to F.N.A.) and the European Union’s Seventh Framework Programme under grant agreement 245268 (ISEFOR; to L.B. and S.W.). Further support came from the SwissBOL project, financed by the Swiss Federal Office for the Environment (grant holder L.B.) and the Sciex–Scientific Exchange Programme NMS.CH (to L.L. and L.B.).

Draft Genome Sequence of Aneurinibacillus migulanus Strain Nagano

ACKNOWLEDGMENTS This project was funded by the Kuwait Government (to F.N.A.), the European Union’s Seventh Framework Programme under grant agreement no. 245268 (ISEFOR; to L.B. and S.W.). Further support came from the SwissBOL project, financed by the Swiss Federal Office for the Environment (grant holder, L.B.) and the Sciex–Scientific Exchange Programme NMS.CH (to L.B. and L.L.).