The growth pattern and seasonal weight fluctuations of feral raccoons in Hokkaido were evaluated between 1999 and 2001. The growth rates in body length and body weight were described for juveniles (young of the year) and yearlings (animals born in the previous season) using the Gompertz growth model. The asymptotic body sizes for males were greater than those for females. Young raccoons born du...

In this paper, overlapped circular spatially-coupled low-density parity-check codes (OC-LDPC) are proposed and their modified coupled codes are derived, which show better performance compared with the spatially-coupled low-density parity-check (SC-LDPC) codes. It is known that the SC-LDPC codes show asymptotically good performance when the chain length is sufficiently large. However, a large ch...

Many microorganisms swim in a highly heterogeneous environment with obstacles such as fibers or polymers. To better understand how this environment affects microorganism swimming, we study propulsion of a cylinder or filament in a fluid with a sparse, stationary network of obstructions modeled by the Brinkman equation. The mathematical analysis of swimming speeds is investigated by studying an ...

We study the asymptotic-capacity-achieving score function that was recently proposed by Oosterwijk et al. for bias-based traitor tracing codes. For the bias function we choose the Dirichlet distribution with a cutoff. Using Bernstein’s inequality and Bennett’s inequality, we upper bound the false positive and false negative error probabilities. From these bounds we derive sufficient conditions ...

Abstract. In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGRtree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST bui...

Motivated by applications in universal data compression algorithms we study the problem of bounds on the sizes of constant weight covering codes. We are concerned with the minimal sizes of codes of length n and constant weight u such that every word of length n and weight v is within Hamming distance d from a codeword. In addition to a brief summary of part of the relevant literature, we also g...

The growth pattern and seasonal weight fluctuations of feral raccoons in Hokkaido were evaluated between 1999 and 2001. The growth rates inbody length and body weight were described for juveniles (young of the year) and yearlings (animals born in the previous season) using the Gompertz growth model. The asymptotic body sizes for males were greater than those for females. Young raccoons born dur...

In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail...

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of ”typical” connected components for different ways of sampling them...

Motivated by applications in bioinformatics, we consider the word collector problem, i.e. the expected number of calls to a random weighted generator of words of length n before the full collection is obtained. The originality of this instance of the non-uniform coupon collector lies in the, potentially large, multiplicity of the words/coupons of a given probability/composition. We obtain a gen...