Concept

Alan Turing

Publications associées (13)

Nonlinear dynamics and Kerr frequency comb formation in lattices of coupled microresonators

Tobias Kippenberg, Aleksandr Tusnin, Kenichi Komagata, Alexey Tikan

Recently, substantial progress has been made in the understanding of microresonators frequency combs based on dissipative Kerr solitons (DKSs). However, most of the studies have focused on the single-resonator level. Coupled resonator systems can open new ...

Berlin2023

Questioning Wizard of Oz: Effects of Revealing the Wizard behind the Robot

Pierre Dillenbourg, Pierre Pravin Oppliger, Barbara Bruno, Jauwairia Nasir

Wizard of Oz, a very commonly employed technique in human-robot interaction, faces the criticism of being deceptive as the humans interacting with the robot are told, if at all, only at the end of their interaction that there was in fact a human behind the ...

2022

Atom: A Stream Cipher with Double Key Filter

Andrea Felice Caforio, Subhadeep Banik, Willi Meier

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however ...

2021

What graph neural networks cannot learn: depth vs width

Andreas Loukas

This paper studies the expressive power of graph neural networks falling within the message-passing framework (GNNmp). Two results are presented. First, GNNmp are shown to be Turing universal under sufficient conditions on their depth, width, node attribut ...

2020

Block Oriented Programming: Automating Data-Only Attacks

Mathias Josef Payer

With the widespread deployment of Control-Flow Integrity (CFI), control-flow hijacking attacks, and consequently code reuse attacks, are significantly more difficult. CFI limits control flow to well-known locations, severely restricting arbitrary code exec ...

ASSOC COMPUTING MACHINERY2018

Algorithmic Verification of Component-based Systems

Qiang Wang

This dissertation discusses algorithmic verification techniques for concurrent component-based systems modeled in the Behavior-Interaction-Priority (BIP) framework with both bounded and unbounded concurrency. BIP is a component framework for mixed software ...

EPFL2017

Turing pattern formation driven by cross diffusion for a superdiffusive Lotka-Volterra competitive model

Ricardo Esteban Ruiz Baier

We focus our attention on the effects of introducing the fractional-in-space operator into a Lotka-Volterra competitive model describing population superdiffusion. First, we are interested in how cross superdiffusion influences the formation of spatial pat ...

2014

Finite volume element approximation of an inhomogeneous Brusselator model with cross-diffusion

Ricardo Esteban Ruiz Baier

This paper is concerned with the study of pattern formation for an inhomogeneous Brusselator model with cross-diffusion, modeling an autocatalytic chemical reaction taking place in a three-dimensional domain. For the spatial discretization of the problem w ...

Elsevier2014

On Sphere-Filling Ropes

Henryk Gerlach

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...

2011

Wireless network simplification: the Gaussian N-relay diamond network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian N-relay diamond net- work, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the ...

2011

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