We study new probabilistic models for signals in DNA. Our models allow dependencies between multiple non-adjacent positions, in a generative model we call a higher-order tree. Computing the model of maximum likelihood is equivalent in our context to computing a minimum directed spanning hypergraph, a problem we show is NP-complete.

By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known

. This paper presents cache performance data for blocked programs and evaluates several optimizations to improve this performance. The data is obtained by a theoretical model of data conflicts in the cache, which has been validated by large amounts of simulation. We show that the degree of cache interference

is concerned with the last of these. The basic principle is easily stated.' A commodity should be produced if the costs can be covered by the sum of revenues and a properly defined measure of consumer's surplus. The optimum amount is then found by equating the demand price and the marginal cost

Abstract. We consider finite time blowup solutions of the L 2 critical focusing nonlinear Schrödinger equation on R 2. A perturbation analysis exploiting a representation forumla and asymptotic orthogonality properties obtained by Merle and Vega shows that a fixed amount of L 2 mass

, it implies that the tail probability sequence P{D # n} is asymptotically a geometric sequence. Our result helps to understand some stochastic phenomena in applications. For example, for a decoder with fixed amount of storage, its frame-dropping time can be formulated as in this model. Our result provides

ABSTRACT This work compares two different approaches for obtaining numerical solutions for laminar natural convection within a square cavity, which is filled by a fixed amount of a solid conducting material. The first model considered, namely, porous-continuum model, is based on the assumption

We describe ways in which the transmission control protocol of the Internet may evolve to support heterogeneous applications. We show that by appropriately marking packets at overloaded resources and by charging a fixed small amount for each mark received, end-nodes are provided with the necessary

Please note that numbering and editorial changes were made to ADS 317 for DR-CD 9. The changes are reflected below.

showing that a number of simple solutions based on cached counters and classical sampling do not work, we describe two novel and scalable schemes for this purpose which take a constant number of memory references per packet and use a small amount of memory. Further, unlike NetFlow estimates, we have