Institution
Paris Dauphine University
Education•Paris, France•
About: Paris Dauphine University is a education organization based out in Paris, France. It is known for research contribution in the topics: Context (language use) & Population. The organization has 1766 authors who have published 6909 publications receiving 162747 citations. The organization is also known as: Paris Dauphine & Dauphine.
Topics: Context (language use), Population, Approximation algorithm, Bounded function, Nonlinear system
Papers published on a yearly basis
Papers
More filters
••
01 Jan 2016TL;DR: In this paper, an entropic regularization of the Kantorovich formulation of the optimal transport problem is introduced, which corresponds to the projection of a vector on the intersection of the constraints with respect to the Kullback-Leibler distance.
Abstract: In this chapter, we present a numerical method, based on iterative Bregman projections, to solve the optimal transport problem with Coulomb cost. This problem is related to the strong interaction limit of Density Functional Theory. The first idea is to introduce an entropic regularization of the Kantorovich formulation of the Optimal Transport problem. The regularized problem then corresponds to the projection of a vector on the intersection of the constraints with respect to the Kullback-Leibler distance. Iterative Bregman projections on each marginal constraint are explicit which enables us to approximate the optimal transport plan. We validate the numerical method against analytical test cases.
46 citations
••
01 Jan 2002
TL;DR: In this article, a generalisation of the concordance/discordance principle for positive and negative reasons has been proposed, where the discordance test can be viewed as the evaluation of the existence of negative reasons against the same sentence.
Abstract: The principle of concordance/discordance was introduced by B. Roy in his very early work on Multiple Criteria Decision Analysis. Although such a principle is grounded by strong evidence from real life decision situations, the way in which it has been implemented in existing MCDA methods allows only for its partial and limited use. Indeed, the principle lacks a theoretical frame enabling a more general use in decision analysis. The paper presents a possible generalisation of this principle under the concepts of positive and negative reasons. For this purpose, a new formalism, (a four valued logic) is suggested. Under such a formalism the concordance test is seen as the evaluation of the existence of positive reasons supporting the sentence “x is at least as good as y”, while the discordance test can be viewed as the evaluation of the existence of negative reasons against the same sentence. A number of results obtained in preference modelling and aggregation shows the potentiality of this approach.
46 citations
••
TL;DR: In this paper, the authors investigate the adequacy of the current LCA data quality assessment approach from a management perspective by applying the ecoinvent Data Quality System (DQS) to a primary Life Cycle Assessment (LCA) data collection project, including an immersion within the organisation and taking subjective experiences into account during the data collection process.
46 citations
••
TL;DR: In this paper, it was shown that solutions of small amplitude to the one-dimensional Gross-Pitaevskii equation split into two waves with opposite constant speeds, each of which are solutions to a Korteweg-de Vries equation.
Abstract: In this paper, we proceed along our analysis of the Korteweg-de Vries approximation of the Gross-Pitaevskii equation initiated in a previous paper. At the long-wave limit, we establish that solutions of small amplitude to the one-dimensional Gross-Pitaevskii equation split into two waves with opposite constant speeds $\pm \sqrt{2}$, each of which are solutions to a Korteweg-de Vries equation. We also compute an estimate of the error term which is somewhat optimal as long as travelling waves are considered. At the cost of higher regularity of the initial data, this improves our previous estimate.
46 citations
••
TL;DR: It is shown that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes and it is proved that these patterns cannot be modelled by ordinary Petrinets.
Abstract: In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking. Here we present and develop the theory of such a model, the recursive Petri nets. First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. Furthermore, we prove that these patterns cannot be modelled by ordinary Petri nets. Then we study the decidability of some problems: reachability, finiteness and bisimulation. At last, we develop the concept of linear invariants for this kind of nets and we design efficient computations specifically tailored to take advantage of their structure.
46 citations
Authors
Showing all 1819 results
Name | H-index | Papers | Citations |
---|---|---|---|
Pierre-Louis Lions | 98 | 283 | 57043 |
Laurent D. Cohen | 94 | 417 | 42709 |
Chris Bowler | 87 | 288 | 35399 |
Christian P. Robert | 75 | 535 | 36864 |
Albert Cohen | 71 | 368 | 19874 |
Gabriel Peyré | 65 | 303 | 16403 |
Kerrie Mengersen | 65 | 737 | 20058 |
Nader Masmoudi | 62 | 245 | 10507 |
Roland Glowinski | 61 | 393 | 20599 |
Jean-Michel Morel | 59 | 302 | 29134 |
Nizar Touzi | 57 | 224 | 11018 |
Jérôme Lang | 57 | 277 | 11332 |
William L. Megginson | 55 | 169 | 18087 |
Alain Bensoussan | 55 | 417 | 22704 |
Yves Meyer | 53 | 128 | 14604 |