On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Demonstration of antibodies in archival sera from Canadian seals reactive with a European isolate of phocine distemper virus

Sera from seals infected during the 1988 European epizootic of phocine distemper virus and sera from Canadian seals collected since 1972 have been tested for the presence of antibodies to morbillivirus. Approximately one third of the Canadian sera have been shown to contain anti-morbillivirus antibodies; the possibility that these populations of seals provided a source of infection for European seals is discussed.

Leatherback turtles satellite-tagged in European waters

The North Atlantic is considered a stronghold for the critically endangered leatherback sea turtle. However, limited information exists regarding the movements of individuals to and from the seas off Europe's northwesterly fringe, an area where featherbacks have been historically sighted for the past 200 yr. Here, we used satellite telemetry to record the movements and behaviour of 2 individuals bycaught in fisheries off the southwest coast of Ireland. The turtle T1 (tagged 1 September 2005; female; tracked 375 d) immediately travelled south via Madeira and the Canaries, before residing in West African waters for 3 mo. In spring, T1 migrated north towards Newfoundland where transmissions ceased. T2 (29 June 2006; male; 233 d) travelled south for a short period before spending 66 d west of the Bay of Biscay, an area previously asserted as a high-use area for leatherbacks. This prolonged high latitude summer residence corresponded with a mesoscale feature evident from satellite imagery, with the implication that this turtle had found a rich feeding site. A marked change in dive behaviour was apparent as the turtle exited this feature and provided useful insights on leatherback diving behaviour. T2 headed south in October 2006, and performed the deepest-ever dive recorded by a reptile (1280 m) southwest of Cape Verde. Unlike T1, T2 swam southwest towards Brazil before approaching the major nesting beaches of French Guiana and Surinam. Importantly, these tracks document the movement of leatherbacks from one of the remotest foraging grounds in the North Atlantic. © Inter-Research 2008.

Predictions of survival up to 10 years after diagnosis for European women with breast cancer in 2000-2002

Few studies have addressed longer-term survival for breast cancer in European women. We have made predictions of 10-year survival for European women diagnosed with breast cancer in 2000-2002. Data for 114,312 adult women (15-99 years) diagnosed with a first primary malignant cancer of the breast during 2000-2002 were collected in the EUROCARE-4 study from 24 population-based cancer registries in 14 European countries. We estimated relative survival at 1, 5, and 10 years after diagnosis for women who were alive at some point during 2000-2002, using the period approach. We also estimated 10-year survival conditional on survival to 1 and 5 years after diagnosis. Ten-year survival exceeded 70% in most regions, but was only 54% in Eastern Europe, with the highest value in Northern Europe (about 75%). Ten-year survival conditional on survival for 1 year was 2-6% higher than 10-year survival in all European regions, and geographic differences were smaller. Ten-year survival for women who survived at least 5 years was 88% overall, with the lowest figure in Eastern Europe (79%) and the highest in the UK (91%). Women aged 50-69 years had higher overall survival than older and younger women (79%). Six cancer registries had adequate information on stage at diagnosis; in these jurisdictions, 10-year survival was 89% for local, 62% for regional and 10% for metastatic disease. Data on stage are not collected routinely or consistently, yet these data are essential for meaningful comparison of population-based survival, which provides vital information for improving breast cancer control. What's new? Policy-makers and health-care planners need accurate data on long-term survival to improve cancer control. This Europe-wide study of 10-year survival identified low survival in Eastern Europe for women with breast cancer in 2000-2002, and wide variation by age at diagnosis. Data on stage at diagnosis are crucial for meaningful comparison of population-based survival, and fundamental for improving breast cancer control, but our analyses confirmed that stage data are not collected routinely or consistently Copyright © 2012 UICC.

Development and single laboratory validation of an optical biosensor assay for tetrodotoxin detection as a tool to combat emerging risks in European seafood

