Publication

Some planar isospectral domains

Related publications (39)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Exploiting the ALICE HLT for PROOF by scheduling of Virtual Machines

Marco Meoni

The HLT (High-Level Trigger) group of the ALICE experiment at the LHC has prepared a virtual Parallel ROOT Facility (PROOF) enabled cluster (HAF - HLT Analysis Facility) for fast physics analysis, detector calibration and reconstruction of data samples. Th ...

Iop Publishing Ltd, Dirac House, Temple Back, Bristol Bs1 6Be, England2011

Backtracking of Colloids: A Multiparticle Collision Dynamics Simulation Study

Giuseppe Foffi, Maxim Belushkin

The role of sound in the dynamics of mesoscale systems is typically neglected, since frequently the associated time scales are much smaller than all the other time scales of interest. However, for sufficiently small objects embedded in a solvent with a suf ...

2011

Conception acoustique de systèmes microtechniques

Jean-Daniel Lüthi

Considered as one of the most difficult complications in horology, the mechanical chiming watch, known as the striking watch, has today become one of the symbols of high craftsmanship. When it chimes the hour the sound of a striking watch must not only be ...

EPFL2011

Oriented paths in n-chromatic digraphs

Rajai Nasser

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...

2010

Stochastic Optimization of Sailing Trajectories in an America's Cup Race

Frédéric Dumas

The main objective of the thesis is the study and the determination of an optimal navigation strategy, for a sailboat in an America's Cup race, by methods of stochastic optimization. Such methods are appropriate because the sailing team expects the wind to ...

EPFL2010

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

David Pritchard

Recently, Byrka, Grandoni, RothvoBand Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integr ...

Elsevier2010

Interactive Parallel Analysis on the ALICE Grid with the PROOF Framework

Marco Meoni

The ALICE experiment at CERN LHC is intensively using a PROOF cluster for fast analysis and reconstruction. The current system (CAF - CERN Analysis Facility) consists of 120 CPU cores and about 45 TB of local space. PROOF enables interactive parallel proce ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Dynamical system for learning the waveform and frequency of periodic signals - application to drumming

Auke Ijspeert, Sarah Dégallier Rochat

The paper presents a two-layered system for learning and encoding a periodic signal and its application to a drumming task. The two layers are the dynamical system responsible for extracting the main frequency of the input signal, based on adaptive frequen ...

2008

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We consider the case where the number of transitions per time slot per object vanishes as

N

grows. We show that, ...

2008

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

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

N

grows. We show that, ...

2008