51 research outputs found

    Anonymous Asynchronous Systems: The Case of Failure Detectors

    Get PDF
    Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that are asynchrony, failures, dynamicity, mobility, etc. Considering message-passing systems, this paper considers the uncertainty created by the net effect of three of these adversaries, namely, asynchrony, failures, and anonymity. This means that, in addition to be asynchronous and crash-prone, the processes have no identity. Trivially, agreement problems (e.g., consensus) that cannot be solved in presence of asynchrony and failures cannot be solved either when adding anonymity. The paper consequently proposes anonymous failure detectors to circumvent these impossibilities. It has several contributions. First it presents three classes of failure detectors (denoted AP, A∩ and A∑) and show that they are the anonymous counterparts of the classes of perfect failure detectors, eventual leader failure detectors and quorum failure detectors, respectively. The class A∑ is new and showing it is the anonymous counterpart of the class ∑ is not trivial. Then, the paper presents and proves correct a genuinely anonymous consensus algorithm based on the pair of anonymous failure detector classes (A∩, A∑) (“genuinely” means that, not only processes have no identity, but no process is aware of the total number of processes). This new algorithm is not a “straightforward extension” of an algorithm designed for non-anonymous systems. To benefit from A∑, it uses a novel message exchange pattern where each phase of every round is made up of sub-rounds in which appropriate control information is exchanged. Finally, the paper discusses the notions of failure detector class hierarchy and weakest failure detector class for a given problem in the context of anonymous systems

    Solving the riddle of the bright mismatches: hybridization in oligonucleotide arrays

    Get PDF
    HDONA technology is predicated on two ideas. First, the differential between high-affinity (perfect match, PM) and lower-affinity (mismatch, MM) probes is used to minimize cross-hybridization. Second, several short probes along the transcript are combined, introducing redundancy. Both ideas have shown problems in practice: MMs are often brighter than PMs, and it is hard to combine the pairs because their brightness often spans decades. Previous analysis suggested these problems were sequence-related; publication of the probe sequences has permitted us an in-depth study of this issue. Our results suggest that fluorescently labeling the nucleotides interferes with mRNA binding, causing a catch-22 since, to be detected, the target mRNA must both glow and stick to its probe: without labels it cannot be seen even if bound, while with too many it won't bind. We show that this conflict causes much of the complexity of HDONA raw data, suggesting that an accurate physical understanding of hybridization by incorporating sequence information is necessary to perfect microarray analysis.Comment: 4 figure

    Geographical and temporal distribution of SARS-CoV-2 clades in the WHO European Region, January to June 2020

    Get PDF
    We show the distribution of SARS-CoV-2 genetic clades over time and between countries and outline potential genomic surveillance objectives. We applied three available genomic nomenclature systems for SARS-CoV-2 to all sequence data from the WHO European Region available during the COVID-19 pandemic until 10 July 2020. We highlight the importance of real-time sequencing and data dissemination in a pandemic situation. We provide a comparison of the nomenclatures and lay a foundation for future European genomic surveillance of SARS-CoV-2.Peer reviewe

    An operational overview of the EXport processes in the ocean from RemoTe sensing (EXPORTS) northeast pacific field deployment

    Get PDF
    The goal of the EXport Processes in the Ocean from RemoTe Sensing (EXPORTS) field campaign is to develop a predictive understanding of the export, fate, and carbon cycle impacts of global ocean net primary production. To accomplish this goal, observations of export flux pathways, plankton community composition, food web processes, and optical, physical, and biogeochemical (BGC) properties are needed over a range of ecosystem states. Here we introduce the first EXPORTS field deployment to Ocean Station Papa in the Northeast Pacific Ocean during summer of 2018, providing context for other papers in this special collection. The experiment was conducted with two ships: a Process Ship, focused on ecological rates, BGC fluxes, temporal changes in food web, and BGC and optical properties, that followed an instrumented Lagrangian float; and a Survey Ship that sampled BGC and optical properties in spatial patterns around the Process Ship. An array of autonomous underwater assets provided measurements over a range of spatial and temporal scales, and partnering programs and remote sensing observations provided additional observational context. The oceanographic setting was typical of late-summer conditions at Ocean Station Papa: a shallow mixed layer, strong vertical and weak horizontal gradients in hydrographic properties, sluggish sub-inertial currents, elevated macronutrient concentrations and low phytoplankton abundances. Although nutrient concentrations were consistent with previous observations, mixed layer chlorophyll was lower than typically observed, resulting in a deeper euphotic zone. Analyses of surface layer temperature and salinity found three distinct surface water types, allowing for diagnosis of whether observed changes were spatial or temporal. The 2018 EXPORTS field deployment is among the most comprehensive biological pump studies ever conducted. A second deployment to the North Atlantic Ocean occurred in spring 2021, which will be followed by focused work on data synthesis and modeling using the entire EXPORTS data set

    Surveyor's Forum: Technical Transactions

    No full text

    Implementing a N-Mixed-Memory Model on a Distributed Memory System

    No full text

    ProLD: Propagate Linked Data

    No full text
    corecore