Analysis of airborne Doppler lidar, Doppler radar and tall tower measurements of atmospheric flows in quiescent and stormy weather

The first experiment to combine airborne Doppler Lidar and ground-based dual Doppler Radar measurements of wind to detail the lower tropospheric flows in quiescent and stormy weather was conducted in central Oklahoma during four days in June-July 1981. Data from these unique remote sensing instruments, coupled with data from conventional in-situ facilities, i.e., 500-m meteorological tower, rawinsonde, and surface based sensors, were analyzed to enhance understanding of wind, waves and turbulence. The purposes of the study were to: (1) compare winds mapped by ground-based dual Doppler radars, airborne Doppler lidar, and anemometers on a tower; (2) compare measured atmospheric boundary layer flow with flows predicted by theoretical models; (3) investigate the kinematic structure of air mass boundaries that precede the development of severe storms; and (4) study the kinematic structure of thunderstorm phenomena (downdrafts, gust fronts, etc.) that produce wind shear and turbulence hazardous to aircraft operations. The report consists of three parts: Part 1, Intercomparison of Wind Data from Airborne Lidar, Ground-Based Radars and Instrumented 444 m Tower; Part 2, The Structure of the Convective Atmospheric Boundary Layer as Revealed by Lidar and Doppler Radars; and Part 3, Doppler Lidar Observations in Thunderstorm Environments

Nonlocal lattice fermion models on the 2d torus

Abelian fermion models described by the SLAC action are considered on a finite 2d lattice. It is shown that modification of these models by introducing additional Pauli - Villars regularization supresses nonlocal effects and provides agreement with the continuum results in vectorial U(1) models. In the case of chiral fermions the phase of the determinant differs from the continuum one.Comment: 16 pages, LaTeX, 5 eps figures, uses epsf.sty, rotate.st

Practical private database queries based on a quantum key distribution protocol

Private queries allow a user Alice to learn an element of a database held by a provider Bob without revealing which element she was interested in, while limiting her information about the other elements. We propose to implement private queries based on a quantum key distribution protocol, with changes only in the classical post-processing of the key. This approach makes our scheme both easy to implement and loss-tolerant. While unconditionally secure private queries are known to be impossible, we argue that an interesting degree of security can be achieved, relying on fundamental physical principles instead of unverifiable security assumptions in order to protect both user and database. We think that there is scope for such practical private queries to become another remarkable application of quantum information in the footsteps of quantum key distribution.Comment: 7 pages, 2 figures, new and improved version, clarified claims, expanded security discussio

On the Monadic Second-Order Transduction Hierarchy

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K). If we only consider classes of incidence structures we can completely describe the resulting hierarchy. It is linear of order type {\omega}+3. Each level can be characterised in terms of a suitable variant of tree-width. Canonical representatives of the various levels are: the class of all trees of height n, for each n \in N, of all paths, of all trees, and of all grids

An Algorithmic Approach to Quantum Field Theory

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice computation, including the Metropolis, the Gibbs sampling, the Minimal Residual, and the Stabilized Biconjugate inverters. The main emphasis is on gauge theories with fermions such as QCD. We also provide examples of typical results from lattice QCD computations for quantities of phenomenological interest.Comment: 44 pages, to be published in IJMP

Thermal Fluctuations of Elastic Filaments with Spontaneous Curvature and Torsion

We study the effects of thermal flucutations on thin elastic filaments with spontaneous curvature and torsion. We derive analytical expressions for the orientational correlation functions and for the persistence length of helices, and find that this length varies non-monotonically with the strength of thermal fluctuations. In the weak fluctuation regime, the persistence length of a spontaneously twisted helix has three resonance peaks as a function of the twist rate. In the limit of strong fluctuations, all memory of the helical shape is lost.Comment: 1 figur

Noncommuting Electric Fields and Algebraic Consistency in Noncommutative Gauge theories

We show that noncommuting electric fields occur naturally in $\theta$-expanded noncommutative gauge theories. Using this noncommutativity, which is field dependent, and a hamiltonian generalisation of the Seiberg-Witten Map, the algebraic consistency in the lagrangian and hamiltonian formulations of these theories, is established. A comparison of results in different descriptions shows that this generalised map acts as canonical transformation in the physical subspace only. Finally, we apply the hamiltonian formulation to derive the gauge symmetries of the action.Comment: 16 pages, LaTex, considerably expanded version with a new section on `Gauge symmetries'; To appear in Phys. Rev.

Power of Randomization in Automata on Infinite Strings

Probabilistic B\"uchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this paper, we present a number of results that clarify the power of such machines and properties of the languages they define. The broad themes we focus on are as follows. We present results on the decidability and precise complexity of the emptiness, universality and language containment problems for such machines, thus answering questions central to the use of these models in formal verification. Next, we characterize the languages recognized by PBAs topologically, demonstrating that though general PBAs can recognize languages that are not regular, topologically the languages are as simple as \omega-regular languages. Finally, we introduce Hierarchical PBAs, which are syntactically restricted forms of PBAs that are tractable and capture exactly the class of \omega-regular languages

Logics for Unranked Trees: An Overview

Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees