Verifying Safety Properties With the TLA+ Proof System

TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. A Proof Manager uses backend verifiers such as theorem provers, proof assistants, SMT solvers, and decision procedures to check TLA+ proofs. This paper documents the first public release of TLAPS, distributed with a BSD-like license. It handles almost all the non-temporal part of TLA+ as well as the temporal reasoning needed to prove standard safety properties, in particular invariance and step simulation, but not liveness properties

Documented international enquiry on solid sedimentary fossil fuels; Coal: definitions, classifications, reserves-resources and energy potential

This paper deals with all solid sedimentary fossil fuels, i.e. coal, the main one for geological reserves and resources, peat, and oil shales. Definitions of coal ( < 50% ash) and coal seam (thickness and depth limits) are examined in view of an international agreement regarding new concepts for a common reserves and resources evaluation using the same nomenclature. The 50% ash limit, already adopted by UN-ECE for coal definition, allows the creation of a new category—the organic shales (50–75% ash)—comprising energetic materials still valuable for thermal use (coal shales) or to be retorted for oil production (oil shales). Geological relations between coals, oil shales, solid bitumen, liquid hydrocarbons, natural gas, and coalbed methane are also examined together with environmental problems. As a final synthesis of all topics, the paper discusses the problems related with a modern geological classification of all solid sedimentary fuels based on: various rank parameters (moisture content, calorific value, reflectance), maceral composition, and mineral matter content (and washability). Finally, it should be pointed out that the paper is presented as series of problems, some of them old ones, but never resolved until now. In order to facilitate the next generation of coal geologists to resolve these problems on the basis of international agreements, all sections begin with documented introductions for further questions opening an international enquiry. The authors hope that the answers will be abundant enough and pertinent to permit synthetic international solutions, valuable for the new millennium, with the help of interested consulted authorities, international pertinent organisations, and regional experts. D 2002 Elsevier Science B.V. All rights reserved

Fast Two-Robot Disk Evacuation with Wireless Communication

In the fast evacuation problem, we study the path planning problem for two robots who want to minimize the worst-case evacuation time on the unit disk. The robots are initially placed at the center of the disk. In order to evacuate, they need to reach an unknown point, the exit, on the boundary of the disk. Once one of the robots finds the exit, it will instantaneously notify the other agent, who will make a beeline to it. The problem has been studied for robots with the same speed~\cite{s1}. We study a more general case where one robot has speed $1$ and the other has speed $s \geq 1$. We provide optimal evacuation strategies in the case that $s \geq c_{2.75} \approx 2.75$ by showing matching upper and lower bounds on the worst-case evacuation time. For $1\leq s < c_{2.75}$, we show (non-matching) upper and lower bounds on the evacuation time with a ratio less than $1.22$. Moreover, we demonstrate that a generalization of the two-robot search strategy from~\cite{s1} is outperformed by our proposed strategies for any $s \geq c_{1.71} \approx 1.71$.Comment: 18 pages, 10 figure

Gathering in Dynamic Rings

The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same fundamental assumption: the topological structure does not change during the rendezvous or the gathering; this is true also for those investigations that consider faulty nodes. In other words, they only consider static graphs. In this paper we start the investigation of gathering in dynamic graphs, that is networks where the topology changes continuously and at unpredictable locations. We study the feasibility of gathering mobile agents, identical and without explicit communication capabilities, in a dynamic ring of anonymous nodes; the class of dynamics we consider is the classic 1-interval-connectivity. We focus on the impact that factors such as chirality (i.e., a common sense of orientation) and cross detection (i.e., the ability to detect, when traversing an edge, whether some agent is traversing it in the other direction), have on the solvability of the problem. We provide a complete characterization of the classes of initial configurations from which the gathering problem is solvable in presence and in absence of cross detection and of chirality. The feasibility results of the characterization are all constructive: we provide distributed algorithms that allow the agents to gather. In particular, the protocols for gathering with cross detection are time optimal. We also show that cross detection is a powerful computational element. We prove that, without chirality, knowledge of the ring size is strictly more powerful than knowledge of the number of agents; on the other hand, with chirality, knowledge of n can be substituted by knowledge of k, yielding the same classes of feasible initial configurations

