No abstract

The most challenging scenario for Kohn-Sham density-functional theory, that is, when the electrons move relatively slowly trying to avoid each other as much as possible because of their repulsion (strong-interaction limit), is reformulated here as an optimal transport (or mass transportation theory) problem, a well-established field of mathematics and economics. In practice, we show that to solve the problem of finding the minimum possible internal repulsion energy for N electrons in a given density ρ(r) is equivalent to find the optimal way of transporting N − 1 times the density ρ into itself, with the cost function given by the Coulomb repulsion. We use this link to set the strong-interaction limit of density-functional theory on firm ground and to discuss the potential practical aspects of this reformulation.

In this paper, we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound, but it is less pessimistic, thus allowing it to accept task sets that would be rejected using the original approach. The performance of the proposed approach is evaluated with respect to the classical Liu and Layland method and theoretical bounds are derived as a function of n (the number of tasks) and for the limit case of n tending to infinity. The analysis is also extended to include aperiodic servers and blocking times due to concurrency control protocols. Extensive simulations on synthetic tasks sets are presented to compare the effectiveness of the proposed test with respect to the Liu and Layland method and the exact response time analysis.

We present here a survey on some shape optimization problems that received particular attention in the last years. In particular, we discuss a class of problems, that we call mass optimization problems, where one wants to find the distribution of a given amount of mass which optimizes a given cost functional. The relation with mass transportation problems will be discussed, and several open problems will be presented.

In this paper we propose a novel schedulability analysis for verihing the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound but it is less pessimistic, so allowing to accept task sets that would be rejected using the original approach. The performance of the proposed approach is evaluated with respect to the classical Liu and Layland method, and theoretical bounds are derived as a function oyn (the number of tasks) and for the limit case of n tending to infinity. The analysis is also extended to include aperiodic servers and blocking times due to concurrency control protocols. Extensive simulations on synthetic tasks sets are presented to compare the effectiveness of the proposed test with respect to the Liu and Layland method and the exact response time analysis.