Symmetric Strategy Improvement

Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of classic strategy improvement to be polynomial

A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors

Safety-critical systems need to maintain their functionality in the presence of multiple errors caused by component failures or disastrous environment events. We propose a game-theoretic foundation for synthesizing control strategies that maximize the resilience of a software system in defense against a realistic error model. The new control objective of such a game is called $k$ -resilience. In order to be $k$ -resilient, a system needs to rapidly recover from infinitely many waves of a small number of up to $k$ close errors provided that the blocks of up to $k$ errors are separated by short time intervals, which can be used by the system to recover. We first argue why we believe this to be the right level of abstraction for safety critical systems when local faults are few and far between. We then show how the analysis of $k$ -resilience problems can be formulated as a model-checking problem of a mild extension to the alternating-time $\mu$ -calculus (AMC). The witness for $k$ resilience, which can be provided by the model checker, can be used for providing control strategies that are optimal with respect to resilience. We show that the computational complexity of constructing such optimal control strategies is low and demonstrate the feasibility of our approach through an implementation and experimental results

Persistent clinical efficacy and safety of anti-tumour necrosis factor \textgreeka therapy with infliximab in patients with ankylosing spondylitis over 5 years: evidence for different types of response

Background: There is insufficient evidence for the long-term efficacy and safety of anti-tumour necrosis factor therapy in patients with ankylosing spondylitis (AS). This is the first report on the treatment with infliximab over 5 years.Methods: As part of a multicentre randomised trial, 69 patients with active AS at baseline (BL) have been continuously treated with infliximab (5 mg/kg i.v. every 6 weeks)---except for a short discontinuation after 3 years (FU1). The primary outcome of this extension was remission according to the ASsessment in Ankylosing Spondylitis (ASAS) criteria at the end of year 5 of the study (FU2).Results: Of the 43 patients who completed year 3, 42 agreed to continue, 38 of which (90.5%) finished year 5 (55% of 69 initially). Partial clinical remission was achieved in 13 of 38 patients (34.2%) at FU1 and FU2. At FU2, the mean Bath Ankylosing Spondylitis Disease Activity Index (BASDAI) was 2.5±1.9 (BL:6.4, FU1:2.5). BASDAI values <4 were seen in 79% of patients at both, FU1 and FU2. ASAS 20% and 40% responses were seen in 32 (84%) and 24 (63%) patients at FU2, respectively. Most patients classified as non-responders at FU2 were part-time responders, as all but one patient achieved an ASAS 20% response at least once within the last 2 years. Three types of responders were identified. No major side effects occurred during years 4 and 5 of infliximab therapy.Conclusions: Infliximab is safe and efficacious in AS patients over 5 years. The majority of the patients remained on treatment and had rather persistent levels of low disease activity. Different response types could be identified

Numerical and experimental verification of a theoretical model of ripple formation in ice growth under supercooled water film flow

Little is known about morphological instability of a solidification front during the crystal growth of a thin film of flowing supercooled liquid with a free surface: for example, the ring-like ripples on the surface of icicles. The length scale of the ripples is nearly 1 cm. Two theoretical models for the ripple formation mechanism have been proposed. However, these models lead to quite different results because of differences in the boundary conditions at the solid-liquid interface and liquid-air surface. The validity of the assumption used in the two models is numerically investigated and some of the theoretical predictions are compared with experiments.Comment: 30 pages, 9 figure

Robustness of the European power grids under intentional attack

The power grid defines one of the most important technological networks of our times and sustains our complex society. It has evolved for more than a century into an extremely huge and seemingly robust and well understood system. But it becomes extremely fragile as well, when unexpected, usually minimal, failures turn into unknown dynamical behaviours leading, for example, to sudden and massive blackouts. Here we explore the fragility of the European power grid under the effect of selective node removal. A mean field analysis of fragility against attacks is presented together with the observed patterns. Deviations from the theoretical conditions for network percolation (and fragmentation) under attacks are analysed and correlated with non topological reliability measures.Comment: 7 pages, 4 figure

Rotational Cooling of Polar Molecules by Stark-tuned Cavity Resonance

A general scheme for rotational cooling of diatomic heteronuclear molecules is proposed. It uses a superconducting microwave cavity to enhance the spontaneous decay via Purcell effect. Rotational cooling can be induced by sequentially tuning each rotational transition to cavity resonance, starting from the highest transition level to the lowest using an electric field. Electrostatic multipoles can be used to provide large confinement volume with essentially homogeneous background electric field.Comment: 10 pages, 6 figure

Multi-Player and Multi-Choice Quantum Game

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we provide a strategy with which players can always avoid the worst outcome. Also, by changing the value of the parameter of the initial state, the probabilities for players to obtain the best payoff will be much higher that in its classical version.Comment: 4 pages, 1 figur

Query rewriting under linear EL knowledge bases

With the adoption of the recent SPARQL 1.1 standard, RDF databases are capable of directly answering more expressive queries than simple conjunctive queries. In this paper we exploit such capabilities to answer conjunctive queries (CQs) under ontologies expressed in the description logic called linear EL-lin, a restricted form of EL. In particular, we show a query answering algorithm that rewrites a given CQ into a conjunctive regular path query (CRPQ) which, evaluated on the given instance, returns the correct answer. Our technique is based on the representation of infinite unions of CQs by non-deterministic finite-state automata. Our results achieve optimal data complexity, as well as producing rewritings straightforwardly implementable in SPARQL 1.1

New Deterministic Algorithms for Solving Parity Games

We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time $k^{O(\sqrt{k})}\cdot O(n^3)$, and general parity games in time $(p+k)^{O(\sqrt{k})} \cdot O(pnm)$, where $p$ is the number of distinct priorities and $m$ is the number of edges. For all games with $k = o(n)$ this improves the previously fastest algorithm by Jurdzi{\'n}ski, Paterson, and Zwick (SICOMP 2008). We also obtain novel kernelization results and an improved deterministic algorithm for graphs with small average degree