Engineering Art Galleries

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this survey, we describe this work, show the chronology of developments, and compare current algorithms, including two unpublished versions, in an exhaustive experiment. Furthermore, we show what core algorithmic ingredients have led to recent successes

Crowd computing as a cooperation problem: an evolutionary approach

Cooperation is one of the socio-economic issues that has received more attention from the physics community. The problem has been mostly considered by studying games such as the Prisoner's Dilemma or the Public Goods Game. Here, we take a step forward by studying cooperation in the context of crowd computing. We introduce a model loosely based on Principal-agent theory in which people (workers) contribute to the solution of a distributed problem by computing answers and reporting to the problem proposer (master). To go beyond classical approaches involving the concept of Nash equilibrium, we work on an evolutionary framework in which both the master and the workers update their behavior through reinforcement learning. Using a Markov chain approach, we show theoretically that under certain----not very restrictive-conditions, the master can ensure the reliability of the answer resulting of the process. Then, we study the model by numerical simulations, finding that convergence, meaning that the system reaches a point in which it always produces reliable answers, may in general be much faster than the upper bounds given by the theoretical calculation. We also discuss the effects of the master's level of tolerance to defectors, about which the theory does not provide information. The discussion shows that the system works even with very large tolerances. We conclude with a discussion of our results and possible directions to carry this research further.This work is supported by the Cyprus Research Promotion Foundation grant TE/HPO/0609(BE)/05, the National Science Foundation (CCF-0937829, CCF-1114930), Comunidad de Madrid grant S2009TIC-1692 and MODELICO-CM, Spanish MOSAICO, PRODIEVO and RESINEE grants and MICINN grant TEC2011-29688-C02-01, and National Natural Science Foundation of China grant 61020106002.Publicad

Survival probability in avalanche victims with long burial (≥60 min): A retrospective study.

The survival of completely buried victims in an avalanche mainly depends on burial duration. Knowledge is limited about survival probability after 60 min of complete burial. We aimed to study the survival probability and prehospital characteristics of avalanche victims with long burial durations. We retrospectively included all completely buried avalanche victims with a burial duration of ≥60 min between 1997 and 2018 in Switzerland. Data were extracted from the registry of the Swiss Institute for Snow and Avalanche Research and the prehospital medical records of the physician-staffed helicopter emergency medical services. Avalanche victims buried for ≥24 h or with an unknown survival status were excluded. Survival probability was estimated by using the non-parametric Ayer-Turnbull method and logistic regression. The primary outcome was survival probability. We identified 140 avalanche victims with a burial duration of ≥60 min, of whom 27 (19%) survived. Survival probability shows a slight decrease with increasing burial duration (23% after 60 min, to <6% after 1400 min, p = 0.13). Burial depth was deeper for those who died (100 cm vs 70 cm, p = 0.008). None of the survivors sustained CA during the prehospital phase. The overall survival rate of 19% for completely buried avalanche victims with a long burial duration illustrates the importance of continuing rescue efforts. Avalanche victims in CA after long burial duration without obstructed airway, frozen body or obvious lethal trauma should be considered to be in hypothermic CA, with initiation of cardiopulmonary resuscitation and an evaluation for rewarming with extracorporeal life support

Navigating with a browser

We consider the navigation power of Web browsers, such as Netscape Navigator, Internet Explorer or Opera. To this end, we formally introduce the notion of a navigational problem. We investigate various characteristics of such problems which make them hard to visit with small number of clicks

Emergency Connectivity in Ad-hoc Networks with Selfish Nodes

Inspired by the CONFIDANT protocol (Buchegger and Boudec in Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 226-236, 2002), we define and study a basic reputation-based protocol in multihop wireless networks with selfish nodes. Its reputation mechanism is implemented through the ability of any node to define a threshold of tolerance for any of its neighbors, and to cut the connection to any of these neighbors that refuse to forward an amount of flow above that threshold. The main question we would like to address is whether one can set the initial conditions so that the system reaches an equilibrium state where a non-zero amount of every commodity is routed. This is important in emergency situations, where all nodes need to be able to communicate even with a small bandwidth. Following a standard approach, we model this protocol as a game, and we give necessary and sufficient conditions for the existence of non-trivial Nash equilibria. Then we enhance these conditions with extra conditions that give a set of necessary and sufficient conditions for the existence of connected Nash equilibria. We note that it is not always necessary for all the flow originating at a node to reach its destination at equilibrium. For example, a node may be using unsuccessful flow in order to effect changes in a distant part of the network that will prove quite beneficial to it. We show that we can decide in polynomial time whether there exists a (connected) equilibrium without unsuccessful flows. In that case we calculate (in polynomial time) initial values that impose such an equilibrium on the network. On the negative side, we prove that it is NP-hard to decide whether a connected equilibrium exists in general (i.e., with some nodes using unsuccessful flows at equilibrium)