On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism

In this paper we address the problem of the uniform random generation of non deterministic automata (NFA) up to isomorphism. First, we show how to use a Monte-Carlo approach to uniformly sample a NFA. Secondly, we show how to use the Metropolis-Hastings Algorithm to uniformly generate NFAs up to isomorphism. Using labeling techniques, we show that in practice it is possible to move into the modified Markov Chain efficiently, allowing the random generation of NFAs up to isomorphism with dozens of states. This general approach is also applied to several interesting subclasses of NFAs (up to isomorphism), such as NFAs having a unique initial states and a bounded output degree. Finally, we prove that for these interesting subclasses of NFAs, moving into the Metropolis Markov chain can be done in polynomial time. Promising experimental results constitute a practical contribution.Comment: Frank Drewes. CIAA 2015, Aug 2015, Umea, Sweden. Springer, 9223, pp.12, 2015, Implementation and Application of Automata - 20th International Conferenc

Probing the Space of Toric Quiver Theories

We demonstrate a practical and efficient method for generating toric Calabi-Yau quiver theories, applicable to both D3 and M2 brane world-volume physics. A new analytic method is presented at low order parametres and an algorithm for the general case is developed which has polynomial complexity in the number of edges in the quiver. Using this algorithm, carefully implemented, we classify the quiver diagram and assign possible superpotentials for various small values of the number of edges and nodes. We examine some preliminary statistics on this space of toric quiver theories

Scott : A method for representing graphs asrooted trees for graph canonization

International audienceGraphs increasingly stand out as an essential data structurein the field of data sciences. To study graphs, or sub-graphs, that char-acterize a set of observations, it is necessary to describe them formally,in order to characterize equivalence relations that make sense in thescope of the considered application domain. Hence we seek to define acanonical graph notation, so that two isomorphic (sub) graphs have thesame canonical form. Such notation could subsequently be used to indexand retrieve graphs or to embed them efficiently in some metric space.Sequential optimized algorithms solving this problem exist, but do notdeal with labeled edges, a situation that occurs in important applicationdomains such as chemistry. We present in this article a new algorithmbased on graph rewriting that provides a general and complete solution tothe graph canonization problem. Although not reported here, the formalproof of the validity of our algorithm has been established. This claim isclearly supported empirically by our experimentation on synthetic com-binatorics as well as natural graphs. Furthermore, our algorithm supportsdistributed implementations, leading to efficient computing perspectives

The Distances of the Magellanic Clouds

The present status of our knowledge of the distances to the Magellanic Clouds is evaluated from a post-Hipparcos perspective. After a brief summary of the effects of structure, reddening, age and metallicity, the primary distance indicators for the Large Magellanic Cloud are reviewed: The SN 1987A ring, Cepheids, RR Lyraes, Mira variables, and Eclipsing Binaries. Distances derived via these methods are weighted and combined to produce final "best" estimates for the Magellanic Clouds distance moduli.Comment: Invited review article to appear in ``Post Hipparcos Cosmic Candles'', F. Caputo & A. Heck (Eds.), Kluwer Academic Publ., Dordrecht, in pres

Processing of inconsistent emotional information: an fMRI study

Previous studies investigating the anterior cingulate cortex (ACC) have relied on a number of tasks which involved cognitive control and attentional demands. In this fMRI study, we tested the model that ACC functions as an attentional network in the processing of language. We employed a paradigm that requires the processing of concurrent linguistic information predicting that the cognitive costs imposed by competing trials would engender the activation of ACC. Subjects were confronted with sentences where the semantic content conflicted with the prosodic intonation (CONF condition) randomly interspaced with sentences which conveyed coherent discourse components (NOCONF condition). We observed the activation of the rostral ACC and the middle frontal gyrus when the NOCONF condition was subtracted from the CONF condition. Our findings provide evidence for the involvement of the rostral ACC in the processing of complex competing linguistic stimuli, supporting theories that claim its relevance as a part of the cortical attentional circuit. The processing of emotional prosody involved a bilateral network encompassing the superior and medial temporal cortices. This evidence confirms previous research investigating the neuronal network that supports the processing of emotional information

Optimized and Secure Implementation of ROLLO-I

International audienc