One Theorem to Rule Them All: A Unified Translation of LTL into {\omega}-Automata

We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic B\"uchi automata, and nondeterministic B\"uchi automata. The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive boolean combination of languages that can be translated into {\omega}-automata by elementary means. In particular, Safra's, ranking, and breakpoint constructions used in other translations are not needed

The underlying social dynamics of paradigm shifts

We develop here a multi-agent model of the creation of knowledge (scientific progress or technological evolution) within a community of researchers devoted to such endeavors. In the proposed model, agents learn in a physical-technological landscape, and weight is attached to both individual search and social influence. We find that the combination of these two forces together with random experimentation can account for both i) marginal change, that is, periods of normal science or refinements on the performance of a given technology (and in which the community stays in the neighborhood of the current paradigm); and ii) radical change, which takes the form of scientific paradigm shifts (or discontinuities in the structure of performance of a technology) that is observed as a swift migration of the knowledge community towards the new and superior paradigm. The efficiency of the search process is heavily dependent on the weight that agents posit on social influence. The occurrence of a paradigm shift becomes more likely when each member of the community attaches a small but positive weight to the experience of his/her peers. For this parameter region, nevertheless, a conservative force is exerted by the representatives of the current paradigm. However, social influence is not strong enough to seriously hamper individual discovery, and can act so as to empower successful individual pioneers who have conquered the new and superior paradigm.Fil: Rodriguez Sickert, Carlos. Universidad del Desarrollo; ChileFil: Cosmelli, Diego. Pontificia Universidad Católica de Chile; ChileFil: Claro, Francisco. Pontificia Universidad Católica de Chile; ChileFil: Fuentes, Miguel Angel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad San Sebastián; Chil

Convolutional Patch Networks with Spatial Prior for Road Detection and Urban Scene Understanding

Classifying single image patches is important in many different applications, such as road detection or scene understanding. In this paper, we present convolutional patch networks, which are convolutional networks learned to distinguish different image patches and which can be used for pixel-wise labeling. We also show how to incorporate spatial information of the patch as an input to the network, which allows for learning spatial priors for certain categories jointly with an appearance model. In particular, we focus on road detection and urban scene understanding, two application areas where we are able to achieve state-of-the-art results on the KITTI as well as on the LabelMeFacade dataset. Furthermore, our paper offers a guideline for people working in the area and desperately wandering through all the painstaking details that render training CNs on image patches extremely difficult.Comment: VISAPP 2015 pape

Theories of the evolution of cooperative behaviour: A critical survey plus some new results

Gratuitous cooperation (in favour of non-relatives and without repeated interaction) eludes traditional evolutionary explanations. In this paper we survey the various theories of cooperative behaviour, and we describe our own effort to integrate these theories into a self-contained framework. Our main conclusions are as follows. First: altruistic punishment, conformism and gratuitous cooperation co-evolve, and group selection is a necessary ingredient for the co-evolution to take place. Second: people do not cooperate by mistake, as most theories imply; on the contrary, people knowingly sacrifice themselves for others. Third: in cooperative dilemmas conformism is an expression of preference, not a learning rule. Fourth, group-mutations (e.g., the rare emergence of a charismatic leader that brings order to the group) are necessary to sustain cooperation in the long run.Cooperation; altruism; altruistic punishment; conformism; group-selection

INSTITUTIONS INFLUENCE PREFERENCES: EVIDENCE FROM A COMMON POOL RESOURCE EXPERIMENT

We model the dynamic effects of external enforcement on the exploitation of a common pool resource. Fitting our model to the results of experimental data we find that institutions influence social preferences. We solve two puzzles in the data: the increase and later erosion of cooperation when commoners vote against the imposition of a fine, and the high deterrence power of low fines. When fines are rejected, internalization of a social norm explains the increased cooperation; violations (accidental or not), coupled with reciprocal preferences, account for the erosion. Low fines stabilize cooperation by preventing a spiral of negative reciprocation.Field experiments, common pool resources, cooperation, enforcement, regulation, social preferences, social norms, learning models

From LTL and Limit-Deterministic B\"uchi Automata to Deterministic Parity Automata

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic B\"uchi automata (LDBA) to DPA, and show that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, \enquote{Safraless} LTL-to-DPA construction. We also report on an implementation, a comparison with the SPOT library, and performance on several sets of formulas, including instances from the 2016 SyntComp competition

The Dynamics of a Mobile Phone Network

The empirical study of network dynamics has been limited by the lack of longitudinal data. Here we introduce a quantitative indicator of link persistence to explore the correlations between the structure of a mobile phone network and the persistence of its links. We show that persistent links tend to be reciprocal and are more common for people with low degree and high clustering. We study the redundancy of the associations between persistence, degree, clustering and reciprocity and show that reciprocity is the strongest predictor of tie persistence. The method presented can be easily adapted to characterize the dynamics of other networks and can be used to identify the links that are most likely to survive in the future