Results 21 to 30 of about 255,733 (268)
AbstractWe ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an n-partite system $$A = (A_1, \ldots A_n)$$ A = ( A 1 , … A n ) corresponds to the sum of the entropies of its parts $$A_i$$ A i .
Dupuis, Frédéric +2 more
openaire +3 more sources
Acknowledgement to Reviewers of Entropy in 2013
The editors of Entropy would like to express their sincere gratitude to the following reviewers for assessing manuscripts in ...
Entropy Editorial Office
doaj +1 more source
High-Temperature Mechanical Behavior of Cobalt-Free FeMnCrNi(Al) High-Entropy Alloys
The high-temperature properties of new alloys need to be investigated to guide the hot working process. The temperature sensitivity of various microstructures of Fe45Mn15Cr15Ni25 and Fe35Mn15Cr15Ni25Al10 cobalt-free high-entropy alloys was investigated ...
Dan Liu +4 more
doaj +1 more source
Acknowledgement to Reviewers of Entropy in 2018
Rigorous peer-review is the corner-stone of high-quality academic publishing [...]
Entropy Editorial Office
doaj +1 more source
Acknowledgement to Reviewers of Entropy in 2015
The editors of Entropy would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2015. [...]
Entropy Editorial Office
doaj +1 more source
BD entropy and Bernis–Friedman entropy
In this note, we propose in the full generality a link between the BD entropy introduced by D. Bresch and B. Desjardins for the viscous shallow-water equations and the Bernis–Friedman (called BF) dissipative entropy introduced to study the lubrication equations.
Bresch, Didier +4 more
openaire +5 more sources
Let $S(\rho)=-\Tr (\rho\log\rho)$ be the von Neumann entropy of an $N$-dimensional quantum state $\rho$ and $e_2(\rho)$ the second elementary symmetric polynomial of the eigenvalues of $\rho$. We prove the inequality S(\rho) \;\le \; c(N) \; \sqrt{e_2(\rho)} where $c(N)=\log(N) \, \sqrt{\frac{2N}{N-1}}$.
Meik Hellmund, Armin Uhlmann
openaire +2 more sources
AbstractWe reconsider the old problem of sorting under partial information, and give polynomial time algorithms for the following tasks: (1) Given a partial order P, find (adaptively) a sequence of comparisons (questions of the form, "is x < y?") which sorts ( i.e., finds an unknown linear extension of) P using O(log(e(P))) comparisons in worst case ...
Jeff Kahn 0001, Jeong Han Kim
openaire +1 more source
On behalf of the Editor-in-Chief, Prof. Dr. Kevin H. Knuth, we are pleased to announce the Entropy Best Paper Award for 2018 [...]
Entropy Editorial Office
doaj +1 more source
Acknowledgement to Reviewers of Entropy in 2017
Peer review is an essential part in the publication process, ensuring that Entropy maintains high quality standards for its published papers.[...]
Entropy Editorial Office
doaj +1 more source

