Photon reabsorption in fluorescent solar collectors

Understanding photon transport losses in fluorescence solar collectors is very important for increasing optical efficiencies. We present an analytical expression to characterize photon reabsorption in fluorescent solar collectors, which represent a major source of photon loss. A particularly useful universal form of this expression is found in the limit of high reabsorption, which gives the photon reabsorption probability in a simple form as a function of the absorption coefficient and the optical étendue of the emitted photon beam. Our mathematical model predicts fluorescence spectra emitted from the collector edge, which are in excellent agreement with experiment and provide an effective characterization tool for photon transport in light absorbing media

A feasible algorithm for typing in Elementary Affine Logic

We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time.Comment: 20 page

Distribution-based bisimulation for labelled Markov processes

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribution bisimulation and discuss linearity, continuity and compositional properties.Comment: Accepted by FORMATS 201

Searching for Signatures of Cosmic Superstrings in the CMB

Because cosmic superstrings generically form junctions and gauge theoretic strings typically do not, junctions may provide a signature to distinguish between cosmic superstrings and gauge theoretic cosmic strings. In cosmic microwave background anisotropy maps, cosmic strings lead to distinctive line discontinuities. String junctions lead to junctions in these line discontinuities. In turn, edge detection algorithms such as the Canny algorithm can be used to search for signatures of strings in anisotropy maps. We apply the Canny algorithm to simulated maps which contain the effects of cosmic strings with and without string junctions. The Canny algorithm produces edge maps. To distinguish between edge maps from string simulations with and without junctions, we examine the density distribution of edges and pixels crossed by edges. We find that in string simulations without Gaussian noise (such as produced by the dominant inflationary fluctuations) our analysis of the output data from the Canny algorithm can clearly distinguish between simulations with and without string junctions. In the presence of Gaussian noise at the level expected from the current bounds on the contribution of cosmic strings to the total power spectrum of density fluctuations, the distinction between models with and without junctions is more difficult. However, by carefully analyzing the data the models can still be differentiated.Comment: 15 page

Space-Time Evolution of the Oscillator, Rapidly moving in a random media

We study the quantum-mechanical evolution of the nonrelativistic oscillator, rapidly moving in the media with the random vector fields. We calculate the evolution of the level probability distribution as a function of time, and obtain rapid level diffusion over the energy levels. Our results imply a new mechanism of charmonium dissociation in QCD media.Comment: 32 pages, 13 figure

Process algebra modelling styles for biomolecular processes

We investigate how biomolecular processes are modelled in process algebras, focussing on chemical reactions. We consider various modelling styles and how design decisions made in the definition of the process algebra have an impact on how a modelling style can be applied. Our goal is to highlight the often implicit choices that modellers make in choosing a formalism, and illustrate, through the use of examples, how this can affect expressability as well as the type and complexity of the analysis that can be performed

Syntactic Markovian Bisimulation for Chemical Reaction Networks

In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of probabilistic bisimulation, defined over the structure of a CRN rather than over its underlying CTMC. SMB identifies a lumpable partition of the CTMC state space a priori, in the sense that it is an equivalence relation over species implying that two CTMC states are lumpable when they are invariant with respect to the total population of species within the same equivalence class. We develop an efficient partition-refinement algorithm which computes the largest SMB of a CRN in polynomial time in the number of species and reactions. We also provide an algorithm for obtaining a quotient network from an SMB that induces the lumped CTMC directly, thus avoiding the generation of the state space of the original CRN altogether. In practice, we show that SMB allows significant reductions in a number of models from the literature. Finally, we study SMB with respect to the deterministic semantics of CRNs based on ordinary differential equations (ODEs), where each equation gives the time-course evolution of the concentration of a species. SMB implies forward CRN bisimulation, a recently developed behavioral notion of equivalence for the ODE semantics, in an analogous sense: it yields a smaller ODE system that keeps track of the sums of the solutions for equivalent species.Comment: Extended version (with proofs), of the corresponding paper published at KimFest 2017 (http://kimfest.cs.aau.dk/

Annotations for Rule-Based Models

The chapter reviews the syntax to store machine-readable annotations and describes the mapping between rule-based modelling entities (e.g., agents and rules) and these annotations. In particular, we review an annotation framework and the associated guidelines for annotating rule-based models of molecular interactions, encoded in the commonly used Kappa and BioNetGen languages, and present prototypes that can be used to extract and query the annotations. An ontology is used to annotate models and facilitate their description

Biochemical Reaction Rules with Constraints

International audienceWe propose React(C), an expressive programming language for stochastic modeling and simulation in systems biology, that is based on biochemical reactions with constraints. We prove that React(C) can express the stochastic pi-calculus, in contrast to previous rule-based programming languages, and further illustrate the high expressiveness of React(C). We present a stochastic simulator for React(C) independently of the choice of the constraint language C. Our simulator must decide for a given reaction rule whether it can be applied to the current biochemical solution. We show that this decision problem is NP-complete for arbitrary constraint systems C, and that it can be solved in polynomial time for rules of bounded arity. In practice, we propose to solve this problem by constraint programming

GaSb quantum rings in GaAs/AlxGa1−xAs quantum wells

We report the results of continuous and time-resolved photoluminescence measurements on type-II GaSb quantum rings embedded within GaAs/AlxGa1-xAs quantum wells. A range of samples were grown with different well widths, compensation-doping concentrations within the wells, and number of quantum-ring layers. We find that each of these variants have no discernible effect on the radiative recombination, except for the very narrowest (5 nm) quantum well. In contrast, singleparticle numerical simulations of the sample predict changes in photoluminescence energy of up to 200 meV. This remarkable difference is explained by the strong Coulomb binding of electrons to rings that are multiply charged with holes. The resilience of the emission to compensation doping indicates that multiple hole occupancy of the quantum rings is required for efficient carrier recombination, regardless of whether these holes come from doping or excitation