Relating L-Resilience and Wait-Freedom via Hitting Sets

The condition of t-resilience stipulates that an n-process program is only obliged to make progress when at least n-t processes are correct. Put another way, the live sets, the collection of process sets such that progress is required if all the processes in one of these sets are correct, are all sets with at least n-t processes. We show that the ability of arbitrary collection of live sets L to solve distributed tasks is tightly related to the minimum hitting set of L, a minimum cardinality subset of processes that has a non-empty intersection with every live set. Thus, finding the computing power of L is NP-complete. For the special case of colorless tasks that allow participating processes to adopt input or output values of each other, we use a simple simulation to show that a task can be solved L-resiliently if and only if it can be solved (h-1)-resiliently, where h is the size of the minimum hitting set of L. For general tasks, we characterize L-resilient solvability of tasks with respect to a limited notion of weak solvability: in every execution where all processes in some set in L are correct, outputs must be produced for every process in some (possibly different) participating set in L. Given a task T, we construct another task T_L such that T is solvable weakly L-resiliently if and only if T_L is solvable weakly wait-free

Destabilizing Taylor-Couette flow with suction

We consider the effect of radial fluid injection and suction on Taylor-Couette flow. Injection at the outer cylinder and suction at the inner cylinder generally results in a linearly unstable steady spiralling flow, even for cylindrical shears that are linearly stable in the absence of a radial flux. We study nonlinear aspects of the unstable motions with the energy stability method. Our results, though specialized, may have implications for drag reduction by suction, accretion in astrophysical disks, and perhaps even in the flow in the earth's polar vortex.Comment: 34 pages, 9 figure

The SPICE carbon isotope excursion in Siberia: a combined study of the upper Middle Cambrian-lowermost Ordovician Kulyumbe River section, northwestern Siberian Platform

An integrated, high-resolution chemostratigraphic (C, O and Sr isotopes) and magnetostratigraphic study through the upper Middle Cambrian–lowermost Ordovician shallowmarine carbonates of the northwestern margin of the Siberian Platform is reported. The interval was analysed at the Kulyumbe section, which is exposed along the Kulyumbe River, an eastern tributary of the Enisej River. It comprises the upper Ust’-Brus, Labaz, Orakta, Kulyumbe, Ujgur and lower Iltyk formations and includes the Steptoean positive carbon isotopic excursion (SPICE) studied here in detail from upper Cambrian carbonates of the Siberian Platform for the first time. The peak of the excursion, showing δ13C positive values as high as+4.6‰and least-altered 87Sr/86Sr ratios of 0.70909, is reported herein from the Yurakhian Horizon of the Kulyumbe Formation. The stratigraphic position of the SPICE excursion does not support traditional correlation of the boundary between theOrakta and Labaz formations at the Kulyumbe River with its supposedly equivalent level in Australia, Laurentia, South China and Kazakhstan, where the Glyptagnostus stolidotus and G. reticulatus biozones are known to immediately precede the SPICE excursion and span the Middle–Upper Cambrian boundary. The Cambrian–Ordovician boundary is probably situated in the middle Nyajan Horizon of the Iltyk Formation, in which carbon isotope values show a local maximum below a decrease in the upper part of the Nyajan Horizon, attributed herein to the Tremadocian Stage. A refined magnetic polarity sequence confirms that the geomagnetic reversal frequency was very high during Middle Cambrian times at 7–10 reversals per Ma, assuming a total duration of about 10 Ma and up to 100 magnetic intervals in the Middle Cambrian. By contrast, the sequence attributed herein to the Upper Cambrian on chemostratigraphic grounds contains only 10–11 magnetic intervals

History of degenerative spondylolisthesis: From anatomical description to surgical management

This review of the historical medical literature aimed at understanding the evolution of surgical management of degenerative spondylolisthesis over time. The Medic@, IndexCat and Gallica historical databases and PubMed and Embase medical databases were used, with several search-terms, exploring the years 1700-2018. Data from anatomical, biomechanical, pathophysiological and surgical studies were compiled. In total, 150 documents were obtained, dating from 1782 to 2018: 139 from PubMed, 1 from Medic@, 7 from IndexCat, and 3 from Gallica. The review thus ranges in time from (1) description of the first clinical cases by several authors in Europe (1782), (2) the identification of a distinct entity by MacNab (1963), and (3) surgical management by the emerging discipline of minimally invasive spine surgery, to its subsequent evolution up to the present day. Spondylolisthesis is a frequent condition potentially responsible for a variety of functional impairments. Understanding and surgical management have progressed since the 20th century. Historically, the first descriptions of treatments concerned only spondylolisthesis associated with spondylolysis, especially in young adults. More recently, there has been progress in the understanding of the disease in elderly people, with the recognition of degenerative spondylolisthesis. New technologies and surgical techniques, aided by advances in supportive care, now provide spine surgeons with powerful treatment tools. Better knowledge of the evolution of surgery throughout history should enable better understanding of current approaches and concepts for treating degenerative spondylolisthesis

