Ultra-Wideband Detection of 22 Coherent Radio Bursts on M Dwarfs

Coherent radio bursts detected from M dwarfs have some analogy with solar radio bursts, but reach orders of magnitude higher luminosities. These events trace particle acceleration, powered by magnetic reconnection, shock fronts (such as formed by coronal mass ejections, CMEs), and magnetospheric currents, in some cases offering the only window into these processes in stellar atmospheres. We conducted a 58-hour, ultra-wideband survey for coherent radio bursts on 5 active M dwarfs. We used the Karl G. Jansky Very Large Array (VLA) to observe simultaneously in three frequency bands covering a subset of 224-482 MHz and 1-6 GHz, achieving the widest fractional bandwidth to date for any observations of stellar radio bursts. We detected 22 bursts across 13 epochs, providing the first large sample of wideband dynamic spectra of stellar coherent radio bursts. The observed bursts have diverse morphology, with durations ranging from seconds to hours, but all share strong (40-100%) circular polarization. No events resemble solar Type II bursts (often associated with CMEs), but we cannot rule out the occurrence of radio-quiet stellar CMEs. The hours-long bursts are all polarized in the sense of the x-mode of the star's large-scale magnetic field, suggesting they are cyclotron maser emission from electrons accelerated in the large-scale field, analogous to auroral processes on ultracool dwarfs. The duty cycle of luminous coherent bursts peaks at 25% at 1-1.4 GHz, declining at lower and higher frequencies, indicating source regions in the low corona. At these frequencies, active M dwarfs should be the most common galactic transient source.Comment: 48 pages, 23 figures. Submitted to Ap

Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics

We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla. The only multiplicity we explicitly consider is two, namely one dimension for the syntax and one dimension for the semantics, but the general perspective is important. For example, issues of pragmatics could be handled as additional dimensions. One of the main problems addressed is the rather complicated repertoire of operations that exists besides the notion of categories in traditional Montague grammar. For the syntax we use a categorial grammar along the lines of Lambek. For the semantics we use so-called lexical and logical combinators inspired by work in natural logic. Nabla provides a concise interpretation and a sequent calculus as the basis for implementations.Comment: 20 page

NaDeA: A Natural Deduction Assistant with a Formalization in Isabelle

We present a new software tool for teaching logic based on natural deduction. Its proof system is formalized in the proof assistant Isabelle such that its definition is very precise. Soundness of the formalization has been proved in Isabelle. The tool is open source software developed in TypeScript / JavaScript and can thus be used directly in a browser without any further installation. Although developed for undergraduate computer science students who are used to study and program concrete computer code in a programming language we consider the approach relevant for a broader audience and for other proof systems as well.Comment: Proceedings of the Fourth International Conference on Tools for Teaching Logic (TTL2015), Rennes, France, June 9-12, 2015. Editors: M. Antonia Huertas, Jo\~ao Marcos, Mar\'ia Manzano, Sophie Pinchinat, Fran\c{c}ois Schwarzentrube

Developing Artificial Herders Using Jason

This paper gives an overview of a proposed strategy for the "Cows and Herders" scenario given in the Multi-Agent Programming Contest 2009. The strategy is to be implemented using the Jason platform, based on the agent-oriented programming language Agent-Speak. The paper describes the agents, their goals and the strategies they should follow. The basis for the paper and for participating in the contest is a new course given in spring 2009 and our main objective is to show that we are able to implement complex multi-agent systems with the knowledge gained in an introductory course on multi-agent systems.Comment: 5 page

Multi-Agent Programming Contest 2010 - The Jason-DTU Team

We provide a brief description of the Jason-DTU system, including the methodology, the tools and the team strategy that we plan to use in the agent contest.Comment: 4 page

Multi-Agent Programming Contest 2011 - The Python-DTU Team

We provide a brief description of the Python-DTU system, including the overall design, the tools and the algorithms that we plan to use in the agent contest.Comment: 4 page