Classical and Quantum Strings in compactified pp-waves and Godel type Universes

We consider Neveu-Schwarz pp-waves with spacetime supersymmetry. Upon compactification of a spacelike direction, these backgrounds develop Closed Null Curves (CNCs) and Closed Timelike Curves (CTCs), and are U-dual to supersymmetric Godel type universes. We study classical and quantum strings in this background, with emphasis on the strings winding around the compact direction. We consider two types of strings: long strings stabilized by NS flux and rotating strings which are stabilized against collapse by angular momentum. Some of the latter strings wrap around CNCs and CTCs, and are thus a potential source of pathology. We analyze the partition function, and in particular discuss the effects of these string states. Although our results are not conclusive, the partition function seems to be dramatically altered due to the presence of CNCs and CTCs. We discuss some interpretations of our results, including a possible sign of unitary violation.Comment: 42 pages, LaTeX, 2 figure

Teaching robots parametrized executable plans through spoken interaction

While operating in domestic environments, robots will necessarily face difficulties not envisioned by their developers at programming time. Moreover, the tasks to be performed by a robot will often have to be specialized and/or adapted to the needs of specific users and specific environments. Hence, learning how to operate by interacting with the user seems a key enabling feature to support the introduction of robots in everyday environments. In this paper we contribute a novel approach for learning, through the interaction with the user, task descriptions that are defined as a combination of primitive actions. The proposed approach makes a significant step forward by making task descriptions parametric with respect to domain specific semantic categories. Moreover, by mapping the task representation into a task representation language, we are able to express complex execution paradigms and to revise the learned tasks in a high-level fashion. The approach is evaluated in multiple practical applications with a service robot

Locality and Singularity for Store-Atomic Memory Models

Robustness is a correctness notion for concurrent programs running under relaxed consistency models. The task is to check that the relaxed behavior coincides (up to traces) with sequential consistency (SC). Although computationally simple on paper (robustness has been shown to be PSPACE-complete for TSO, PGAS, and Power), building a practical robustness checker remains a challenge. The problem is that the various relaxations lead to a dramatic number of computations, only few of which violate robustness. In the present paper, we set out to reduce the search space for robustness checkers. We focus on store-atomic consistency models and establish two completeness results. The first result, called locality, states that a non-robust program always contains a violating computation where only one thread delays commands. The second result, called singularity, is even stronger but restricted to programs without lightweight fences. It states that there is a violating computation where a single store is delayed. As an application of the results, we derive a linear-size source-to-source translation of robustness to SC-reachability. It applies to general programs, regardless of the data domain and potentially with an unbounded number of threads and with unbounded buffers. We have implemented the translation and verified, for the first time, PGAS algorithms in a fully automated fashion. For TSO, our analysis outperforms existing tools

On the effective action of confining strings

We study the low-energy effective action on confining strings (in the fundamental representation) in SU(N) gauge theories in D space-time dimensions. We write this action in terms of the physical transverse fluctuations of the string. We show that for any D, the four-derivative terms in the effective action must exactly match the ones in the Nambu-Goto action, generalizing a result of Luscher and Weisz for D=3. We then analyze the six-derivative terms, and we show that some of these terms are constrained. For D=3 this uniquely determines the effective action for closed strings to this order, while for D>3 one term is not uniquely determined by our considerations. This implies that for D=3 the energy levels of a closed string of length L agree with the Nambu-Goto result at least up to order 1/L^5. For any D we find that the partition function of a long string on a torus is unaffected by the free coefficient, so it is always equal to the Nambu-Goto partition function up to six-derivative order. For a closed string of length L, this means that for D>3 its energy can, in principle, deviate from the Nambu-Goto result at order 1/L^5, but such deviations must always cancel in the computation of the partition function. Next, we compute the effective action up to six-derivative order for the special case of confining strings in weakly-curved holographic backgrounds, at one-loop order (leading order in the curvature). Our computation is general, and applies in particular to backgrounds like the Witten background, the Maldacena-Nunez background, and the Klebanov-Strassler background. We show that this effective action obeys all of the constraints we derive, and in fact it precisely agrees with the Nambu-Goto action (the single allowed deviation does not appear).Comment: 71 pages, 7 figures. v2: added reference, minor corrections. v3: removed one term from the effective action since it is trivial. The conclusions on the corrections to energy levels are unchanged, but the claim that the holographic computation shows a deviation from Nambu-Goto was modified. v4: added reference

Linear Tabulated Resolution Based on Prolog Control Strategy

Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG- resolution, and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabulated resolution called TP-resolution. TP-resolution has two distinctive features: (1) It makes linear tabulated derivations in the same way as Prolog except that infinite loops are broken and redundant computations are reduced. It handles cuts as effectively as Prolog. (2) It is sound and complete for positive logic programs with the bounded-term-size property. The underlying algorithm can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.Comment: To appear as the first accepted paper in Theory and Practice of Logic Programming (http://www.cwi.nl/projects/alp/TPLP

Weak Alternating Timed Automata

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed