اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWeighted reciprocal of temperature, weighted thermal flux, and their applications in finite-time thermodynamics
106
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The concepts of weighted reciprocal of temperature and weighted thermal flux are proposed for a heat engine operating between two heat baths and outputting mechanical work. With the aid of these two concepts, the generalized thermodynamic fluxes and forces can be expressed in a consistent way within the framework of irreversible thermodynamics. Then the efficiency at maximum power output for a heat engine, one of key topics in finite-time thermodynamics, is investigated on the basis of a generic model under the tight-coupling condition. The corresponding results have the same forms as those of low-dissipation heat engines [M. Esposito, R. Kawai, K. Lindenberg, and C. Van den Broeck, {Phys. Rev. Lett.} textbf{105}, 150603 (2010)]. The mappings from two kinds of typical heat engines, such as the low-dissipation heat engine and the Feynman ratchet, into the present generic model are constructed. The universal efficiency at maximum power output up to the quadratic order is found to be valid for a heat engine coupled symmetrically and tightly with two baths. The concepts of weighted reciprocal of temperature and weighted thermal flux are also transplanted to the optimization of refrigerators.
قيم البحث
اقرأ أيضاً
In this paper we introduce the concept of weighted deficiency for abstract and pro-$p$ groups and study groups of positive weighted deficiency which generalize Golod-Shafarevich groups. In order to study weighted deficiency we introduce weight
In this paper, we establish an optimal dual version of trace estimate involving angular regularity. Based on this estimate, we get the generalized Morawetz estimates and weighted Strichartz estimates for the solutions to a large class of evolution eq
uations, including the wave and Schr{o}dinger equation. As applications, we prove the Strauss conjecture with a kind of mild rough data for $2le nle 4$, and a result of global well-posedness with small data for some nonlinear Schr{o}dinger equation with $L^2$-subcritical nonlinearity.
We show that the known matrix representations of the stationary state algebra of the Asymmetric Simple Exclusion Process (ASEP) can be interpreted combinatorially as various weighted lattice paths. This interpretation enables us to use the constant t
erm method (CTM) and bijective combinatorial methods to express many forms of the ASEP normalisation factor in terms of Ballot numbers. One particular lattice path representation shows that the coefficients in the recurrence relation for the ASEP correlation functions are also Ballot numbers. Additionally, the CTM has a strong combinatorial connection which leads to a new ``canonical lattice path representation and to the ``omega-expansion which provides a uniform approach to computing the asymptotic behaviour in the various phases of the ASEP. The path representations enable the ASEP normalisation factor to be seen as the partition function of a more general polymer chain model having a two parameter interaction with a surface.
Traffic fluctuation has so far been studied on unweighted networks. However many real traffic systems are better represented as weighted networks, where nodes and links are assigned a weight value representing their physical properties such as capaci
ty and delay. Here we introduce a general random diffusion (GRD) model to investigate the traffic fluctuation in weighted networks, where a random walks choice of route is affected not only by the number of links a node has, but also by the weight of individual links. We obtain analytical solutions that characterise the relation between the average traffic and the fluctuation through nodes and links. Our analysis is supported by the results of numerical simulations. We observe that the value ranges of the average traffic and the fluctuation, through nodes or links, increase dramatically with the level of heterogeneity in link weight. This highlights the key role that link weight plays in traffic fluctuation and the necessity to study traffic fluctuation on weighted networks.
The asymptotic (non)equivalence of canonical and microcanonical ensembles, describing systems with soft and hard constraints respectively, is a central concept in statistical physics. Traditionally, the breakdown of ensemble equivalence (EE) has been
associated with nonvanishing relative canonical fluctuations of the constraints in the thermodynamic limit. Recently, it has been reformulated in terms of a nonvanishing relative entropy density between microcanonical and canonical probabilities. The earliest observations of EE violation required phase transitions or long-range interactions. More recent research on binary networks found that an extensive number of local constraints can also break EE, even in absence of phase transitions. Here we study for the first time ensemble nonequivalence in weighted networks with local constraints. Unlike their binary counterparts, these networks can undergo a form of Bose-Einstein condensation (BEC) producing a core-periphery structure where a finite fraction of the link weights concentrates in the core. This phenomenon creates a unique setting where local constraints coexist with a phase transition. We find surviving relative fluctuations only in the condensed phase, as in more traditional BEC settings. However, we also find a non-vanishing relative entropy density for all temperatures, signalling a breakdown of EE due to the presence of an extensive number of constraints, irrespective of BEC. Therefore, in presence of extensively many local constraints, vanishing relative fluctuations no longer guarantee EE.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
