Thick GEM-like multipliers - a simple solution for large area UV-RICH detectors

We report on the properties of thick GEM-like (THGEM) electron multipliers made of 0.4 mm thick double-sided Cu-clad G-10 plates, perforated with a dense hexagonal array of 0.3 mm diameter drilled holes. Photon detectors comprising THGEMs coupled to semi-transparent CsI photocathodes or reflective ones deposited on the THGEM surface were studied with Ar/CO2 (70:30), Ar/CH4 (95:5), CH4 and CF4. Gains of ~100000 or exceeding 1000000 were reached with single- or double-THGEM, respectively; the signals have 5-10 ns rise times. The electric field configurations at the THGEM electrodes result in an efficient extraction of photoelectrons and their focusing into the holes; this occurs already at rather low gains, below 100. These detectors, with single-photon sensitivity and with expected sub-millimeter localization, can operate at MHz/mm2 rates. We discuss their prospects for large-area UV-photon imaging for RICH.Comment: 5 pages, 6 figure

Advances in imaging THGEM-based detectors

The thick GEM (THGEM) [1] is an "expanded" GEM, economically produced in the PCB industry by simple drilling and etching in G-10 or other insulating materials (fig. 1). Similar to GEM, its operation is based on electron gas avalanche multiplication in sub-mm holes, resulting in very high gain and fast signals. Due to its large hole size, the THGEM is particularly efficient in transporting the electrons into and from the holes, leading to efficient single-electron detection and effective cascaded operation. The THGEM provides true pixilated radiation localization, ns signals, high gain and high rate capability. For a comprehensive summary of the THGEM properties, the reader is referred to [2, 3]. In this article we present a summary of our recent study on THGEM-based imaging, carried out with a 10x10 cm^2 double-THGEM detector.Comment: 3 pages, 3 figures. Presented at the 10th Pisa Meeting on Advanced Detectors; ELBA-Italy; May 21-27 200

Reachability and Shortest Paths in the Broadcast CONGEST Model

In this paper we study the time complexity of the single-source reachability problem and the single-source shortest path problem for directed unweighted graphs in the Broadcast CONGEST model. We focus on the case where the diameter D of the underlying network is constant. We show that for the case where D = 1 there is, quite surprisingly, a very simple algorithm that solves the reachability problem in 1(!) round. In contrast, for networks with D = 2, we show that any distributed algorithm (possibly randomized) for this problem requires Omega(sqrt{n/ log{n}}) rounds. Our results therefore completely resolve (up to a small polylog factor) the complexity of the single-source reachability problem for a wide range of diameters. Furthermore, we show that when D = 1, it is even possible to get an almost 3 - approximation for the all-pairs shortest path problem (for directed unweighted graphs) in just 2 rounds. We also prove a stronger lower bound of Omega(sqrt{n}) for the single-source shortest path problem for unweighted directed graphs that holds even when the diameter of the underlying network is 2. As far as we know this is the first lower bound that achieves Omega(sqrt{n}) for this problem

Robust Fault Tolerant uncapacitated facility location

In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities. This paper concerns the robust fault-tolerant version of the uncapacitated facility location problem (RFTFL). In this problem, one or more facilities might fail, and each demand should be supplied by the closest open facility that did not fail. It is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning all node demands to open facilities that did not fail, after the failure of up to \alpha facilities. We present a polynomial time algorithm that yields a 6.5-approximation for this problem with at most one failure and a 1.5 + 7.5\alpha-approximation for the problem with at most \alpha > 1 failures. We also show that the RFTFL problem is NP-hard even on trees, and even in the case of a single failure