Results 11 to 20 of about 2,229,736 (291)
Stability of Characteristics of Physical Random Number Generators
The development of technologies leads to the need of revising the methods used to obtain cryptographic keys. The randomness parameters of sequences generated by physical random sequence generators are affected by the physical parameters of the recording ...
M. O. Pikuza +2 more
doaj +1 more source
The Asymptotic Number of Binary Codes and Binary Matroids [PDF]
12 ...
openaire +4 more sources
Antisquares and Critical Exponents [PDF]
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$.
Aseem Baranwal +5 more
doaj +1 more source
Fragile words have been already considered in the context of automata groups. Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words.
Daniele D'Angeli +2 more
doaj +1 more source
Generalised divisor sums of binary forms over number fields [PDF]
Estimating averages of Dirichlet convolutions $1 \ast \chi$, for some real Dirichlet character $\chi$ of fixed modulus, over the sparse set of values of binary forms defined over $\mathbb{Z}$ has been the focus of extensive investigations in recent years,
Frei, Christopher, Sofos, Efthymios
core +2 more sources
Enumeration of Binary Trees and Universal Types [PDF]
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number.
Charles Knessl, Wojciech Szpankowski
doaj +3 more sources
Alternative formulations to compute the binary shape Euler number
The authors propose two equations based on the pixel geometry and connectivity properties, which can be used to compute, efficiently, the Euler number of a binary digital image with either thick or thin boundaries.
Juan Humberto Sossa Azuela +5 more
doaj +1 more source
Congruences for the Apéry numbers modulo p³ [PDF]
Let {Aₙ'} be the Apéry numbers given by Aₙ'=\Σⁿₖ₌ₒ$binom{n}{k}$²$binom{n+k}{k}$. For any prime p≡3 (mod 4) we show that A'_{(p-1)/2}≡p²/3$binom{(p-3)/2}{(p-3)/4}$² (mod p³). Let {tₙ} be given by t₀=1, t₁=5 and tₙ₊₁=(8n²+12n+5)tₙ-4n²(2n+1)²tₙ₋₁ (n≥1).
Zhi-Hong Sun
doaj +1 more source
Modeling the travel distances of debris flows and debris slides: quantifying hillside morphology [PDF]
A travel distance model for debris flows and slides is presented based on information collected in southeast British Columbia, Canada. The model incorporates a variable that represents terrain morphology by a single number, quantification made using a ...
Bogdan Strimbu
doaj +3 more sources
Simple binary segmentation frameworks for identifying variation in DNA copy number
Background Variation in DNA copy number, due to gains and losses of chromosome segments, is common. A first step for analyzing DNA copy number data is to identify amplified or deleted regions in individuals.
Yang Tae Young
doaj +1 more source

