The paper proposes a new data hiding method based on deoxyribonucleic acid (DNA) coding, using the Word document as carrier. The plain message becomes a cipher sequence after being encoded to a DNA sequence and encrypted by the addition operation. The cipher sequence is attached to a random DNA primer sequence and circularly shifted for finite times, then hide the whole sequence into a Word doc...

In the present work, ternary special quasirandom structures SQSs for a fcc solid solution phase are generated at different compositions, xA=xB=xC= 1 3 and xA= 1 2 , xB=xC= 1 4 , whose correlation functions are satisfactorily close to those of a random fcc solution. The generated SQSs are used to calculate the mixing enthalpy of the fcc phase in the Ca-Sr-Yb system. It is observed that first-pri...

This paper develops properties of recurrence sequences defined from circulant matrices obtained from the characteristic polynomial of the Pell–Padovan sequence. The study of these sequences modulo m yields cyclic groups and semigroups from the generating matrices. Finally, we obtain the lengths of the periods of the extended sequences in the extended triangle groups E(2, n, 2), E(2, 2, n) and E...

It is well known that (i) for every irrational number α the Kronecker sequence mα (m = 1, . . . ,M) is equidistributed modulo one in the limit M → ∞, and (ii) closed horocycles of length l become equidistributed in the unit tangent bundle T1M of a hyperbolic surface M of finite area, as l → ∞. In the present paper both equidistribution problems are studied simultaneously: we prove that for any ...

Contents 1. Introduction 1 2. Randomness of point sequences mod 1 2 2.1. Distribution of gaps 4 2.2. Independent random variables 6 3. mα mod one 7 3.1. Geometry of Γ\G 9 3.2. Dynamics on Γ\G 10 3.3. Mixing and uniform distribution 12 4. √ mα mod one 14 4.1. The case α = 1 15 4.2. Some heuristics in the case α = √ 2 16 5. Ratner's theorem 19 5.1. Limit distributions of translates 19 5.2. Equidi...

The discrepancy of a sequence of pseudo-random numbers generated by the linear congruential method, both homogeneous and inhomogeneous, is estimated for parts of the period that are somewhat larger than the square root of the modulus. The analogous problem for an arbitrary linear congruential generator modulo a prime is also considered, the result being particularly interesting for maximal peri...

Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing scenarios, but also leads to ambiguities that can result in incomplete or inconsistent descriptions. One such problem is that of implied scenarios—a set of MSCs may imply new MSCs which are “locally consistent” with the given ...

Fix a base B and let X1, . . . , XN be independent identically distributed random variables. If the Xi’s are drawn from a uniform distribution, then as N → ∞ the distribution of the digits of the differences between adjacent Xi’s tends to a universal distribution which is almost Benford’s Law; we call this Almost Benford behavior. For each base we develop a rapidly convergent Fourier series exp...

In this paper we explore two themes in data structure design: amortized computational complexity and self-adjustment. We are motivated by the following observations. In most applications of data structures, we wish to perform not just a single operation but a sequence of operations, possibly having correlated behavior. By averaging the running time per operation over a worst-case sequence of op...