Home

Concept

Randomness test

Applied sciences
Computer engineering
Computer security
Pseudorandomness

About
Privacy
Disclaimer

Graph Chatbot

Related publications (26)

Page 1 of 2

Social Opinion Formation and Decision Making Under Communication Trends

Ali H. Sayed, Virginia Bordignon, Mert Kayaalp

This work studies the learning process over social networks under partial and random information sharing. In traditional social learning models, agents exchange full belief information with each other while trying to infer the true state of nature. We stud ...

Ieee-Inst Electrical Electronics Engineers Inc2024

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

Sudong Lee

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

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator

Edoardo Charbon, Francesco Gramuglia, Pouyan Keshavarzian

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Emergence of Classical Magnetic Order from Anderson Towers: Quantum Darwinism in Action

Frédéric Mila

Environment is assumed to play a negative role in quantum mechanics, destroying the coherence in a quantum system and, thus, randomly changing its state. However, for a quantum system that is initially in a degenerate ground state, the situation could be d ...

American Physical Society2023

Gradient-based optimisation of the conditional-value-at-risk using the multi-level Monte Carlo method

Fabio Nobile, Sundar Subramaniam Ganesh

In this work, we tackle the problem of minimising the Conditional-Value-at-Risk (CVaR) of output quantities of complex differential models with random input data, using gradient-based approaches in combination with the Multi-Level Monte Carlo (MLMC) method ...

2023

OptTTA: Learnable Test-Time Augmentation for Source-Free Medical Image Segmentation Under Domain Shift

Jean-Philippe Thiran, Seyedbehzad Bozorgtabar, Guillaume Marc Georges Vray, Devavrat Tomar

As distribution shifts are inescapable in realistic clinical scenarios due to inconsistencies in imaging protocols, scanner vendors, and across different centers, well-trained deep models incur a domain generalization problem in unseen environments. Despit ...

PMLR2022

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

Edoardo Charbon, Claudio Bruschini, Ivan Michel Antolovic

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

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

Automatic Content Curation of Visual Heritage

Mathieu Salzmann, Frédéric Kaplan, Nicolas Henchoz, Delphine Ribes Lemay, Lara Jacqueline Défayes, André Viegas Andrade

Digitization and preservation of large heritage induce high maintenance costs to keep up with the technical standards and ensure sustainable access. Creating impactful usage is instrumental to justify the resources for long-term preservation. The Museum fü ...

2021

Further Results on Efficient Implementations of Block Cipher Linear Layers

Subhadeep Banik

At the FSE conference of ToSC 2018, Kranz et al. presented their results on shortest linear programs for the linear layers of several well known block ciphers in literature. Shortest linear programs are essentially the minimum number of 2-input xor gates r ...

2021

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

New Graph Algorithms via Polyhedral Techniques

Jakub Tarnawski

In this thesis we give new algorithms for two fundamental graph problems. We develop novel ways of using linear programming formulations, even exponential-sized ones, to extract structure from problem instances and to guide algorithms in making progress. S ...

EPFL2019

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

Deterministic Algorithms for Submodular Maximization Problems

Moran Feldman

Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area, most algorithms are randomized, and in almost all c ...

ASSOC COMPUTING MACHINERY2018

Multilevel tensor approximation of PDEs with random data

Daniel Kressner, Jonas Ballani, Michael Dieter Peters

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parame ...

Springer2017

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

Privacy-Friendly Photo Sharing and Relevant Applications Beyond

Lin Yuan

Popularization of online photo sharing brings people great convenience, but has also raised concerns for privacy. Researchers proposed various approaches to enable image privacy, most of which focus on encrypting or distorting image visual content. In this ...

EPFL2017

Multi-index Stochastic Collocation for random PDEs

Fabio Nobile, Lorenzo Tamellini

In this work we introduce the Multi-Index Stochastic Collocation method (MISC) for computing statistics of the solution of a PDE with random data. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the ...

2016

Multilevel and weighted reduced basis method for stochastic optimal control problems constrained by Stokes equations

Alfio Quarteroni, Gianluigi Rozza, Peng Chen

In this paper we develop and analyze a multilevel weighted reduced basis method for solving stochastic optimal control problems constrained by Stokes equations. We prove the analytic regularity of the optimal solution in the probability space under certain ...

Springer2016

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