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

Optimal Tableaux Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-time Temporal Logic ATL+

We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the satisfiability problem for ATL+ . We also discuss how suitable parametrizations and syntactic restrictions on the class of input ATL+ formulae can reduce the complexity of the satisfiability problem.Comment: 45 page

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

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

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

LES-based Study of the Roughness Effects on the Wake of a Circular Cylinder from Subcritical to Transcritical Reynolds Numbers

This paper investigates the effects of surface roughness on the flow past a circular cylinder at subcritical to transcritical Reynolds numbers. Large eddy simulations of the flow for sand grain roughness of size k/D = 0.02 are performed (D is the cylinder diameter). Results show that surface roughness triggers the transition to turbulence in the boundary layer at all Reynolds numbers, thus leading to an early separation caused by the increased momentum deficit, especially at transcritical Reynolds numbers. Even at subcritical Reynolds numbers, boundary layer instabilities are triggered in the roughness sublayer and eventually lead to the transition to turbulence. The early separation at transcritical Reynolds numbers leads to a wake topology similar to that of the subcritical regime, resulting in an increased drag coefficient and lower Strouhal number. Turbulent statistics in the wake are also affected by roughness; the Reynolds stresses are larger due to the increased turbulent kinetic energy production in the boundary layer and separated shear layers close to the cylinder shoulders.We acknowledge “Red Española de Surpercomputación” (RES) for awarding us access to the MareNostrum III machine based in Barcelona, Spain (Ref. FI-2015-2-0026 and FI-2015-3-0011). We also acknowledge PRACE for awarding us access to Fermi and Marconi Supercomputers at Cineca, Italy (Ref. 2015133120). Oriol Lehmkuhl acknowledges a PDJ 2014 Grant by AGAUR (Generalitat de Catalunya). Ugo Piomelli acknowledges the support of the Natural Sciences and Engineering Research Council (NSERC) of Canada under the Discovery Grant Programme (Grant No. RGPIN-2016-04391). Ricard Borrell acknowledges a Juan de la Cierva postdoctoral grant (IJCI-2014-21034). Ivette Rodriguez, Oriol Lehmkuhl, Ricard Borrell and Assensi Oliva acknowledge Ministerio de Economía y Competitividad, Secretaría de Estado de Investigación, Desarrollo e Innovación, Spain (ref. ENE2014-60577-R).Peer ReviewedPostprint (author's final draft

Transcriptional regulation of the urokinase receptor (u-PAR) - A central molecule of invasion and metastasis

The phenomenon of tumor-associated proteolysis has been acknowledged as a decisive step in the progression of cancer. This short review focuses on the urokinase receptor (u-PAR), a central molecule involved in tumor-associated invasion and metastasis, and summarizes the transcriptional regulation of u-PAR. The urokinase receptor (u-PAR) is a heavily glycosylated cell surface protein and binds the serine protease urokinase specifically and with high affinity. It consists of three similar cysteine-rich repeats and is anchored to the cell membrane via a GPI-anchor. The u-PAR gene comprises 7 exons and is located on chromosome 19q13. Transcriptional activation of the u-PAR promoter region can be induced by binding of transcription factors (Sp1, AP-1, AP-2, NF-kappaB). One current study gives an example for transcriptional downregulation of u-PAR through a PEA3/ets transcriptional silencing element. Knowledge of the molecular regulation of this molecule in tumor cells could be very important for diagnosis and therapy in the near future

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiability for arbitrary formulas.Comment: Prefinal version of the published pape