Tetrodotoxin (TTX) is a potent neurotoxin emerging in European waters due to increasing ocean temperatures. Its detection in seafood is currently performed as a consequence of using the Association of Analytical Communities (AOAC) mouse bioassay (MBA) for paralytic shellfish poisoning (PSP) toxins, but TTX is not monitored routinely in Europe. Due to ethical and performance-related issues associated with this bioassay, the European Commission has recently published directives extending procedures that may be used for official PSP control. An AOAC-accredited high-performance liquid chromatography (HPLC) method has now been accepted by the European Union as a first action screening method for PSP toxins to replace the MBA. However, this AOAC HPLC method is not capable of detecting TTX, so this potent toxin would be undetected; thereby, a separate method of analysis is required. Surface plasmon resonance (SPR) optical biosensor technology has been proven as a potential alternative screening method to detect PSP toxins in seafood. The addition of a similar SPR inhibition assay for TTX would complement the PSP assay in removing the MBA. The present report describes the development and single laboratory validation in accordance with AOAC and IUPAC guidelines of an SPR method to be used as a rapid screening tool to detect TTX in the sea snail Charonia lampas lampas, a species which has been implicated in 2008 in the first case of human TTX poisoning in Europe. As no current regulatory limits are set for TTX in Europe, single laboratory validation was undertaken using those for PSP toxins at 800 µg/kg. The decision limit (CCa) was 100 µg/kg, with the detection capability (CCß) found to be =200 µg/kg. Repeatability and reproducibility were assessed at 200, 400, and 800 µg/kg and showed relative standard deviations of 8.3, 3.8, and 5.4 % and 7.8, 8.3, and 3.7 % for both parameters at each level, respectively. At these three respective levels, the recovery of the assay was 112, 98, and 99 %.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Establishing optimal quantitative-polymerase chain reaction assays for routine diagnosis and tracking of minimal residual disease in JAK2-V617F-associated myeloproliferative neoplasms:a joint European LeukemiaNet/MPN&MPNr-EuroNet (COST action BM0902) study

Reliable detection of JAK2-V617F is critical for accurate diagnosis of myeloproliferative neoplasms (MPNs); in addition, sensitive mutation-specific assays can be applied to monitor disease response. However, there has been no consistent approach to JAK2-V617F detection, with assays varying markedly in performance, affecting clinical utility. Therefore, we established a network of 12 laboratories from seven countries to systematically evaluate nine different DNA-based quantitative PCR (qPCR) assays, including those in widespread clinical use. Seven quality control rounds involving over 21,500 qPCR reactions were undertaken using centrally distributed cell line dilutions and plasmid controls. The two best-performing assays were tested on normal blood samples (n=100) to evaluate assay specificity, followed by analysis of serial samples from 28 patients transplanted for JAK2-V617F-positive disease. The most sensitive assay, which performed consistently across a range of qPCR platforms, predicted outcome following transplant, with the mutant allele detected a median of 22 weeks (range 6-85 weeks) before relapse. Four of seven patients achieved molecular remission following donor lymphocyte infusion, indicative of a graft vs MPN effect. This study has established a robust, reliable assay for sensitive JAK2-V617F detection, suitable for assessing response in clinical trials, predicting outcome and guiding management of patients undergoing allogeneic transplant.

Bogeymen, lunatics and fanatics: collective actions and the private enforcement of European competition law

The European desire to ensure that bearers of EU rights are adequately compensated for any infringement of these rights, particularly in cases where the harm is widely diffused, and perhaps not even noticed by those affected by it, collides with another desire: to avoid the perceived excesses of an American-style system of class actions. The excesses of these American class actions are in European discourse presented as a sort of bogeyman, which is a source of irrational fear, often presented by parental or other authority figures. But when looked at critically, the bogeyman disappears. In this paper, I examine the European (and UK) proposals for collective action. I compare them to the American regime. The flaws and purported excesses of the American regime, I argue, are exaggerated. A close, objective examination of the American regime shows this. I conclude that it is not the mythical bogeyman of a US class action that is the barrier to effective collective redress; rather, the barriers to effective, wide-ranging group actions lie within European legal culture and traditions, particularly those mandating individual control over litigation.