On the level density of spin chains of Haldane--Shastry type

We provide a rigorous proof of the fact that the level density of all su(m) spin chains of Haldane-Shastry type associated with the A_{N-1} root system approaches a Gaussian distribution as the number of spins N tends to infinity. Our approach is based on the study of the large N limit of the characteristic function of the level density, using the description of the spectrum in terms of motifs and the asymptotic behavior of the dispersion relation.Comment: 6 pages, revte

A plan for the characterization, calibration, and evaluation of LAPR-2

A new airborne Linear Array Pushbroom Radiometer (LAPR-II) was built. LAPR-II will use linear arrays of silicon detectors to acquire four channels of digital image data for spectral bands within the visible and near infrared portions of the spectrum (0.4 - 1.0 micrometers). The data will be quantized to 10 bits, and spectral filters for each channel will be changeable in flight. The instrument will initially be flown aboard a NASA/Wallops' aircraft, and off nadir pointing of LAPR-II will be possible. Together, the instrument and its platform will provide a flexible readily available source of digital image data for scientific experiments. If LAPR-II is to serve as a precise scientific instrument, the instrument's characteristics must be quantitatively described and the data must be calibrated with respect to absolute radiometric units. The LAPR-II is described and the work required to characterize the instrument's spectral response, radiometric response, and spatial resolution and to calibrate the response from the many detectors per array is outlined

A New Algebraization of the Lame Equation

We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials and of a certain family of weakly orthogonal polynomialsComment: Latex2e with AMS-LaTeX and cite packages; 32 page

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

Proving Safety with Trace Automata and Bounded Model Checking

Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces redundant execution traces which may complicate the verification of the program. This holds particularly true for verification tools based on Bounded Model Checking, which incorporate simplistic heuristics to determine whether all feasible iterations of a loop have been considered. We present a technique that uses \emph{trace automata} to eliminate redundant executions after performing loop acceleration. The method reduces the diameter of the program under analysis, which is in certain cases sufficient to allow a safety proof using Bounded Model Checking. Our transformation is precise---it does not introduce false positives, nor does it mask any errors. We have implemented the analysis as a source-to-source transformation, and present experimental results showing the applicability of the technique

Automatic Verification of Erlang-Style Concurrency

This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of Lambda-Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for Lambda-Actor and use it to build a polytime computable, flow-based, abstract semantics of Lambda-Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program. We have constructed Soter, a tool implementation of the verification method, thereby obtaining the first fully-automatic, infinite-state model checker for a core fragment of Erlang. We find that in practice our abstraction technique is accurate enough to verify an interesting range of safety properties. Though the ACS coverability problem is Expspace-complete, Soter can analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at http://mjolnir.cs.ox.ac.uk/soter

An Open Source Laboratory for Operating Systems Projects

Typical undergraduate operating systems projects use services provided by an operating system via system calls or develop code in a simulated operating system. However, with the increasing popularity of operating systems with open source code such as Linux, there are untapped possibilities for operating systems projects to modify real operating system code. We present the hardware and software configuration of an open source laboratory that promises to provide students that use it with a better understanding of operating system internals than is typically gained in a traditional operating systems course. Our preliminary projects and evaluation suggest that thus far the lab has achieved its primary goal in that students that used the lab feel more knowledgeable in operating system and more confident in their ability to write and modify operating system code

Convex Hull of Arithmetic Automata

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata

Glacier expansion in southern Patagonia throughout the Antarctic cold reversal

Resolving debated climate changes in the southern middle latitudes and potential teleconnections between southern temperate and polar latitudes during the last glacial-interglacial transition is required to help understand the cause of the termination of ice ages. Outlet glaciers of the Patagonian Ice Fields are primarily sensitive to atmospheric temperature and also precipitation, thus former ice margins record the extent and timing of past climate changes. 38 10Be exposure ages from moraines show that outlet glaciers in Torres del Paine (51°S, south Patagonia, Chile) advanced during the time of the Antarctic cold reversal (ACR; ca. 14.6–12.8 ka), reaching a maximum extent by ∼14,200 ± 560 yr ago. The evidence here indicates that the South Patagonian Ice Field was responding to late glacial climate change distinctly earlier than the onset of the European Younger Dryas stadial (ca. 12.9 ka). Major glacier recession and deglaciation in the Torres del Paine region occurred by 12.5 ka and thus early in the Younger Dryas. We provide direct evidence for extensive ice in Patagonia at the very start of the ACR that agrees with atmospheric and marine records from the Southern Ocean and Antarctica. Atmospheric conditions responsible for the early late glacial expansion at Torres del Paine resulted from a climate reorganization that prompted a northern migration of the south westerly wind belt to the latitude of Torres del Paine at the onset of the ACR chronozone