Tight Bounds for MIS in Multichannel Radio Networks

Daum et al. [PODC'13] presented an algorithm that computes a maximal independent set (MIS) within $O(\log^2 n/F+\log n \mathrm{polyloglog} n)$ rounds in an $n$-node multichannel radio network with $F$ communication channels. The paper uses a multichannel variant of the standard graph-based radio network model without collision detection and it assumes that the network graph is a polynomially bounded independence graph (BIG), a natural combinatorial generalization of well-known geographic families. The upper bound of that paper is known to be optimal up to a polyloglog factor. In this paper, we adapt algorithm and analysis to improve the result in two ways. Mainly, we get rid of the polyloglog factor in the runtime and we thus obtain an asymptotically optimal multichannel radio network MIS algorithm. In addition, our new analysis allows to generalize the class of graphs from those with polynomially bounded local independence to graphs where the local independence is bounded by an arbitrary function of the neighborhood radius.Comment: 37 pages, to be published in DISC 201

Distribution and Extinction of Ungulates during the Holocene of the Southern Levant

BACKGROUND: The southern Levant (Israel, Palestinian Authority and Jordan) has been continuously and extensively populated by succeeding phases of human cultures for the past 15,000 years. The long human impact on the ancient landscape has had great ecological consequences, and has caused continuous and accelerating damage to the natural environment. The rich zooarchaeological data gathered at the area provide a unique opportunity to reconstruct spatial and temporal changes in wild species distribution, and correlate them with human demographic changes. METHODOLOGY: Zoo-archaeological data (382 animal bone assemblages from 190 archaeological sites) from various time periods, habitats and landscapes were compared. The bone assemblages were sorted into 12 major cultural periods. Distribution maps showing the presence of each ungulate species were established for each period. CONCLUSIONS: The first major ungulate extinction occurred during the local Iron Age (1,200-586 BCE), a period characterized by significant human population growth. During that time the last of the largest wild ungulates, the hartebeest (Alcelaphus buselaphus), aurochs (Bos primigenius) and the hippopotamus (Hippopotamus amphibius) became extinct, followed by a shrinking distribution of forest-dwelling cervids. A second major wave of extinction occurred only in the 19th and 20th centuries CE. Furthermore, a negative relationship was found between the average body mass of ungulate species that became extinct during the Holocene and their extinction date. It is thus very likely that the intensified human activity through habitat destruction and uncontrolled hunting were responsible for the two major waves of ungulate extinction in the southern Levant during the late Holocene

SoK: A Consensus Taxonomy in the Blockchain Era

Consensus (a.k.a. Byzantine agreement) is arguably one of the most fundamental problems in distributed systems, playing also an important role in the area of cryptographic protocols as the enabler of a (secure) broadcast functionality. While the problem has a long and rich history and has been analyzed from many different perspectives, recently, with the advent of blockchain protocols like Bitcoin, it has experienced renewed interest from a much wider community of researchers and has seen its application expand to various novel settings. One of the main issues in consensus research is the many different variants of the problem that exist as well as the various ways the problem behaves when different setup, computational assumptions and network models are considered. In this work we perform a systematization of knowledge in the landscape of consensus research starting with the original formulation in the early 1980s up to the present blockchain-based new class of consensus protocols. Our work is a roadmap for studying the consensus problem under its many guises, classifying the way it operates in many settings and highlighting the exciting new applications that have emerged in the blockchain era

Structure of a bacterial ice binding protein with two faces of interaction with ice

Ice-binding proteins (IBPs) contribute to the survival of many living beings at subzero temperature by controlling the formation and growth of ice crystals. This work investigates the structural basis of the ice-binding properties of EfcIBP, obtained from Antarctic bacteria. EfcIBP is endowed with a unique combination of thermal hysteresis and ice recrystallization inhibition activity. The three-dimensional structure, solved at 0.84 angstrom resolution, shows that EfcIBP belongs to the IBP-1 fold family, and is organized in a right-handed -solenoid with a triangular cross-section that forms three protein surfaces, named A, B, and C faces. However, EfcIBP diverges from other IBP-1 fold proteins in relevant structural features including the lack of a capping' region on top of the -solenoid, and in the sequence and organization of the regions exposed to ice that, in EfcIBP, reveal the presence of threonine-rich ice-binding motifs. Docking experiments and site-directed mutagenesis pinpoint that EfcIBP binds ice crystals not only via its B face, as common to other IBPs, but also via ice-binding sites on the C face. DatabaseCoordinates and structure factors have been deposited in the Protein Data Bank under accession number

The Authors Respond.

Consider the "Number in Hand" multiparty communication complexity model, where k players P 1,...,P k holding inputs x1,…,xk ¿ 0,1n(respectively) communicate in order to compute the value f(x 1,...,x k ). The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem. In this paper, we study the power of the partition arguments method. Our two main results are very different in nature: (i) For randomized communication complexity we show that partition arguments may be exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is O(n) but partition arguments can only yield an O(log n) lower bound. The same holds for nondeterministic communication complexity. (ii) For deterministic communication complexity, we prove that finding significant gaps, between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on (a generalized version of) the "log rank conjecture" of communication complexity

Structure of a 1.5-MDa adhesin that binds its antarctic bacterium to diatoms and ice

Bacterial adhesins are modular cell-surface proteins that mediate adherence to other cells, surfaces, and ligands. The Antarctic bacterium Marinomonas primoryensis uses a 1.5-MDa adhesin comprising over 130 domains to position it on ice at the top of the water column for better access to oxygen and nutrients. We have reconstructed this 0.6-μm-long adhesin using a “dissect and build” structural biology approach and have established complementary roles for its five distinct regions. Domains in region I (RI) tether the adhesin to the type I secretion machinery in the periplasm of the bacterium and pass it through the outer membrane. RII comprises ~120 identical immunoglobulin-like β-sandwich domains that rigidify on binding Ca2+ to project the adhesion regions RIII and RIV into the medium. RIII contains ligand-binding domains that join diatoms and bacteria together in a mixed-species community on the underside of sea ice where incident light is maximal. RIV is the ice-binding domain, and the terminal RV domain contains several “repeats-in-toxin” motifs and a noncleavable signal sequence that target proteins for export via the type I secretion system. Similar structural architecture is present in the adhesins of many pathogenic bacteria and provides a guide to finding and blocking binding domains to weaken infectivity