Concept

Dynkin diagram

Related publications (36)

Fundamental Diagram Estimation Through Passing Rate Measurements in Congestion

Classically, fundamental diagrams are estimated front aggregated data at a specific location. Such a measurement method may lead to inconsistency, which mainly explains the current controversy about their shape. This paper proposes a new estimation method ...

Institute of Electrical and Electronics Engineers2009

Fundamental Diagram of Traffic Flows on Urban Roads Local Versus Whole-Link Approaches

Fundamental diagrams of traffic flow variables have been quite useful in determining freeway operations quality. However, they are usually not used for that purpose on urban roads. This work is an approach toward utilizing the fundamental diagram on urban ...

National Academy of Sciences2009

Visual contracts (VCs)

José Diego de la Cruz Garcia

Model-Driven Engineering (MDE) harbors the promise of developing software-based systems with little or no coding. Instead of coding, it is envisioned that software engineers build models that are automatically translated into code. The modeling notation of ...

EPFL2008

Affine Models

Damir Filipovic

A fine term structure models have gained significant attention in the finance literature, mainly due to their analytical tractability and statistical flexibility. The aim of this article is to present both theoretical foundations as well as empirical aspec ...

Vienna Institute of Finance2008

Affine Processes and Applications in Finance

Damir Filipovic

We provide the definition and a complete characterization of regular affine processes. This type of process unifies the concepts of continuousstate branching processes with immigration and Ornstein-Uhlenbeck type processes. We show, and provide foundations ...

2003

Bounded cohomology of lattices in higher rank Lie groups

Nicolas Monod

Let G be an irreducible uniform lattice in a higher semi-simple rank Lie group or algebraic group. We prove that any G-action on the circle by C1 diffeomorphisms is finite. This is achieved by showing that natural map from bounded to usual second cohomolog ...

1999

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.