Search results for " Computer science"
showing 10 items of 3983 documents
On local and global components of the air transportation network
2020
International audience
Adaptive Hardware Implementation for the Deblocking Filter Used in H.264/AVC Using System GeneratorEnter title
2016
International audience; Xilinx System Generator is a Matlab/Simulink high-level based design tool especially for the development of complex digital circuits using Hardware Description Language (HDL). In this paper we propose a high level model for the deblocking filter used in H.264/AVC using System Generator of Matlab/Simulink. Synthesis results are compared with implementations realized using RTL level. The proposed model allows for rapid edits of the architectures and permits the implementation of filters used in other standards and norms (HEVC for example). The proposed implementations are verified using Xilinx-Virtex5 platforms.
On the projective geometry of entanglement and contextuality
2019
Equivalence classes of Dyck paths modulo some statistics
2015
International audience; We investigate new equivalence relations on the set $\mathcal{D}_n$ of Dyck paths relatively to the three statistics of double rises, peaks and valleys. Two Dyck paths ar $r$-equivalent (resp. $p$-equivalent and $v$-equivalent) whenever the positions of their double rises (res. peaks and valleys) are the same. Then, we provide generating functions for the numbers of $r$-, $p$- and $v$-equivalence classes of $\mathcal{D}_n$.
On List Coloring with Separation of the Complete Graph and Set System Intersections
2022
We consider the following list coloring with separation problem: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|= a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $\varphi$ of sets of integers to the vertices of $G$ such that $\varphi(u)\subset L(u)$ and $|\varphi(v)|=b$ for any vertex $u$ and $\varphi(u)\cap \varphi(v)=\emptyset$ for any edge $uv$. Such a value of $c$ is called the separation number of $(G,a,b)$. Using a special partition of a set of lists for which we obtain an improved version of Poincar\'e's crible, we determine the separation number of the c…
Asymptotic bit frequency in Fibonacci words
2021
It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.
Fibonacci q-decreasing words: enumerative results and Gray codes
2022
Gray code for permutations with a fixed number of left-to-right minima
2013
International audience
Q-bonacci words and numbers
2022
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer we rediscover classical multi-step Fibonacci numbers: Fibonacci, Tribonacci, Tetranacci, etc. When $q$ is not an integer, obtained recurrence relations are connected to certain restricted integer compositions. We also discuss Gray codes for these words, and a possibly novel generalization of the golden ratio.
Packing coloring and subsets preserving path distance
2016
International audience