Line-Recovery by Programmable Particles

Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when $f$ of the $n$ particles have crashed. We focus on the basic line shape, used as a tool for the construction of more complex configurations. We present a solution to the line recovery problem by the non-faulty anonymous particles; the solution works regardless of the initial distribution and number $f<n-4$ of faults, of the local orientations of the non-faulty entities, and of the number of non-faulty entities activated in each round (i.e., semi-synchronous adversarial scheduler)

Radiation Risks and Mitigation in Electronic Systems

Electrical and electronic systems can be disturbed by radiation-induced effects. In some cases, radiation-induced effects are of a low probability and can be ignored; however, radiation effects must be considered when designing systems that have a high mean time to failure requirement, an impact on protection, and/or higher exposure to radiation. High-energy physics power systems suffer from a combination of these effects: a high mean time to failure is required, failure can impact on protection, and the proximity of systems to accelerators increases the likelihood of radiation-induced events. This paper presents the principal radiation-induced effects, and radiation environments typical to high-energy physics. It outlines a procedure for designing and validating radiation-tolerant systems using commercial off-the-shelf components. The paper ends with a worked example of radiation-tolerant power converter controls that are being developed for the Large Hadron Collider and High Luminosity-Large Hadron Collider at CERN.Comment: 19 pages, contribution to the 2014 CAS - CERN Accelerator School: Power Converters, Baden, Switzerland, 7-14 May 201

NEXT-100 Technical Design Report (TDR). Executive Summary

In this Technical Design Report (TDR) we describe the NEXT-100 detector that will search for neutrinoless double beta decay (bbonu) in Xe-136 at the Laboratorio Subterraneo de Canfranc (LSC), in Spain. The document formalizes the design presented in our Conceptual Design Report (CDR): an electroluminescence time projection chamber, with separate readout planes for calorimetry and tracking, located, respectively, behind cathode and anode. The detector is designed to hold a maximum of about 150 kg of xenon at 15 bar, or 100 kg at 10 bar. This option builds in the capability to increase the total isotope mass by 50% while keeping the operating pressure at a manageable level. The readout plane performing the energy measurement is composed of Hamamatsu R11410-10 photomultipliers, specially designed for operation in low-background, xenon-based detectors. Each individual PMT will be isolated from the gas by an individual, pressure resistant enclosure and will be coupled to the sensitive volume through a sapphire window. The tracking plane consists in an array of Hamamatsu S10362-11-050P MPPCs used as tracking pixels. They will be arranged in square boards holding 64 sensors (8 times8) with a 1-cm pitch. The inner walls of the TPC, the sapphire windows and the boards holding the MPPCs will be coated with tetraphenyl butadiene (TPB), a wavelength shifter, to improve the light collection.Comment: 32 pages, 22 figures, 5 table

Particle Computation: Complexity, Algorithms, and Logic

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of obstacles to the environment can be used to create complex systems. We provide a wide range of results for a wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates and, nand, nor, and or operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a fan-out gate cannot be generated. We resolve this missing component with the help of 2x1 particles, which can create fan-out gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits.Comment: 27 pages, 19 figures, full version that combines three previous conference article