Strong Equivalence Relations for Iterated Models

The Iterated Immediate Snapshot model (IIS), due to its elegant geometrical representation, has become standard for applying topological reasoning to distributed computing. Its modular structure makes it easier to analyze than the more realistic (non-iterated) read-write Atomic-Snapshot memory model (AS). It is known that AS and IIS are equivalent with respect to \emph{wait-free task} computability: a distributed task is solvable in AS if and only if it solvable in IIS. We observe, however, that this equivalence is not sufficient in order to explore solvability of tasks in \emph{sub-models} of AS (i.e. proper subsets of its runs) or computability of \emph{long-lived} objects, and a stronger equivalence relation is needed. In this paper, we consider \emph{adversarial} sub-models of AS and IIS specified by the sets of processes that can be \emph{correct} in a model run. We show that AS and IIS are equivalent in a strong way: a (possibly long-lived) object is implementable in AS under a given adversary if and only if it is implementable in IIS under the same adversary. %This holds whether the object is one-shot or long-lived. Therefore, the computability of any object in shared memory under an adversarial AS scheduler can be equivalently investigated in IIS

A Superstabilizing log⁡(n)\log(n)-Approximation Algorithm for Dynamic Steiner Trees

In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group) . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks for the new emergent networks (e.g. P2P, sensor or adhoc networks). The cost of the solution returned by our algorithm is at most $\log |S|$ times the cost of an optimal solution, where $S$ is the group of members. Our algorithm improves over existing solutions in several ways. First, it tolerates the dynamism of both the group members and the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is \emph{superstabilizing}. That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification

Experience with the LHC beam dump post-operational checks system

After each beam dump in the LHC automatic post-operational checks are made to guarantee that the last beam dump has been executed correctly and that the system can be declared to be ‘as good as new’ before the next injection is allowed. The analysis scope comprises the kicker waveforms, redundancy in kicker generator signal paths and different beam instrumentation measurements. This paper describes the implementation and the operational experience of the internal and external post-operational checks of the LHC beam dumping system during the commissioning of the LHC without beam and during the first days of beam operation

Results from the LHC Beam Dump Reliability Run

The LHC Beam Dumping System is one of the vital elements of the LHC Machine Protection System and has to operate reliably every time a beam dump request is made. Detailed dependability calculations have been made, resulting in expected rates for the different system failure modes. A 'reliability run' of the whole system, installed in its final configuration in the LHC, has been made to discover infant mortality problems and to compare the occurrence of the measured failure modes with their calculations

Charge distribution in two-dimensional electrostatics

We examine the stability of ringlike configurations of N charges on a plane interacting through the potential $V(z_1,...,z_N)=\sum_i |z_i|^2-\sum_{i<j} ln|z_i-z_j|^2$. We interpret the equilibrium distributions in terms of a shell model and compare predictions of the model with the results of numerical simulations for systems with up to 100 particles.Comment: LaTe

Computing the Roughening Transition of Ising and Solid-On-Solid Models by BCSOS Model Matching

We study the roughening transition of the dual of the 2D XY model, of the Discrete Gaussian model, of the Absolute Value Solid-On-Solid model and of the interface in an Ising model on a 3D simple cubic lattice. The investigation relies on a renormalization group finite size scaling method that was proposed and successfully tested a few years ago. The basic idea is to match the renormalization group flow of the interface observables with that of the exactly solvable BCSOS model. Our estimates for the critical couplings are $\beta_R^{XY}=1.1199(1)$, $K_R^{DG}=0.6653(2)$ and $K_R^{ASOS}=0.80608(2)$ for the XY-model, the Discrete Gaussian model and the Absolute Value Solid-On-Solid model, respectively. For the inverse roughening temperature of the Ising interface we find $K_R^{Ising}= 0.40758(1)$. To the best of our knowledge, these are the most precise estimates for these parameters published so far.Comment: 25 pages, LaTeX file, no figure