Results 11 to 20 of about 566,670 (285)
"Exotic" binary number systems for rings of Gauss and Eisenstein integers [PDF]
The paper considers nonstandard binary number systems for rings of Gauss and Eisenstein integers. The principal difference ("exoticism") of such number systems from the canonical number systems introduced by I.
Vladimir Chernov
doaj +1 more source
High-Speed Binary-to-Residue Converter Design Using 2-Bit Segmentation of the Input Word
In this paper a new approach to the design of the high-speed binary-to-residue converter is proposed that allows the attaining of high pipelining rates by eliminating memories used in modulo m generators. The converter algorithm uses segmentation of the
Robert Smyk, Maciej Czyżak
doaj +1 more source
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 number of binary rotation words [PDF]
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov in ...
Frid, Anna E., Jamet, Damien
openaire +5 more sources
Function argument number identification in stripped binary under PPC and MIPS instruction set
The identification of the number of function argument contributes to the recovery of the function prototype and is the basis for data flow analysis and other security analysis. In order to improve the accuracy of the recognition of the number of function
YIN Xiaokang, LIU Liu, LIU Long, LIU Shengli
doaj +3 more sources
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
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
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
On trees, tanglegrams, and tangled chains [PDF]
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
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