Zobrazeno 1 - 10
of 968
pro vyhledávání: '"P. Popoli"'
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which gives the
Externí odkaz:
http://arxiv.org/abs/2410.02409
Autor:
Popoli, Pierre, Stipulanti, Manon
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence possesses go
Externí odkaz:
http://arxiv.org/abs/2408.14059
Autor:
Mermoud, Dylan Laplace, Popoli, Pierre
Publikováno v:
EPTCS 403, 2024, pp. 128-133
In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in cooperative game theory, characterizes the existence of solutions to the game
Externí odkaz:
http://arxiv.org/abs/2406.16409
Autor:
Popoli, Pierre
The correlation measure of order $k$ is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4 is large for the Rudin-Shapiro sequence despite having nice pseudorand
Externí odkaz:
http://arxiv.org/abs/2306.10629
Autor:
M.R. Domenici, M.L. Scattoni, A. Martire, G. Lastoria, R.L. Potenza, A. Borioni, A. Venerosi, G. Calamandrei, P. Popoli
Publikováno v:
Neurobiology of Disease, Vol 28, Iss 2, Pp 197-205 (2007)
The effect of chronic treatment with the selective adenosine A2A receptor antagonist SCH 58261 on the behavioral and electrophysiological alterations typical of R6/2 mice (a transgenic mouse model of Huntington’s disease, HD), has been studied. Sta
Externí odkaz:
https://doaj.org/article/252b1b26cf9843a4bdc825f74f83d7ae
Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not be treated
Externí odkaz:
http://arxiv.org/abs/2203.05451
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly predictable desp
Externí odkaz:
http://arxiv.org/abs/2106.09959
Autor:
Popoli, Pierre
Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is large. These facts imply that these sequences are highly predictable des
Externí odkaz:
http://arxiv.org/abs/2011.03457
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.