21 citations · 40 across the 12 of their papers we have counts for
13 papers
A Comparison of Random Task Graph Generation Methods for Scheduling Problems
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
How to generate instances with relevant properties and without bias remains an open problem of critical importance for a fair comparison of heuristics. In the context of scheduling…
An Approximation-based Approach for the Random Exploration of Large Models
Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model…
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
In high performance computing, scheduling of tasks and allocation to machines is very critical especially when we are dealing with heterogeneous execution costs. Simulations can be…
A Cryptographic Approach for Steganography
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Heam
In this research work, security concepts are formalized in steganography, and the common paradigms based on information theory are replaced by another ones inspired from cryptograp…
Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
Jean-François Couchot, Pierre-Cyrille Heam, Christophe Guyeux +2
This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The constr…
Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux +1
Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of th…
Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata
Pierre-Cyrille Héam, Jean-Luc Joly
This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate…
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism
Pierre-Cyrille Heam, Jean-Luc Joly
In this paper we address the problem of the uniform random generation of non deterministic automata (NFA) up to isomorphism. First, we show how to use a Monte-Carlo approach to uni…
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. Kouchnarenko
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…
Random Grammar-based Testing for Covering All Non-Terminals
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
In the context of software testing, generating complex data inputs is frequently performed using a grammar-based specification. For combinatorial reasons, an exhaustive generation…
Enhancing Approximations for Regular Reachability Analysis
Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mecha…
A Complexity Approach for Steganalysis
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Heam
In this proposal for the Journèes Codes et Stéganographie 2012, we define a new rigorous approach for steganalysis based on the complexity theory. It is similar to the definitions…
Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU
Jacques M. Bahi, Raphaël Couturier, Christophe Guyeux +1
In this paper we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven…