Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userWhen Band Convergence is Not Beneficial for Thermoelectrics
104
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Band convergence is considered a clear benefit to thermoelectric performance because it increases the charge carrier concentration for a given Fermi level, which typically enhances charge conductivity while preserving the Seebeck coefficient. However, this advantage hinges on the assumption that interband scattering of carriers is weak or insignificant. With first-principles treatment of electron-phonon scattering in CaMg$_{2}$Sb$_{2}$-CaZn$_{2}$Sb$_{2}$ Zintl system and full Heusler Sr$_{2}$SbAu, we demonstrate that the benefit of band convergence can be intrinsically negated by interband scattering depending on the manner in which bands converge. In the Zintl alloy, band convergence does not improve weighted mobility or the density-of-states effective mass. We trace the underlying reason to the fact that the bands converge at one k-point, which induces strong interband scattering of both the deformation-potential and the polar-optical kinds. The case contrasts with band convergence at distant k-points (as in the full Heusler), which better preserves the single-band scattering behavior thereby successfully leading to improved performance. Therefore, we suggest that band convergence as thermoelectric design principle is best suited to cases in which it occurs at distant k-points.
rate research
Read More
Recent empirical results using quantum annealing hardware have shown that mid anneal pausing has a surprisingly beneficial impact on the probability of finding the ground state for of a variety of problems. A theoretical explanation of this phenomenon has thus far been lacking. Here we provide an analysis of pausing using a master equation framework, and derive conditions for the strategy to result in a success probability enhancement. The conditions, which we identify through numerical simulations and then prove to be sufficient, require that relative to the pause duration the relaxation rate is large and decreasing right after crossing the minimum gap, small and decreasing at the end of the anneal, and is also cumulatively small over this interval, in the sense that the system does not thermally equilibrate. This establishes that the observed success probability enhancement can be attributed to incomplete quantum relaxation, i.e., is a form of beneficial non-equilibrium coupling to the environment.
Understanding how to optimize electronic band structures for thermoelectrics is a topic of long-standing interest in the community. Prior models have been limited to simplified bands and/or scattering models. In this study, we apply more rigorous scattering treatments to more realistic model band structures - upward-parabolic bands that inflect to an inverted parabolic behavior - including cases of multiple bands. In contrast to common descriptors (e.g., quality factor and complexity factor), the degree to which multiple pockets improve thermoelectric performance is bounded by interband scattering and the relative shapes of the bands. We establish that extremely anisotropic `flat-and-dispersive bands, although best-performing in theory, may not represent a promising design strategy in practice. Critically, we determine optimum bandwidth, dependent on temperature and lattice thermal conductivity, from perfect transport cutoffs that can in theory significantly boost $zT$ beyond the values attainable through intrinsic band structures alone. Our analysis should be widely useful as the thermoelectric research community eyes $zT>3$.
Most of prior works optimize caching policies based on the following assumptions: 1) every user initiates request according to content popularity, 2) all users are with the same active level, and 3) users are uniformly located in the considered region. In practice, these assumptions are often not true. In this paper, we explore the benefit of optimizing caching policies for base stations by exploiting user preference considering the spatial locality and different active level of users. We obtain optimal caching policies, respectively minimizing the download delay averaged over all file requests and user locations in the network (namely network average delay), and minimizing the maximal weighted download delay averaged over the file requests and location of each user (namely maximal weighted user average delay), as well as minimizing the weighted sum of both. The analysis and simulation results show that exploiting heterogeneous user preference and active level can improve user fairness, and can also improve network performance when users are with spatial locality.
Sparsity promoting regularization is an important technique for signal reconstruction and several other ill-posed problems. Theoretical investigation typically bases on the assumption that the unknown solution has a sparse representation with respect to a fixed basis. We drop this sparsity assumption and provide error estimates for non-sparse solutions. After discussing a result in this direction published earlier by one of the authors and coauthors we prove a similar error estimate under weaker assumptions. Two examples illustrate that this set of weaker assumptions indeed covers additional situations which appear in applications.
Many structured prediction tasks in machine vision have a collection of acceptable answers, instead of one definitive ground truth answer. Segmentation of images, for example, is subject to human labeling bias. Similarly, there are multiple possible pixel values that could plausibly complete occluded image regions. State-of-the art supervised learning methods are typically optimized to make a single test-time prediction for each query, failing to find other modes in the output space. Existing methods that allow for sampling often sacrifice speed or accuracy. We introduce a simple method for training a neural network, which enables diverse structured predictions to be made for each test-time query. For a single input, we learn to predict a range of possible answers. We compare favorably to methods that seek diversity through an ensemble of networks. Such stochastic multiple choice learning faces mode collapse, where one or more ensemble members fail to receive any training signal. Our best performing solution can be deployed for various tasks, and just involves small modifications to the existing single-mode architecture, loss function, and training regime. We demonstrate that our method results in quantitative improvements across three challenging tasks: 2D image completion, 3D volume estimation, and flow prediction.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
