Cataclysmic Variables and Other Compact Binaries in the Globular Cluster NGC 362: Candidates from Chandra and HST

Highly sensitive and precise X-ray imaging from Chandra, combined with the superb spatial resolution of HST optical images, dramatically enhances our empirical understanding of compact binaries such as cataclysmic variables and low mass X-ray binaries, their progeny, and other stellar X-ray source populations deep into the cores of globular clusters. Our Chandra X-ray images of the globular cluster NGC 362 reveal 100 X-ray sources, the bulk of which are likely cluster members. Using HST color-magnitude and color-color diagrams, we quantitatively consider the optical content of the NGC 362 Chandra X-ray error circles, especially to assess and identify the compact binary population in this condensed-core globular cluster. Despite residual significant crowding in both X-rays and optical, we identify an excess population of H{\alpha}-emitting objects that is statistically associated with the Chandra X-ray sources. The X-ray and optical characteristics suggest that these are mainly cataclysmic variables, but we also identify a candidate quiescent low mass X-ray binary. A potentially interesting and largely unanticipated use of observations such as these may be to help constrain the macroscopic dynamic state of globular clusters.Comment: 6 pages, 6 figures, to appear in the proceedings of the conference "Binary Star Evolution: Mass Loss, Accretion, and Mergers," Mykonos, Greece, June 22-25, 201

On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms

We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$ variables, with high probability, any such algorithm requires $\Omega(\rho \log(m)/\epsilon^2)$ iterations to compute a $(1+\epsilon)$-approximate solution, where $\rho$ is the width of the input. The bound is tight for a range of the parameters $(m,n,\rho,\epsilon)$. The algorithms in the class include Dantzig-Wolfe decomposition, Benders' decomposition, Lagrangean relaxation as developed by Held and Karp [1971] for lower-bounding TSP, and many others (e.g. by Plotkin, Shmoys, and Tardos [1988] and Grigoriadis and Khachiyan [1996]). To prove the bound, we use a discrepancy argument to show an analogous lower bound on the support size of $(1+\epsilon)$-approximate mixed strategies for random two-player zero-sum 0/1-matrix games

Linearity in the non-deterministic call-by-value setting

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity present in such formalisms. After proving the subject reduction and the strong normalisation properties, we propose a translation of this calculus into the System F with pairs, which corresponds to a non linear fragment of linear logic. The translation provides a deeper understanding of the linearity in our setting.Comment: 15 pages. To appear in WoLLIC 201

Call-by-value non-determinism in a linear logic type discipline

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction

Evolution on a Rugged Landscape:Pinning and Aging

Population dynamics on a rugged landscape is studied analytically and numerically within a simple discrete model for evolution of N individuals in one-dimensional fitness space. We reduce the set of master equations to a single Fokker-Plank equation which allows us to describe the dynamics of the population in terms of thermo-activated Langevin diffusion of a single particle in a specific random potential. We found that the randomness in the mutation rate leads to pinning of the population and on average to a logarithmic slowdown of the evolution, resembling aging phenomenon in spin glass systems. In contrast, the randomness in the replication rate turns out to be irrelevant for evolution in the long-time limit as it is smoothed out by increasing ``evolution temperature''. The analytic results are in a good agreement with numerical simulations.Comment: 4 pages, 3 figures, submitted to Phys. Rev. Let

On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models

In this report, we explore the use of a quantum optimization algorithm for obtaining low energy conformations of protein models. We discuss mappings between protein models and optimization variables, which are in turn mapped to a system of coupled quantum bits. General strategies are given for constructing Hamiltonians to be used to solve optimization problems of physical/chemical/biological interest via quantum computation by adiabatic evolution. As an example, we implement the Hamiltonian corresponding to the Hydrophobic-Polar (HP) model for protein folding. Furthermore, we present an approach to reduce the resulting Hamiltonian to two-body terms gearing towards an experimental realization.Comment: 35 pages, 8 figure

Kripke Semantics for Martin-L\"of's Extensional Type Theory

It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of interpretations of dependent type theory, i.e., to show that the interpretations of equal expressions are indeed equal. Several classes of models have been used to remedy this problem. We contribute to this investigation by giving a semantics that is standard, coherent, and sufficiently general for completeness while remaining relatively easy to compute with. Our models interpret types of Martin-L\"of's extensional dependent type theory as sets indexed over posets or, equivalently, as fibrations over posets. This semantics can be seen as a generalization to dependent type theory of the interpretation of intuitionistic first-order logic in Kripke models. This yields a simple coherent model theory, with respect to which simple and dependent type theory are sound and complete

A computational group theoretic symmetry reduction package for the SPIN model checker

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSpin, a fully automatic symmetry reduction package for the Spin model checker. TopSpin uses the Gap computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying automorphism groups as a disjoint/wreath product of subgroups. We present encouraging experimental results for a variety of Promela examples

On Linear Information Systems

Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information systems, providing a model of intuitionistic linear logic (a new-Seely category), with a "set-theoretic" interpretation of exponentials that recovers Scott continuous functions via the co-Kleisli construction. From a domain theoretic point of view, linear information systems are equivalent to prime algebraic Scott domains, which in turn generalize prime algebraic lattices, already known to provide a model of classical linear logic

Compilation of extended recursion in call-by-value functional languages

This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be correct.Comment: 62 pages, uses pi