Concept

Classe de Chern

Publications associées (49)

Limit Behaviour of the Voter Model, Exclusion Process and Regenerative Chains

Though the following topics seem unlinked, most of the tools used in this thesis are related to random walks and renewal theory. After introducing the voter model, we consider the parabolic Anderson model with the voter model as catalyst. In GÄRTNER, DEN H ...

EPFL2012

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with a BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, po ...

2011

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with an open-source BGP router. DiCE quickly detects three important classes of faults, resulting from configuration ...

Association for Computing Machinery2011

Déformations conformes des variétés de Finsler-Ehresmann

Ratiba Djelid

An intrinsic approach to Finsler geometry is proposed. A concept of Finsler- Ehresmann manifold, denoted by (M,F,H), is introduced and a generalized Chern connection is built for this manifold. Conformal deformations on this manifold are considered. First, ...

EPFL2011

Cobordism, Cohomology Theories and Formal Group Laws

Lev Kiwi

We first explore the notion of G-manifold, cobordism and then discuss the generalized Pontrjagin-Thom Theorem. We then compute the cobordism rings Ω (...) using stable homotopy theory. Secondly, we investigate the relations between cohomology theories and ...

2011

A rigid triple of conjugacy classes in G(2)

Martin W. Liebeck, Claude Marion

We produce a rigid triple of classes in the algebraic group G(2) in characteristic 5, and use it to show that the finite groups G(2)(5(n)) are not (2, 5, 5)-generated. ...

De Gruyter2011

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

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

Toward a Theory of Input Acceptance for Transactional Memories

Vincent Gramoli, Pascal Felber

As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM ...

2008

Exponential localization of Wannier functions in insulators

Nicola Marzari

The exponential localization of Wannier functions in two or three dimensions is proven for all insulators that display time-reversal symmetry, settling a long-standing conjecture. Our proof relies on the equivalence between the existence of analytic quasi- ...

2007

Classes of stochastically switched (blinking) systems

Martin Hasler, Igor Belykh

It is investigated to what extent the trajectories of a stochastically switched (blinking) system follow the corresponding trajectories of the averaged system. Four cases have to be distinguished, depending on whether or not the averaged system has a uniqu ...

2007

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