Results 21 to 30 of about 12,195,587 (376)
Stability of Characteristics of Physical Random Number Generators
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, 2023 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
Antisquares and Critical Exponents [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 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
Development of the Binary Number System and the Foundations of Computer Science
The Mathematics Enthusiast, 2014 This paper discusses the formalization of the binary number system and the groundwork that was laid for the future of digital circuitry, computers, and the field of computer science.
D. Lande
semanticscholar +1 more source
Enumeration of Binary Trees and Universal Types [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 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
Generalised divisor sums of binary forms over number fields [PDF]
, 2016 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
International Journal of Group Theory, 2020 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
Alternative formulations to compute the binary shape Euler number
IET Computer Vision, 2014 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]
Notes on Number Theory and Discrete MathematicsLet {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
On trees, tanglegrams, and tangled chains [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Tanglegrams are a class of graphs arising in computer science and in biological research on cospeciation and coevolution. They are formed by identifying the leaves of two rooted binary trees. The embedding of the trees in the plane is irrelevant for this
Sara Billey +2 more
doaj +1 more source
Modeling the travel distances of debris flows and debris slides: quantifying hillside morphology [PDF]
Annals of Forest Research, 2011 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