Graph neural networks (GNNs) have shown great promise in a variety of tasks involving graph data, including recommendation systems. However, as GNNs become more widely adopted in practical applications, concerns have ...
Over the past decade,the power conversion efficiency of halide perovskite solar cells has shown a rapid increase to 26.1%.The significant efficiency growth and the relative simplification of the technology for o...
详细信息
Over the past decade,the power conversion efficiency of halide perovskite solar cells has shown a rapid increase to 26.1%.The significant efficiency growth and the relative simplification of the technology for obtaining thin-film solar cells due to liquid printing methods determine the high potential for the low-cost perovskite solar cells ***,efficient use of cell geometry is comparable to the size of standard crystalline-Si wafers(156:156 mm and more).Therefore,modular geometry similar to amorphous-Si solar cell approaches is used to scale perovskite solar *** electrical connection of thin-film cells requires precise processing of the conductive layers that form the device p-i-n *** subject of research is the development of a full pulsed laser scribing cycle for inverted perovskite solar *** this work,we propose a study of a laser-patterning technology In_(2)O_(3):SnO_(2)(ITO)conductive layer and a photoactive perovskite layer Cs0,2(CH(NH_(2))_(2))_(0,8)PbI_(3).Process regimes of transparent conducting electrodes based on ITO and halide perovskite layer Cs_(0,2)(CH(NH_(2))_(2))_(0,8)PbI_(3)laser patterning were *** optimal parameters for the multipass mode processing of ITO and perovskite layer were *** cell was electrically isolated at a scribe line width of 30μm.
1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods ...
详细信息
1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods also exist,such as peer-to-peer networks and distributed hash *** technology,which is decentralized,anonymous,non-tamperable and anti-attack,can be applied to covert communication to solve the problems of traditional methods and improve the quality of communication.
The theory of intuitionistic fuzzy sets (IFSs) plays an essential role to deal with uncertainty and ambiguity. However, the IFSs deal only with anticipation, not periodicity. But, complex IFSs (CIFS) can handle both u...
详细信息
Distributed optimization is an important direction of research in modern optimization theory. Its applications include large scale machine learning, distributed signal processing and many others. The paper studies dec...
详细信息
The development of domestically generated food additives based on eco-technologies with specified functional-technological and bioactive qualities is now a significant focus of contemporary study. Pickering emulsions ...
详细信息
Inspired by a recent breakthrough of Mishchenko et al. [2022], who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains...
ISBN:
(纸本)9781713871088
Inspired by a recent breakthrough of Mishchenko et al. [2022], who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains the same communication acceleration as their method (ProxSkip). Our approach is very different, however: it is based on the celebrated method of Chambolle and Pock [2011], with several nontrivial modifications: i) we allow for an inexact computation of the prox operator of a certain smooth strongly convex function via a suitable gradient-based method (e.g., GD, Fast GD or FSFOM), ii) we perform a careful modification of the dual update step in order to retain linear convergence. Our general results offer the new state-of-the-art rates for the class of strongly convex-concave saddle-point problems with bilinear coupling characterized by the absence of smoothness in the dual function. When applied to federated learning, we obtain a theoretically better alternative to ProxSkip: our method requires fewer local steps (O(k1/3) or O(k1/4), compared to O(k1/2) of ProxSkip), and performs a deterministic number of local steps instead. Like ProxSkip, our method can be applied to optimization over a connected network, and we obtain theoretical improvements here as well.
In recent decades, global climate change has become one of the most critical environmental issues, leading to increased environmental and social concerns about the sustainability of logistics networks. This study prop...
详细信息
An analysis of the signaling systems used in the Intelligent Communication Network has been carried out. The main probabilistic characteristics of signal information delay are determined. A method for calculating thes...
详细信息
We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two f...
ISBN:
(纸本)9781713845393
We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for this task. First, we establish the first lower bounds on the number of decentralized communication rounds and the number of local computations required to find an ∈-accurate solution. Second, we design two optimal algorithms that attain these lower bounds: (i) a variant of the recently proposed algorithm ADOM (Kovalev et al., 2021) enhanced via a multi-consensus subroutine, which is optimal in the case when access to the dual gradients is assumed, and (ii) a novel algorithm, called ADOM+, which is optimal in the case when access to the primal gradients is assumed. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
暂无评论