Concept

Applications of randomness

Publications associées (9)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Modelling and design of CMOS SPAD sensors for quantum random number generation

Pouyan Keshavarzian

Modern digital connectivity has necessitated the creation of robust methods for securely storing and transferring data. At the heart of all security infrastructure is the random number generator (RNG). While random numbers find use in a variety of applicat ...

EPFL2023

Timing Violation Induced Faults in Multi-Tenant FPGAs

Mirjana Stojilovic, Dina Gamaleldin Ahmed Shawky Mahmoud

FPGAs have made their way into the cloud, allowing users to gain remote access to the state-of-the-art reconfigurable fabric and implement their custom accelerators. Since FPGAs are large enough to accommodate multiple independent designs, the multi-tenant ...

IEEE2019

Learning new physics from a machine

Raffaele Tito D'Agnolo, Andrea Wulzer

We propose using neural networks to detect data departures from a given reference model, with no prior bias on the nature of the new physics responsible for the discrepancy. The virtues of neural networks as unbiased function approximants make them particu ...

AMER PHYSICAL SOC2019

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

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

An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time

Daniel Kuhn

Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages and high-dimensional state vectors are inherently difficult to solve. In fact, scenario tree-based algorithms are unsuitable for problems with many stages, ...

2009

Minimizing Generalized Buchi Automata

Sudeep Juvekar

We consider the problem of minimization of generalized Buchi automata. We show how to extend fair simulation and delayed simulation to the case where the Buchi automaton has multiple acceptance conditions. For fair simulation, we show how to efficiently co ...

2005

Rheological and physical properties of aliphatic hyperbranched polyesters

John Christopher Plummer

The effects of the size (pseudo-generation number) and nature of end groups on physical and rheological properties were investigated for a series of hyperbranched polyesters based on an ethoxylated pentaerythritol core and 2,2-bis-(hydroxymethyl) propionic ...

2004

Free energies and phase equilibria of chain molecules

Berend Smit

In this Article, a review is presented of recent developments in Monte Carlo simulations of chain molecules. The Rosenbluth chain insertion technique is used to calculate the free energy of the chain molecules. Furthermore, this insertion method is used to ...

1994