Comparing hierarchies of total functionals

In this paper we consider two hierarchies of hereditarily total and continuous functionals over the reals based on one extensional and one intensional representation of real numbers, and we discuss under which asumptions these hierarchies coincide. This coincidense problem is equivalent to a statement about the topology of the Kleene-Kreisel continuous functionals. As a tool of independent interest, we show that the Kleene-Kreisel functionals may be embedded into both these hierarchies.Comment: 28 page

Hilbert-Post completeness for the state and the exception effects

In this paper, we present a novel framework for studying the syntactic completeness of computational effects and we apply it to the exception effect. When applied to the states effect, our framework can be seen as a generalization of Pretnar's work on this subject. We first introduce a relative notion of Hilbert-Post completeness, well-suited to the composition of effects. Then we prove that the exception effect is relatively Hilbert-Post complete, as well as the "core" language which may be used for implementing it; these proofs have been formalized and checked with the proof assistant Coq.Comment: Siegfried Rump (Hamburg University of Technology), Chee Yap (Courant Institute, NYU). Sixth International Conference on Mathematical Aspects of Computer and Information Sciences , Nov 2015, Berlin, Germany. 2015, LNC

Online Admission Control and Embedding of Service Chains

The virtualization and softwarization of modern computer networks enables the definition and fast deployment of novel network services called service chains: sequences of virtualized network functions (e.g., firewalls, caches, traffic optimizers) through which traffic is routed between source and destination. This paper attends to the problem of admitting and embedding a maximum number of service chains, i.e., a maximum number of source-destination pairs which are routed via a sequence of to-be-allocated, capacitated network functions. We consider an Online variant of this maximum Service Chain Embedding Problem, short OSCEP, where requests arrive over time, in a worst-case manner. Our main contribution is a deterministic O(log L)-competitive online algorithm, under the assumption that capacities are at least logarithmic in L. We show that this is asymptotically optimal within the class of deterministic and randomized online algorithms. We also explore lower bounds for offline approximation algorithms, and prove that the offline problem is APX-hard for unit capacities and small L > 2, and even Poly-APX-hard in general, when there is no bound on L. These approximation lower bounds may be of independent interest, as they also extend to other problems such as Virtual Circuit Routing. Finally, we present an exact algorithm based on 0-1 programming, implying that the general offline SCEP is in NP and by the above hardness results it is NP-complete for constant L.Comment: early version of SIROCCO 2015 pape

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

A systematically coarse-grained model for DNA, and its predictions for persistence length, stacking, twist, and chirality

We introduce a coarse-grained model of DNA with bases modeled as rigid-body ellipsoids to capture their anisotropic stereochemistry. Interaction potentials are all physicochemical and generated from all-atom simulation/parameterization with minimal phenomenology. Persistence length, degree of stacking, and twist are studied by molecular dynamics simulation as functions of temperature, salt concentration, sequence, interaction potential strength, and local position along the chain, for both single- and double-stranded DNA where appropriate. The model of DNA shows several phase transitions and crossover regimes in addition to dehybridization, including unstacking, untwisting, and collapse which affect mechanical properties such as rigidity and persistence length. The model also exhibits chirality with a stable right-handed and metastable left-handed helix.Comment: 30 pages, 20 figures, Supplementary Material available at http://www.physics.ubc.ca/~steve/publications.htm

On Probabilistic Applicative Bisimulation and Call-by-Value λ\lambda-Calculi (Long Version)

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more surprisingly, full-abstraction only holds in a symmetric setting.Comment: 30 page

Syntax for free: representing syntax with binding using parametricity

We show that, in a parametric model of polymorphism, the type ∀ α. ((α → α) → α) → (α → α → α) → α is isomorphic to closed de Bruijn terms. That is, the type of closed higher-order abstract syntax terms is isomorphic to a concrete representation. To demonstrate the proof we have constructed a model of parametric polymorphism inside the Coq proof assistant. The proof of the theorem requires parametricity over Kripke relations. We also investigate some variants of this representation

Sound and complete axiomatizations of coalgebraic language equivalence

Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powerset construction that determinises coalgebras. We show that soundness and completeness are established by proving that expressions modulo axioms of a calculus form the rational fixpoint of the given type functor. Our main result is that the rational fixpoint of the functor $FT$, where $T$ is a monad describing the branching of the systems (e.g. non-determinism, weights, probability etc.), has as a quotient the rational fixpoint of the "determinised" type functor $\bar F$, a lifting of $F$ to the category of $T$-algebras. We apply our framework to the concrete example of weighted automata, for which we present a new sound and complete calculus for weighted language equivalence. As a special case, we obtain non-deterministic automata, where we recover Rabinovich's sound and complete calculus for language equivalence.Comment: Corrected version of published journal articl