Almost optimal asynchronous rendezvous in infinite multidimensional grids

Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ&gt; 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δ-dimensional Euclidean space and that each agent knows the Cartesian coordinates of its own initial position (but not the one of the other agent). We design an algorithm permitting the agents to meet after traversing a trajectory of length O(d δ polylog d). This bound for the case of 2d-grids subsumes the main result of [12]. The algorithm is almost optimal, since the Ω(d δ) lower bound is straightforward. Further, we apply our rendezvous method to the following network design problem. The ports of the δ-dimensional grid have to be set such that two anonymous agents starting at distance at most d from each other will always meet, moving in an asynchronous manner, after traversing a O(d δ polylog d) length trajectory. We can also apply our method to a version of the geometric rendezvous problem. Two anonymous agents move asynchronously in the δ-dimensional Euclidean space. The agents have the radii of visibility of r1 and r2, respectively. Each agent knows only its own initial position and its own radius of visibility. The agents meet when one agent is visible to the other one. We propose an algorithm designing the trajectory of each agent, so that they always meet after traveling a total distance of O( ( d)), where r = min(r1, r2) and for r ≥ 1. r)δpolylog ( d r

Effect of phenylephrine on static and dynamic accommodation.

PURPOSE: We tested the hypothesis that changes in accommodation after instillation of Phenylephrine Hydrochloride (PHCl) observed in some studies could be caused by changes in optics. METHODS: We performed two experiments to test the effects of PHCl on static and on dynamic accommodation in 8 and 6 subjects, respectively. Objective wavefront measurements were recorded of the static accommodation response to a stimulus at different distances or dynamic accommodation response to a sinusoidally moving stimulus (between 1 and 3 D of accommodative demand at 0.2Hz). The responses were characterized using two methods: one that takes into account the mydriatic optical effects on the accommodation produced by higher-order aberrations of the eye and another that takes into account only power changes paraxially due to the action of the ciliary muscle and regardless of the pupil size. RESULTS: When mydriatic optical effects were taken into account, differences in responses before and after PHCl instillation were 0.51±0.53 D, and 0.12±0.15, for static and dynamic accommodation, respectively, and were statistically significant (p0.313). CONCLUSIONS: The mydriatic effect of the PHCl causes optical changes in the eye that can reduce the objective and subjective measurement of accommodation

Composing first species counterpoint with a variable neighbourhood search algorithm

In this article, a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments consisting of a melody for the cantus firmus and the first species counterpoint. The objective function of the algorithm is based on a quantification of existing rules for counterpoint. The VNS algorithm developed in this article is a local search algorithm that starts from a randomly generated melody and improves it by changing one or two notes at a time. A thorough parametric analysis of the VNS reveals the significance of the algorithm's parameters on the quality of the composed fragment, as well as their optimal settings. A comparison of the VNS algorithm with a developed genetic algorithm shows that the VNS is more efficient. The VNS algorithm has been implemented in a user-friendly software environment for composition, called Optimuse. Optimuse allows a user to specify a number of characteristics such as length, key and mode. Based on this information, Optimuse 'composes' both cantus firmus and first species counterpoint. Alternatively, the user may specify a cantus firmus, and let Optimuse compose the accompanying first species counterpoint. © 2012 Taylor & Francis

In search of the elusive long-wave fundamental

Action spectra for threshold detection of flicker (30 Hz) were obtained on 11 deuteranopes under carefully controlled adaptation conditions. Individual differences were large, so that each one of the long-wave fundamentals proposed by different theorists finds reasonable justification in the spectrum measured on at least one deuteranope. Some deuteranopes' spectra are not described by any one of these "fundamentals". To a first approximation at least, trichromats' spectra show the property of linear additivity. One such trichromat's spectrum agreed well with that of a deuteranope with whom he shares a common erythrolabe, and appears to be uninfluenced by his chlorolabe-filled cones.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/24130/1/0000387.pd

Grouping based feature attribution in metacontrast masking

The visibility of a target can be strongly suppressed by metacontrast masking. Still, some features of the target can be perceived within the mask. Usually, these rare cases of feature mis-localizations are assumed to reflect errors of the visual system. To the contrary, I will show that feature "mis-localizations" in metacontrast masking follow rules of motion grouping and, hence, should be viewed as part of a systematic feature attribution process

LNCS

We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers