Publication

Cavity Optomechanics: Cooling of a Micromechanical Oscillator into the Quantum Regime

Related publications (117)

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.

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010

On the unification of thermal perception and adaptive actions

Darren Robinson, Frédéric Haldi

Occupants exercise adaptive actions in response to discomforting environmental stimuli in an attempt to restore their comfort. These responses to adaptive actions are either ignored (conventional PMV models) or handled in an aggregated way (adaptive therma ...

Elsevier2010

Maximizing the net present value of a project under uncertainty

Daniel Kuhn, Wolfram Wiesemann

We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-inde ...

Elsevier2010

GENERATING PROBABILISTIC PATH OBSERVATION FROM GPS DATA FOR ROUTE CHOICE MODELING

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

Abstract: Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this pap ...

2009

Convexity bounds for BSDE solutions, with applications to indiﬀerence valuation

Christoph Frei, Semyon Malamud

We consider backward stochastic diﬀerential equations (BSDEs) with a particular quadratic generator and study the behaviour of their solu- tions when the probability measure is changed, the ﬁltration is shrunk, or the underlying probability space is transf ...

2009

Approximation of Event Probabilities in Noisy Cellular Processes

Maria-Emanuela-Canini Mateescu, Verena Wolf

Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculati ...

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

Valuation of electricity swing options by multistage stochastic programming

Daniel Kuhn

Electricity swing options are Bermudan-style path-dependent derivatives on electrical energy. We consider an electricity market driven by several exogenous risk factors and formulate the pricing problem for a class of swing option contracts with energy and ...

Elsevier2009

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

A quasi-dynamic capacity constrained frequency-based transit assignment model

This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...

Elsevier2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009