Concept

Temps propre

Publications associées (62)

Encoding and decoding of information

Method and system for weighting the amplitude of an event in a time -based code. The time-based code is divided into time intervals. Each of the time intervals of the time-based code corresponds to a digit in the received signal. Each digit of a first stat ...

2011

A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)

Yuri Faenza

We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a sim ...

2011

Chaotic mixing using source-sink microfluidic flows in a PDMS chip

Martinus Gijs, Abdeljalil Sayah, Caroline Vandevyver, Hüseyin Cumhur Tekin, Ata Tuna Ciftlik, Venkataragavalu Sivagnanam

We present an active fixed-volume mixer based on the creation of multiple source–sink microfluidic flows in a polydimethylsiloxane (PDMS) chip without the need of external or internal pumps. To do so, four different pressure-controlled actuation chambers a ...

Springer-Verlag2011

Active microfluidic mixer using virtual source-sink pairs for DNA purification

Martinus Gijs, Caroline Vandevyver, Hüseyin Cumhur Tekin

We present an active mixer based on the creation of virtual source-sink pairs in a polydimethylsiloxane (PDMS) chip. Perfect mixing is achieved in only a sub-second time interval for a compact 5 μL mixing volume. This excellent performance is achieved than ...

2010

The gist of everything new: personalized top-k processing over web 2.0 streams

Karl Aberer, Sebastian Michel, Parisa Haghani

Web 2.0 portals have made content generation easier than ever with millions of users contributing news stories in form of posts in weblogs or short textual snippets as in Twitter. Efficient and effective filtering solutions are key to allow users stay tune ...

ACM2010

Evidence of time-dependent CP violation in the decay B^{0}→D^{+}D^{-}

Olivier Schneider, Aurelio Bay, Chao Wang, Tagir Aushev, Vladislav Balagura, Jean Wicht, Remi Léandre Albert Louvot, Nicolas Zwahlen, Jing Li

We report a measurement of the CP-odd fraction and the time-dependent CP violation in B-0 -> D*+D*- decays, using 657x10(6) BB events collected at the Upsilon(4S) resonance with the Belle detector at the KEKB asymmetric-energy e(+)e(-) collider. We measure ...

2009

Light transport regimes in slow light photonic crystal waveguides

Romuald Houdré, Hua Zhang, Nicolas Le Thomas, Jana Jágerská, Vasily Zabelin

The dispersive properties of waves are strongly affected by inevitable residual disorder in man-made propagating media, in particular in the slow wave regime. By a direct measurement of the dispersion curve in k space, we show that the nature of the guided ...

2009

Light transport regimes in slow light photonic crystal waveguides

2009

Linear and nonlinear susceptibilities from diffusion quantum Monte Carlo: Application to periodic hydrogen chains

Nicola Marzari

We calculate the linear and nonlinear susceptibilities of periodic longitudinal chains of hydrogen dimers with different bond-length alternations using a diffusion quantum Monte Carlo approach. These quantities are derived from the changes in electronic po ...

2009

The mental time line: an analogue of the mental number line in the mapping of life events

Olaf Blanke

A crucial aspect of the human mind is the ability to project the self along the time line to past and future. It has been argued that such self-projection is essential to re-experience past experiences and predict future events. In-depth analysis of a nove ...

Elsevier2009

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