Large distance expansion of Mutual Information for disjoint disks in a free scalar theory

We compute the next-to-leading order term in the long-distance expansion of the mutual information for free scalars in three space-time dimensions. The geometry considered is two disjoint disks separated by a distance $r$ between their centers. No evidence for non-analyticity in the R\'enyi parameter $n$ for the continuation $n \rightarrow 1$ in the next-to-leading order term is found.Comment: 15 pages, This version contains few extra references, some technical material has been move to appendices, and other minor modifications to match with the version accepted for publicatio

FARM-LEVEL AND MACROECONOMIC DETERMINANTS OF FARM CREDIT MIGRATION RATES

Probit regression techniques are used to identify factors affecting rates of farm credit migration. Macroeconomic factors, such as economic growth signals and money supply increments, increase class upgrade probabilities. Interest rates, a lender's credit rationing and risk management tool, negatively affect such probabilities.Agricultural Finance,

Design of an RSFQ Control Circuit to Observe MQC on an rf-SQUID

We believe that the best chance to observe macroscopic quantum coherence (MQC) in a rf-SQUID qubit is to use on-chip RSFQ digital circuits for preparing, evolving and reading out the qubit's quantum state. This approach allows experiments to be conducted on a very short time scale (sub-nanosecond) without the use of large bandwidth control lines that would couple environmental degrees of freedom to the qubit thus contributing to its decoherence. In this paper we present our design of a RSFQ digital control circuit for demonstrating MQC in a rf-SQUID. We assess some of the key practical issues in the circuit design including the achievement of the necessary flux bias stability. We present an "active" isolation structure to be used to increase coherence times. The structure decouples the SQUID from external degrees of freedom, and then couples it to the output measurement circuitry when required, all under the active control of RSFQ circuits. Research supported in part by ARO grant # DAAG55-98-1-0367.Comment: 4 pages. More information and publications at http://www.ece.rochester.edu:8080/users/sde/research/publications/index.htm

State-Based Implicit Coordination and Applications

In air traffic management, pairwise coordination is the ability to achieve separation requirements when conflicting aircraft simultaneously maneuver to solve a conflict. Resolution algorithms are implicitly coordinated if they provide coordinated resolution maneuvers to conflicting aircraft when only surveillance data, e.g., position and velocity vectors, is periodically broadcast by the aircraft. This paper proposes an abstract framework for reasoning about state-based implicit coordination. The framework consists of a formalized mathematical development that enables and simplifies the design and verification of implicitly coordinated state-based resolution algorithms. The use of the framework is illustrated with several examples of algorithms and formal proofs of their coordination properties. The work presented here supports the safety case for a distributed self-separation air traffic management concept where different aircraft may use different conflict resolution algorithms and be assured that separation will be maintained

Time of Closest Approach in Three-Dimensional Airspace

In air traffic management, the aircraft separation requirement is defined by a minimum horizontal distance and a minimum vertical distance that the aircraft have to maintain. Since this requirement defines a cylinder around each aircraft rather than a sphere, the three-dimensional Euclidean distance does not provide an appropriate basis for the definition of time of closest approach. For instance, conflicting aircraft are not necessarily in loss of separation at the time of closest three-dimensional Euclidean distance. This paper proposes a definition of time of closest approach that characterizes conflicts in a three-dimensional airspace. The proposed time is defined as the time that minimizes a distance metric called cylindrical norm. An algorithm that computes the time of closest approach between two aircraft is provided and the formal verification of its main properties is reported