Publications related to Statistical randomness

Exploration-based model learning with self-attention for risk-sensitive robot control

Model-based reinforcement learning for robot control offers the advantages of overcoming concerns on data collection and iterative processes for policy improvement in model-free methods. However, both methods use exploration strategy relying on heuristics ...

2023

Certification of the efficient random number generation technique based on single-photon detector arrays and time-to-digital converters

Edoardo Charbon, Samuel Burri

True random number generators (TRNGs) allow the generation of true random bit sequences, guaranteeing the unpredictability and perfect balancing of the generated values. TRNGs can be realised from the sampling of quantum phenomena, for instance, the detect ...

Wiley2021

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Edoardo Charbon, Claudio Bruschini, Ivan Michel Antolovic, Mario Stipcevic

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

SPIE2021

Design using randomness: a new dimension for metallurgy

William Curtin

High entropy alloys add a new dimension, atomic-scale randomness and the associated scale-dependent composition fluctuations, to the traditional metallurgical axes of time-temperature-composition-microstructure. Alloy performance is controlled by the energ ...

2020

Efficient random number generation techniques for CMOS single-photon avalanche diode array exploiting fast time tagging units

Edoardo Charbon, Samuel Burri

This work presents a technique to produce random bits by exploiting single-photon time of arrival. Two quantum random number generator (QRNG) devices based on the field programmable gate array (FPGA) technology are presented: Randy, which uses one discrete ...

AMER PHYSICAL SOC2020

Subthreshold Logic for Low-Area and Energy Efficient True Random Number Generator

Maher Kayal, Stéphane Christian Olivier Terrier, Mathieu Yves Hervé Coustans, Thomas Eberhardt, Laurent Fesquet

This paper discusses the advantages of subthreshold logic for True Random Number Generators (TRNG). In this work, the entropy is modeled, and a lower bound of Shannon's entropy per output bit can quickly be estimated. Thanks to this model, sizing TRNGs in ...

IEEE2018

Neuronal morphologies: the shapes of thoughts

Lida Kanari

The mammalian brain, one of the most fascinating systems in nature, is a complex biological structure that has kept scientists busy for over a century. Many of the brain's mysteries have been unraveled due to the enormous efforts of the scientific communit ...

EPFL2018

Quasi-random numbers for copula models

Mathieu Jacques David Cambou

The present work addresses the question how sampling algorithms for commonly applied copula models can be adapted to account for quasi-random numbers. Besides sampling methods such as the conditional distribution method (based on a one-to-one transformatio ...

Springer2017

Unraveling Brittle-Fracture Statistics from Intermittent Patterns Formed During Femtosecond Laser Exposure

Yves Bellouard, Max-Olivier Hongler, Christos Edouardos Athanasiou

Femtosecond-laser-written patterns at the surface of brittle materials may show at random times spontaneous alternations from regular to disordered structures and vice versa. Here, we show that these random transitions carry relevant statistical informatio ...

American Physical Society (APS)2017

Nematodynamics and random homogenization

Tudor Ratiu

We study the homogenization problem for the system of equations of dynamics of a mixture of liquid crystals with random structure. We consider a simplified form of the Ericksen-Leslie equations for an incompressible medium with inhomogeneous density with r ...

Taylor & Francis2016

Reducing Randomness in Matrix Models for Wireless Communication

Marc Desgroseilliers

Pushed by the proliferation of antennas and of multiuser scenarios, matrices with random entries are appearing more and more frequently in information theory. This leads to the study of matrix channels, where the capacity depends on the distribution of the ...

EPFL2015

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

Masking vs. Multiparty Computation: How Large Is the Gap for AES?

Sebastian Faust

In this paper, we evaluate the performances of state-of-the art higher-order masking schemes for the AES. Doing so, we pay a particular attention to the comparison between specialized solutions introduced exclusively as countermeasures against side-channel ...

2013

Compressibility of Deterministic and Random Infinite Sequences

Michaël Unser, Arash Amini

We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of ...

IEEE2011

The relative contributions of private information sharing and public information releases to information aggregation

Semyon Malamud, Darrell Duffie

We calculate learning rates when agents are informed through public and private observation of other agents' actions. We characterize the evolution of the distribution of posterior beliefs. If the private learning channel is present, convergence of the dis ...

Elsevier2010

Applications of Derandomization Theory in Coding

Mahdi Cheraghchi Bashi Astaneh

Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...

EPFL2010

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Jongho Shin, Byung Jun Joo

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while the ...

2009

The arcsine law as a universal aging scheme for trap models

Jiri Cerny

We give a general proof of aging for trap models using the arcsine law for stable subordinators. This proof is based on abstract conditions on the potential theory of the underlying graph and on the randomness of the trapping landscape. We apply this proof ...

2008

Cryptanalysis of an E0-like Combiner with Memory

Serge Vaudenay, Yi Lu

In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output sequences (up to certain bits). An upper bound of the correlations is given, wh ...

2008

Validation of Experts Versus Atlas-Based and Automatic Registration Methods for Subthalamic Nucleus Targeting on MRI

Jean-Philippe Thiran, Olivier Cuisenaire, Francisco Javier Sanchez Castro

Objects. In functional stereotactic neurosurgery, one of the cornerstones upon which the success and the operating time depends is an accurate targeting. The subthalamic nucleus (STN) is the usual target involved when applying Deep Brain Stimulation (DBS) ...

2006