Concept

Fonction monotone

Publications associées (64)

Characterization of equilibrium measures for critical reversible Nearest Particle Systems

We show that for critical reversible attractive Nearest Particle Systems all equilibrium measures are convex combinations of the upper invariant equilibrium measure and the point mass at all zeros, provided the underlying renewal sequence possesses moments ...

2008

Effects of temporal integration masking on the shape of visual backward functions

Gregory Francis

Many studies of cognition and perception use a visual mask to explore the dynamics of information processing of a target. Especially important in these applications is the time between the target and mask stimuli. A plot of some measure of target visibilit ...

2008

Optimal Capital and Risk Allocations for Law-and Cash-Invariant Convex Functions

Damir Filipovic, Gregor Svindland

In this paper we provide the complete solution to the existence and characterization problem of optimal capital and risk allocations for not necessarily monotone, law-invariant convex risk measures on the model space Lp, for any p ε [1;∞]. Our main result ...

Springer Verlag2008

Model Predictive Control Schemes for Consensus in multi-Agent Systems with Integrator Dynamics and Time-Varying Communication

Giancarlo Ferrari Trecate

In this paper we address the problem of driving a group of agents towards a consensus point when agents have a discrete-time integrator dynamics and the communication graph is time-varying. We propose two decentralized Model Predictive Control (MPC) scheme ...

2007

The scaling of the broadcast capacity of extended wireless networks with cooperative relays

Michael Christoph Gastpar

We study the scaling of the broadcast capacity for a network with a single source and f(N) cooperative relays where N is the number of destinations and f(.) is an increasing function. We consider random extended networks (the network area goes to infinity ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Configurational entropy of hard spheres

Giuseppe Foffi

We numerically calculate the configurational entropy Sconf of a binary mixture of hard spheres, by using a perturbed Hamiltonian method trapping the system inside a given state, which requires fewer assumptions than the previous methods (Speedy 1998 Mol.Ph ...

2007

ODPOP: An algorithm for Open/Distributed Constraint Optimization

Boi Faltings, Adrian Petcu

We propose ODPOP, a new distributed algorithm for \textit{open multiagent combinatorial optimization} \cite{Faltings2005c}. The ODOP algorithm explores the same search space as the dynamic programming algorithm DPOP~\cite{Petcu2005} or the AND/OR search al ...

2006

Tests on Reduced Scale Models for the Refurbishment Projects of Hydroelectric Power Plants

François Avellan, Henri-Pascal Mombelli

For the refurbishment projects, one of the most important problems is to evaluate the economical efficiency of the project. It is difficult to estimate, with good accuracy, the hydraulic efficiency in situ for existing configurations and even more difficul ...

2003

Fluorescence yield and lifetime of isolated polydiacetylene chains: Evidence for a one-dimensional exciton band in a conjugated polymer

Jean-Daniel Ganière

The fluorescence lifetime tau and quantum yield eta(f) of isolated red polydiacetylene chains dispersed in their monomer single crystal matrix were measured between 10 and 100 K. tau increases up to 120 ps at 40 K, then rapidly decreases at higher T. eta(f ...

2002

Smoothing Spline Distribution Function Estimation: Theory

Eva Maria Restle

The estimation of cumulative distributions is classically performed using the empirical distribution function. This estimator has excellent properties but is lacking continuity. Smooth versions of the empirical distribution function have been obtained by k ...

2001

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