Explanation of the Gibbs paradox within the framework of quantum thermodynamics

The issue of the Gibbs paradox is that when considering mixing of two gases within classical thermodynamics, the entropy of mixing appears to be a discontinuous function of the difference between the gases: it is finite for whatever small difference, but vanishes for identical gases. The resolution offered in the literature, with help of quantum mixing entropy, was later shown to be unsatisfactory precisely where it sought to resolve the paradox. Macroscopic thermodynamics, classical or quantum, is unsuitable for explaining the paradox, since it does not deal explicitly with the difference between the gases. The proper approach employs quantum thermodynamics, which deals with finite quantum systems coupled to a large bath and a macroscopic work source. Within quantum thermodynamics, entropy generally looses its dominant place and the target of the paradox is naturally shifted to the decrease of the maximally available work before and after mixing (mixing ergotropy). In contrast to entropy this is an unambiguous quantity. For almost identical gases the mixing ergotropy continuously goes to zero, thus resolving the paradox. In this approach the concept of ``difference between the gases'' gets a clear operational meaning related to the possibilities of controlling the involved quantum states. Difficulties which prevent resolutions of the paradox in its entropic formulation do not arise here. The mixing ergotropy has several counter-intuitive features. It can increase when less precise operations are allowed. In the quantum situation (in contrast to the classical one) the mixing ergotropy can also increase when decreasing the degree of mixing between the gases, or when decreasing their distinguishability. These points go against a direct association of physical irreversibility with lack of information.Comment: Published version. New title. 17 pages Revte

Coordination in multiagent systems and Laplacian spectra of digraphs

Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis partially obtained by the present authors. We also discuss the application of these results to decentralized control and touch upon some problems of spectral graph theory.Comment: 15 pages, 2 figures, 40 references. To appear in Automation and Remote Control, Vol.70, No.3, 200

DETD: Dynamic policy for case base maintenance based on EK-NNclus algorithm and case Types Detection

International audienceCase Based Reasoning (CBR) systems know a success in various domains. Consequently, we find several works focusing on Case Base Maintenance (CBM) that aim to preserve CBR systems performance. Thus, CBM tools are generally offering techniques to select only the most potential cases for problem-solving. However, cases are full of imperfection since they represent real world situations, which makes this task harder. In addition, new problems having substantially new solutions will be found in case bases over the time. Hence, we aim, in this paper, to propose a new CBM approach having the ability to manage uncertainty and the dynamic aspect of maintenance using the evidential clustering technique called EK-NNclus based on belief function theory, where clusters' number is fixed automatically and changes from one maintenance application to another. Finally, the maintenance task is performed through selecting only two types of cases