We discuss how information encoded in a template polymer can be stochastically copied into a copy polymer. We consider four different stochastic copy protocols of increasing complexity, inspired by building blocks of the mRNA translation pathway. In the first protocol, monomer incorporation occurs in a single stochastic transition. We then move to a more elaborate protocol in which an intermedi...

W. Wu,1 J. B. Zhu2 and J. Zhao1 1Ecole Polytechnique Fédérale de Lausanne (EPFL), School of Architecture, Civil and Environmental Engineering, Laboratory of Rock Mechanics (LMR), CH-1015 Lausanne, Switzerland. E-mail: [email protected] 2 Graduate Aeronautical Laboratories and Department of Mechanical and Civil Engineering, Division of Engineering and Applied Sciences, California Institute of Techn...

We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan 13] and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an oo-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive ...

We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (1985) and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an o -line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competiti...

The detectability of planetesimal impacts on imaged exoplanets can be measured using Jupiter during the 1994 comet Shoemaker-Levy 9 events as a proxy. By integrating the whole planet flux with and without impact spots, the effect of the impacts at wavelengths from 2 4 μm is revealed. Jupiter’s reflected light spectrum in the near-infrared is dominated by its methane opacity including a deep ban...

In this paper we present a multi-class extension to our approach for modelling out-of-vocabulary (OOV) words [1]. Instead of augmenting the word search space with a single OOV model, we add several OOV models, one for each class of words. We present two approaches for designing the OOV word classes. The first approach relies on using common part-of-speech tags. The second approach is a data-dri...

The maxima-finding is a fundamental problem in computational geometry with many applications. In this paper, a volume first maxima-finding algorithm is proposed. It is proved that the expected running time of the algorithm is N + o(N) when choosing points from CI distribution, which is a new theoretical result when the points belong to d(>2) dimensional space. Experimental results and theoretic...