Asynchronous Games over Tree Architectures

We consider the task of controlling in a distributed way a Zielonka asynchronous automaton. Every process of a controller has access to its causal past to determine the next set of actions it proposes to play. An action can be played only if every process controlling this action proposes to play it. We consider reachability objectives: every process should reach its set of final states. We show that this control problem is decidable for tree architectures, where every process can communicate with its parent, its children, and with the environment. The complexity of our algorithm is l-fold exponential with l being the height of the tree representing the architecture. We show that this is unavoidable by showing that even for three processes the problem is EXPTIME-complete, and that it is non-elementary in general

All-Optical Electron Injector

Conventional electron acceleration at a place like SLAC needs miles to boost particles up to 50 GeV energies by feeding them microwaves in a succession of special cavities. In recent years physicists have been developing alternative acceleration concepts that might someday do the job in a much smaller space. Their near-term goal is to produce a first stage accelerator that outputs electron beams with lower energy but with properties that are more suitable for x-ray sources, such as those based on Compton scattering or the proposed linear synchrotrons at SLAC and DESY

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

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

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