Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks

Development of coherence in the high-gain Compton free-electron laser

The start-up of the free-electron laser is treated by linear analysis in the high-gain Compton regime. The results are compared with computer simulation

Measurements of total scattering spectra from bocaccio (Sebastes paucispinis)

Marine sportfishing in southern California is a huge industry with annual revenues totaling many billions of dollars. However, the stocks of lingcod and six rockfish species have been declared overfished by the Pacific Fisheries Management Council. As part of a multifaceted fisheries management plan, marine conservation areas, covering many million square nautical miles, have been mandated. To monitor the recovery of the rockfish stocks in these areas, scientists are faced with the following challenges: 1) multiple species of rockfish exist in these areas; 2) the species reside near or on the bottom at depths of 80 to 300 m; and 3) they are low in numerical density. To meet these challenges, multifrequency echosounders, multibeam sonar, and cameras mounted on remotely operated vehicles are frequently used (Reynolds et al., 2001). The accuracy and precision of these echosounder results are largely dependent upon the accuracy of the species classification and target strength estimation (MacLennan and Simmonds, 1992)

Benchmarks for Parity Games (extended version)

We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from https://github.com/jkeiren/paritygame-generator. This is an extended version of the paper that has been accepted for FSEN 201

The Thermodynamics of Cosmic String densities in U(1) Scalar Field Theory

We present a full characterization of the phase transition in U(1) scalar field theory and of the associated vortex string thermodynamics in 3D. We show that phase transitions in the string densities exist and measure their critical exponents, both for the long string and the short loops. Evidence for a natural separation between these two string populations is presented. In particular our results strongly indicate that an infinite string population will only exist above the critical temperature. Canonical initial conditions for cosmic string evolution are show to correspond to the infinite temperature limit of the theory.Comment: 4 pages, 4 figures, RevTe

Algorithmic Randomness as Foundation of Inductive Reasoning and Artificial Intelligence

This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and philosophy. Intuitively, randomness is a lack of order or predictability. If randomness is the opposite of determinism, then algorithmic randomness is the opposite of computability. Besides many other things, these concepts have been used to quantify Ockham's razor, solve the induction problem, and define intelligence.Comment: 9 LaTeX page